Prove that 76 raised to any integer power and then divided by 100 (ignoring the remainder) is always divisible by 57 – math.stackexchange.com

Prove that 76 raised to any integer power and then divided by 100 (ignoring the remainder) is always divisible by 57 – math.stackexchange.com

10:36 No Comments
Related (but different) question: Is it true that $76^n=76\pmod{100}$ for all $n>0$? If you raise 76 to an integer power (n>=2) and ignore the last two digits, it appears that you always have an ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "Prove that 76 raised to any integer power and then divided by 100 (ignoring the remainder) is always divisible by 57 – math.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)