SHARE
TWEET

Euler 3

a guest Aug 21st, 2013 72 Never
  1. /*The prime factors of 13195 are 5, 7, 13 and 29.
  2.  
  3. What is the largest prime factor of the number 600851475143 ?
  4.  
  5. 1. Find Square Root of 600851475143. (Roughly 548111)
  6. 2. Create Incremental counter to 548111. (This is called i)
  7. 3. Divide all 548111 by all numbers up to 548111.
  8. 4. Weed out Non-Prime Factors.
  9. 5. Prime Factors should remain. Locate the biggest one.
  10.  
  11. */
  12.  
  13. #include <stdio.h>
  14.  
  15. int i=1;
  16. int try=1;
  17.  
  18. int main(){
  19.         for(i=1; i<548111; i++){
  20.                        
  21.         }
  22. }
RAW Paste Data
Top