3

Author: Vitalii Telychko

euler_project/even_fibonacci_numbers.js

@@ -10,13 +10,14 @@ By considering the terms in the Fibonacci sequence whose values do not exceed nt
 // function fiboEvenSum(n) {
 //   var fib = [], i, j, sum = 0;
 //   fib[0] = 1;
+//   if(fib[0] % 2 === 0) sum += fib[0];
 //   fib[1] = 2;
+//   if(fib[1] % 2 === 0) sum += fib[1];
 //   for(i = 2; i <= n; i += 1) {
 //     fib[i] = fib[i - 2] + fib[i - 1];
+//     if(fib[i] % 2 === 0) sum += fib[i];
 //   }
-//   for(j = 0; j < fib.length; j += 1) {
-//     if(fib[j] % 2 === 0) sum += fib[j];
-//   }
+//
 //   return sum;
 // }
 //

euler_project/largest_palindrome_product.js

@@ -0,0 +1,6 @@
+function largestPalindromeProduct(n) {
+  // Good luck!
+  return true;
+}
+
+largestPalindromeProduct(3);

euler_project/largest_prime_factor.js

@@ -0,0 +1,64 @@
+/*
+
+The prime factors of 13195 are 5, 7, 13 and 29.
+
+What is the largest prime factor of the given number?
+
+*/
+
+// --- Not very good solution ---
+
+// var largestNumber = 0;
+//
+// function largestPrimeFactor(number) {
+//   var i, result;
+//   for(i = number; i >= 1 ; i -= 1) {
+//     result = number / i;
+//     if(result % 1 === 0) {
+//       if(number !== i) {
+//         if(i < 0) return;
+//         else {
+//           if(largestNumber < result)
+//             largestNumber = result;
+//           return largestPrimeFactor(i);
+//         }
+//       }
+//     }
+//   }
+//   return largestNumber;
+// }
+//
+// largestPrimeFactor(13195);
+
+// --- Good solution ---
+
+// var largestNumber = 0, i = 2;
+//
+// function largestPrimeFactor(number) {
+//   largestNumber = i;
+//   if(number % i === 0) number = number / i;
+//
+//   if(number <= i) return largestNumber;
+//   else {
+//     i += 1;
+//     return largestPrimeFactor(number);
+//   }
+//
+// }
+//
+// largestPrimeFactor(13195);
+
+// --- FreeCodeCamp Solution ---
+// function largestPrimeFactor(number) {
+//   let prime = 2, max = 1;
+//   while (prime <= number){
+//     if (number % prime === 0) {
+//       max = prime;
+//       number = number/prime;
+//     }
+//     else prime++;
+//   }
+//   return max;
+// }
+//
+// largestPrimeFactor(13195);

index.html

@@ -10,6 +10,6 @@
 
 <div id="content"></div>
 
-<script src="euler_project/even_fibonacci_numbers.js"></script>
+<script src="euler_project/largest_palindrome_product.js"></script>
 </body>
 </html>