Guest User

Problem

a guest
Jun 14th, 2026
42
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.72 KB | Source Code | 0 0
  1. big_num=600851475143
  2.  
  3. limit=int(big_num**0.5) + 1
  4.  
  5. def sieve(limit):
  6.     if limit < 2:
  7.         return []
  8.        
  9.     is_prime = [True] * (limit + 1)
  10.     is_prime[0] = is_prime[1] = False
  11.    
  12.     for p in range(2, int(limit**0.5) + 1):
  13.         if is_prime[p]:
  14.             for multiple in range(p * p, limit + 1, p):
  15.                 is_prime[multiple] = False
  16.                
  17.     prime=[i for i in range(limit+1) if is_prime[i]]
  18.     return prime
  19.    
  20. my_primes=sieve(limit)
  21. print("the prime numbers are :", my_primes)  
  22.  
  23. print(f"there are {len(my_primes)} prime numbers up to {limit} .")    
  24.  
  25.  
  26. for p in reversed(my_primes) :
  27.     if big_num%p == 0 :
  28.         print(f"largets prime factor is : {p}")
  29.         break
Advertisement
Add Comment
Please, Sign In to add comment