- #1
kioria
- 54
- 0
Hi,
Can somebody drill me on the "congruences and modular arithmetic"? I know it is a big topic, but I think I am missing "something" in my knowledge... These things seem very unusual to me, and makes no sense sometimes.
Find smallest integer n, where:
[tex]3^n \equiv 1 (mod 7)[/tex]
Is there a systematic way of doing a such thing?
Can somebody drill me on the "congruences and modular arithmetic"? I know it is a big topic, but I think I am missing "something" in my knowledge... These things seem very unusual to me, and makes no sense sometimes.
Find smallest integer n, where:
[tex]3^n \equiv 1 (mod 7)[/tex]
Is there a systematic way of doing a such thing?