This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var grid = [ 08,02,22,97,38,15,00,40,00,75,04,05,07,78,52,12,50,77,91,08,49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,00,81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,03,49,13,36,65,52,70,95,23,04,60,11,42,69,24,68,56,01,32,56,71,37,02,36,91,22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80,24,47,32,60,99,03,45,02,44,75,33,53,78,36,84,20,35,17,12,50,32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70,67,26,20,68,02,62,12,20,95,63,94,39,63,08,40,91,66,49,94,21,24,55,58,05,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72,21,36,23,09,75,00,76,44,20,45,35,14,00,61,33,97,34,31,33,95,78,17,53,28,22,75,31,67,15,94,03,80,04,62,16,14,09,53,56,92,16,39,05,42,96,35,31,47,55,58,88,24,00,17,54,24,36,29,85,57,86,56,00,48,35,71,89,07,05,44,44,37,44,60,21,58,51,54,17,58,19,80,81,68,05,94,47,69,28,73,92,13,86,52,17,77,04,89,55,40,04,52,08,83,97,35,99,16,07,97,57,32,16,26,26,79,33,27,98,66,88,36,68,87,57,62,20,72,03,46,33,67,46,55,12,32,63,93,53,69,04,42,16,73,38,25,39,11,24,94,72,18,08,46,29,32,40, |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var primeFlag = false, | |
| result = 5; | |
| for ( var i = 0; i <= 2000000; i++ ) { | |
| primeFlag = false; | |
| for ( var j = 2; j <= Math.sqrt( i ); j++ ) { | |
| if ( i % j === 0 ) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| for ( var a = 1; a < 333; a++ ) { | |
| var c = 999; | |
| for ( var b = a; b < 666 && b < c; b++ ) { | |
| c = 1000 - a - b; | |
| if ( ( a * a ) + ( b * b ) === ( c * c ) ) { | |
| document.write( a * b * c ); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var series = '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450', | |
| ser |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var resultCounter = 2, | |
| primeFlag = false, | |
| result = 0; | |
| prime = 1; | |
| for ( var i = 0; resultCounter < 10001; i++ ) { | |
| primeFlag = false; | |
| for ( var j = 2; j <= Math.sqrt( i ); j++ ) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var sums = 0, | |
| smallest = 1, | |
| largest = 100, | |
| sumOfSquares = 0, | |
| squareOfSums = 0; | |
| for ( i = smallest; i <= largest; i++ ) { | |
| sumOfSquares += i * i; | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var test = 20, | |
| largest = 1, | |
| divisibleFlag; | |
| for ( var t = 20; t > 0; t-- ) { | |
| largest = largest * t; | |
| } | |
| for ( var i = 20; i <= largest; i += 20 ) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| for ( $i = 998001; $i >= 10000; $i-- ) { | |
| // Cast as string and calculate length; | |
| $test = (string) $i; | |
| $length = strlen( $test ); | |
| // Check if we have a the first part of a palindromical number | |
| if ( ! ( $test[0] === $test[ $length - 1 ] && $test[1] === $test[ $length - 2 ] ) ) | |
| continue; | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| $factors = array(); | |
| $t = 600851475143; | |
| for ( $d = 3; $d < 8462696833; $d++ ) { | |
| $calc = $t / $d; | |
| if ( in_array( $calc, $factors ) ) { | |
| break; | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var result = 0, | |
| holding = 0; | |
| previous = 1, | |
| fibonacci = 1; | |
| while ( fibonacci <= 4000000 ) { | |
| holding = fibonacci; | |
| fibonacci += previous; |