\[\text{ Let } n \text{ be a positive integer with } n \ge 3. \text{ Show } 1989|(n^{n^{n^{n}}}-n^{n^{n}}) .\]
does \[1989|(n^{n^{n^{n^n}}}-n^{n^{n^n}}) .\] too?
If this helps anyone this comes from http://www.math.muni.cz/~bulik/vyuka/pen-20070711.pdf . A10.
lol I don't know about that I don't know how to do this one honestly
me neither
@dan815 @rational @kainui @ganeshie8 you guys have any thoughts totally blank right now
wow I'm actually disappointed http://www.wolframalpha.com/input/?i=%285%5E%285%5E%285%5E5%29%29-5%5E%285%5E5%29%29%2F%281989%29+is+integer
disappointed because I thought we were going to get to prove something
Are you sure it's not just such a huge number that it broke wolfram alpha? http://www.wolframalpha.com/input/?i=%285%5E%285%5E%285%5E5%29%29-5%5E%285%5E5%29%29
i think there are different interpretations of \(n^{n^n}\)
oh i guess it is possible to break wolfram :p
@satellite73 I don't think so, since the alternative is \(n^{n^n}= n^{2n}\) which seems kinda like a waste.
http://www.wolframalpha.com/input/?i=5%5E5%5E5%5E5+mod+1989 http://www.wolframalpha.com/input/?i=5%5E5%5E5+mod+1989
n^n^n w/o parenthesis is a tetration i think
5^5^5 = 5^(5^5)
@satellite73 here are some useful exponentiation rules you should memorize \[(a^n)^m=a^{nm}\\ a^{n}*a^{m} = a^{n+m}\]
Pretty sure @satellite73 already memorized these rules lol.
how about starting here n^n^n...n-n^n^n...n = 0 mod k k times and k-1 times
ohh hhow about!
|dw:1432002143068:dw|
Join our real-time social learning platform and learn together with your friends!