Proving Perfect Number Equivalency with Mod 10

  • Thread starter Thread starter nomather1471
  • Start date Start date
nomather1471
Messages
19
Reaction score
1
Show that ----> if n is even perfect number than n \equiv6(mod10) or n\equiv8(mod10)
 
Physics news on Phys.org
Do you know the Euclid-Euler form?
 
2^(p-1) *(2^p-1) formula i think you have said, i know this formula but i haven't get the result with this.
 
Last edited:
I can't believe to myself i think i proved :)
http://www.loadtr.com/465992-mmmmm.htm
 
Last edited by a moderator:
nomather1471 said:
I can't believe to myself i think i proved :)
http://www.loadtr.com/465992-mmmmm.htm

yea. it should be it
 
Last edited by a moderator:
it is important point of exponential of 4 is congruence 4 or 6 mod 10, i have missed it i think :)
 

Similar threads

Are two integers coprime if they are coprime mod(n)?
Replies
1
Views
1K
I How to Prove a Congruence Relation for Prime Numbers?
Replies
17
Views
2K
I Proving inequality about dimension of quotient vector spaces
Replies
25
Views
3K
I Fundamental theorem of arithmetic from Jordan-Hölder theorem
Replies
5
Views
2K
MHB Prove $10^{\dfrac{5^n -1}{4}} \Huge\vert (5^n)!$ for $Z^+$
Replies
6
Views
1K
I Prove Even # Transpositions in Identity Permutation w/ Induction & Contradiction
Replies
8
Views
4K
90 - The Only Deficiently Perfect Imperfect Number ?
Replies
1
Views
3K
I Fourier Transformation on a Ring
Replies
11
Views
3K
Predict Digits of Irrational Numbers with Modular Arithmetic Summation?
Replies
2
Views
2K
MHB Prove R is a Sub-ring of $\mathbb{Q}$ - Prime $p \in \mathbb{Z}$
Replies
11
Views
2K

Hot Threads

Recent Insights

Back
Top