it is said "if we square ANY prime number bigger then 3, then subtract 1, [/tex]
[/tex]the answer always divides by \(\displaystyle > \ > 24! \ < \ <\)
Let \(\displaystyle p\) be a prime greater than \(\displaystyle 3\). Then \(\displaystyle p\) is not divisible by \(\displaystyle 3\). So there is an integer \(\displaystyle k\) such that \(\displaystyle p=3k+1\) or \(\displaystyle p=3k+2\).
If \(\displaystyle p=3k+1\), then \(\displaystyle p^2-1=(3k+1)^2-1=9k^2+6k+1-1=3(3k^2+2k)\) showing that \(\displaystyle p^2-1\) is divisible by 3.
If \(\displaystyle p=3k+2\) then a similar computation also shows that \(\displaystyle p^2-1\) is divisible by 3.
Now use similar reasoning to show that \(\displaystyle p^2-1\) is divisible by \(\displaystyle 8\).
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.