Exponents & Mods: What You Need to Know

[Sam Anderson]

Could somebody at least tell me about mods in exponents?

 

[Mentallic]

Let 3^{^n} denote 3^{33... (n+1 threes in total)}

Tetration already has a formalized expression.

^n3=3^{3^{...^3}} with n 3's in the stack.

Or you can even use Knuth's up arrow notation. Exponentiation is denoted by 1 up arrow, and tetration by 2, so

^n3 = 3\uparrow\uparrow n

So what's your question?

 

[Sam Anderson]

Tetration already has a formalized expression.

^n3=3^{3^{...^3}} with n 3's in the stack.

Or you can even use Knuth's up arrow notation. Exponentiation is denoted by 1 up arrow, and tetration by 2, so

^n3 = 3\uparrow\uparrow n

So what's your question?

Thanks for the quick reply, but I wasn't finished typing. I accidentally hit enter. Sorry.

 

[Mentallic]

Could somebody at least tell me about mods in exponents?

I could only guess what you're asking for, but if I were to guess, say you want to prove that ^n3 \mod 10 = 7, n>1 we would do an inductive proof. I'll make it short and you can fill in the details, but essentially you start with the base case 3^3 = 27 hence 27 \mod 10 = 7 and we can then show by calculation that 3^7 \mod 10 = 7 hence it must be true for all n.