Kā aprēķināt Prime Number Checker
Kas ir Prime Number Checker?
A prime number is a natural number greater than 1 that has no divisors other than 1 and itself. Primes are the fundamental building blocks of all integers — every integer > 1 is either prime or can be uniquely factored into primes (Fundamental Theorem of Arithmetic).
Soli pa solim ceļvedis
- 1Trial division: test if n is divisible by any integer from 2 to √n
- 2If no divisor found, n is prime
- 3Sieve of Eratosthenes: efficiently finds all primes up to a limit
- 4For large numbers, probabilistic tests like Miller-Rabin are used
Worked Examples
Ievade
97
Rezultāts
Prime
Not divisible by 2,3,5,7 (√97≈9.8)
Ievade
91
Rezultāts
Not prime — 91 = 7 × 13
Common misconception: looks prime but isn't
Vai esat gatavs aprēķināt? Izmēģiniet bezmaksas Prime Number Checker kalkulatoru
Izmēģiniet to pats →