Exponentiation of mods

  • #1
Could somebody at least tell me about mods in exponents?
 
Last edited:

Answers and Replies

  • #2
Mentallic
Homework Helper
3,798
94
Let 3^n denote 333... (n+1 threes in total)
Tetration already has a formalized expression.

[tex]^n3=3^{3^{...^3}}[/tex] 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

[tex]^n3 = 3\uparrow\uparrow n[/tex]

So what's your question?
 
  • #3
Tetration already has a formalized expression.

[tex]^n3=3^{3^{...^3}}[/tex] 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

[tex]^n3 = 3\uparrow\uparrow n[/tex]

So what's your question?
Thanks for the quick reply, but I wasn't finished typing. I accidentally hit enter. Sorry.
 
  • #4
Mentallic
Homework Helper
3,798
94
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 [itex]^n3 \mod 10 = 7, n>1[/itex] 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 [itex]3^3 = 27[/itex] hence [itex]27 \mod 10 = 7[/itex] and we can then show by calculation that [itex]3^7 \mod 10 = 7[/itex] hence it must be true for all n.
 

Related Threads on Exponentiation of mods

  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
1
Views
4K
Replies
3
Views
2K
  • Last Post
Replies
6
Views
3K
Replies
3
Views
633
  • Last Post
Replies
7
Views
8K
  • Last Post
Replies
4
Views
541
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
4
Views
5K
  • Last Post
Replies
8
Views
3K
Top