Prove

Discussion on Bangladesh Mathematical Olympiad (BdMO) National
Sudip Deb new
Posts: 7
Joined: Wed Jan 26, 2011 9:36 am
Location: Sylhet
Contact:

Prove

Unread post by Sudip Deb new » Sun Jan 30, 2011 10:04 am

Prove that (n^5 - n) is divided by 5 .

HandaramTheGreat
Posts: 135
Joined: Thu Dec 09, 2010 12:10 pm

Re: Prove

Unread post by HandaramTheGreat » Sun Jan 30, 2011 10:18 am

$n^5-n=n(n^4-1)=n(n^2+1)(n^2-1)$
last digit of a square can be only 1, 4, 9, 6, 5 or 0...
if it's 1, 4, 9, or 6, then $(n^2+1)$ or $(n^2-1)$ is obviously divisible by 5...
if it's 5 or 0, then $n$ should be divisible by $5$... :D
if you put 2 dollar sign in both side of (n^5-n), it would be like this $(n^5-n)$... ;)

User avatar
Moon
Site Admin
Posts: 751
Joined: Tue Nov 02, 2010 7:52 pm
Location: Dhaka, Bangladesh
Contact:

Re: Prove

Unread post by Moon » Sun Jan 30, 2011 7:47 pm

Also you can always use Fermat's Little Theorem, which states that for all $n\in\mathbb{N}$ and any prime $p$ \[ n^p \equiv n \pmod{p} \]
When $gcd(n,p)=1$, you can divide the equivalence by $n$ and get $n^{p-1} \equiv 1 \pmod{p}$.
"Inspiration is needed in geometry, just as much as in poetry." -- Aleksandr Pushkin

Please install LaTeX fonts in your PC for better looking equations,
learn how to write equations, and don't forget to read Forum Guide and Rules.

Post Reply