Created
November 10, 2011 22:47
-
-
Save jakedobkin/1356516 to your computer and use it in GitHub Desktop.
Euler Problem 3
This file contains 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
| <html> | |
| <body> | |
| <script type="text/javascript"> | |
| c = 600851475143; | |
| for (i=3;i<=775146;i++) | |
| { | |
| if (c%i == 0){ | |
| document.write(i + " is a possible prime factor"+ "<br/>"); | |
| for (j=3;j<=i;j++) | |
| { | |
| if(i%j == 0 && j<i) | |
| { | |
| document.write("... but " + i + " is not prime<br/>"); | |
| break; | |
| } | |
| } | |
| } | |
| } | |
| </script> | |
| </body> | |
| </html> |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment