#Number Theory
27 messages · Page 1 of 1 (latest)
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close
- Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
I know that I have to use congruency and that 119 is not prime because it is 17*7
I think I need to use Fermat's little problem but Idk how to apply it when the number divided by isn't prime, do I need to make the congruency for 17 and 7? Also I don't see how to make the exponents be the p-1 to apply the Fermat's theorem
@rough rain Your question most likely won't be answered properly. I suggest you to find the math olympiad server. They are great at number theory.
are you fr?
I mean I'm in my 1st year of university so the problem shouldn't be very hard
sure send me please
thanks
$\gcd(5,119)=1$, so $5^{\varphi(119)}\equiv 1\mod 119$
Omegabet_
$\varphi(119)=\varphi(7\times 17)=119(1-\frac{1}{7})(1-\frac{1}{17})$
Omegabet_
rest is then just reducing 960101 by phi(119)
FlT generalizes to reduction mod n in the following manner: If $\gcd(a,n)=1$, then $a^{\varphi(n)}\equiv 1\mod n$
Omegabet_
understood thanks, I had forgotten that I could also use Euler's
@rough rain has given 1 rep to @sand cove
might have to do it a couple times, but should eventually spit out the answer
euler of 119 is 96 so I'll be able to apply it on 5^960101. I'll try to solve it
yep, so you want to reduce 960101 mod 96
I got the right answer: 118. Thanks again Omega