bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Wilson's theorem

This commit is contained in:
Antti H S Laaksonen 2017-02-09 00:18:42 +02:00
parent 048deaf922
commit 85b27bdee7
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
luku21.tex
View File

@ -697,8 +697,8 @@ For example, the number 11 is prime, because
and the number 12 is not prime, because and the number 12 is not prime, because
\[11! \bmod 12 = 0 \neq 11.\] \[11! \bmod 12 = 0 \neq 11.\]
Hence, Wilson's theorem tells us whether a number Hence, Wilson's theorem can be used to find out
is prime. However, in practice, the theorem cannot be whether a number is prime. However, in practice, the theorem cannot be
applied to large values of $n$, because it is difficult applied to large values of $n$, because it is difficult
to calculate the value of $(n-1)!$ when $n$ is large. to calculate the value of $(n-1)!$ when $n$ is large.