Proving Perfect Number Equivalency with Mod 10

  • Context: Graduate 
  • Thread starter Thread starter nomather1471
  • Start date Start date
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
Sign up Log in
5 replies · 3K views
nomather1471
Messages
19
Reaction score
1
Show that ----> if n is even perfect number than n [tex]\equiv[/tex]6(mod10) or n[tex]\equiv[/tex]8(mod10)
 

Discussion

Physics news on Phys.org
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

Proving Perfect Number Proof: 2p-1(2p-1)

  • srfriggen
  • · Replies 4 ·
  • Calculus and Beyond Homework Help
Replies
4

Proving Perfect Squares: A Study in Number Theory

  • dancergirlie
  • · Replies 2 ·
  • Calculus and Beyond Homework Help
Replies
2