Prove

 Posts: 7
 Joined: Wed Jan 26, 2011 9:36 am
 Location: Sylhet
 Contact:
Prove
Prove that (n^5  n) is divided by 5 .

 Posts: 135
 Joined: Thu Dec 09, 2010 12:10 pm
Re: Prove
Re: Prove
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^{p1} \equiv 1 \pmod{p}$.
When $gcd(n,p)=1$, you can divide the equivalence by $n$ and get $n^{p1} \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.
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.