Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
3
Newest
 Editor
Impact
~361 people reached

  • 0 posts edited
  • 1 helpful flag
  • 6 votes cast
Jun
24
asked Selecting a proper p-value (Chi-squared)
Apr
22
awarded  Editor
Apr
22
revised Differences between GAP and PARI/GP?
added 337 characters in body
Dec
21
awarded  Student
Dec
18
comment hyperpower modular
I think I've found a way to solve some of these problems. I didn't find it myself but I found it on the Internet. Using $a^i \equiv a^j \pmod {m} \Leftrightarrow{} i \equiv j \pmod{e}$. Where e is the multiplicative order, $e=ord_m (a)$, that's the smallest k that makes $a^k \equiv 1 \pmod{m}$, And it can be used only if $gcd(a,m)=1$
Dec
17
asked Differences between GAP and PARI/GP?
Dec
17
comment hyperpower modular
Or something maybe easier, $a \uparrow \uparrow b \mod c $ such as $7^{7^{7^{7^{7^{7^{7}}}}}} \mod 17$
Dec
17
comment hyperpower modular
For example how much is ...? $8^{7^{6^{5^{4^{3^{2}}}}}} \mod 17$
Dec
17
awarded  Supporter
Dec
17
comment hyperpower modular
Oh, thanks, I didn't notice that I wrote (mod p). How would you solve it if it were (mod N), with N being any integer positive number?
Dec
16
asked hyperpower modular