Wilson's theorem
Necessary and sufficient condition for a number to be prime
Nº Q276082 ★★
Uncommon · Knowledge
Wilson's theorem
Necessary and sufficient condition for a number to be prime
In algebra and number theory, Wilson's theorem states that a natural number n > 1 is a prime number if and only if the product of all the positive integers less than n is one less than a multiple of n. That is (using the notations of modular arithmetic), the factorial ( n − 1 ) ! = 1 × 2 × 3 × ⋯ × ( n − 1 ) {\displaystyle (n-1)!=1\times 2\times 3\times \cdots \times (n-1)} satisfies ( n − 1 ) ! ≡ − 1 ( mod n ) {\displaystyle (n-1)!\ \equiv \;-1{\pmod {n}}} exactly when n is a prime number.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In algebra and number theory, Wilson's theorem states that a natural number n > 1 is a prime number if and only if the product of all the positive integers less than n is one less than a multiple of n. That is (using the notations of modular arithmetic), the factorial ( n − 1 ) ! = 1 × 2 × 3 × ⋯ × ( n − 1 ) {\displaystyle (n-1)!=1\times 2\times 3\times \cdots \times (n-1)} satisfies ( n − 1 ) ! ≡ − 1 ( mod n ) {\displaystyle (n-1)!\ \equiv \;-1{\pmod {n}}} exactly when n is a prime number. In other words, any integer n > 1 is a prime number if, and only if, (n − 1)! + 1 is divisible by n.
Text: Wikipédia, CC BY-SA 4.0. ·
