Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Notkun: p = biggestPrimeFactor(n);
- // Fyrir: n >= 2.
- // Eftir: p er stærsta heiltala sem gengur upp í n.
- public static long biggestPrimeFactor( long n )
- {
- int i;
- for(i=2; i<=n; i++){
- if( n % i == 0){
- n = n / i;
- i--;
- }
- }
- return i;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement