2
$\begingroup$

I have an expression like this:

$$\left(\large 6000^{5999^{5998^{5997^{{\ldots^{1}}}}}}\right)\bmod 2013$$

Then which method should I use to solve it? Please provide the method not the answer.


Editor's Note: Note that this is a power tower with different values and not the same value as with general tetration. Also, don't confuse tetration with exponentiation. Both are completely different.

$\endgroup$
6
  • $\begingroup$ In which order should the exponentiations be taken? My guess is 6000^(5999^(5998^5997 etc ))) but (((6000^5999)^5998)^5997 etc) seems somewhat plausible as well. $\endgroup$
    – Rolf Hoyer
    Commented Apr 4, 2015 at 7:40
  • $\begingroup$ Is there a minus sign before 6000? $\endgroup$
    – user228113
    Commented Apr 4, 2015 at 7:40
  • 1
    $\begingroup$ @PrasunBiswas No, $(2013,6000)=3\neq 1$, so you can't just directly use Euler's theorem. $\endgroup$
    – user26486
    Commented Apr 4, 2015 at 13:36
  • $\begingroup$ @user31415, Yes, I noticed that now. I'm removing my comment. :) $\endgroup$ Commented Apr 4, 2015 at 13:42
  • $\begingroup$ @PrasunBiswas hey! $\endgroup$
    – Confuse
    Commented Jul 18, 2015 at 6:52

1 Answer 1

6
$\begingroup$

Hint: Work out the answer modulo $3$, $11$ and $61$ (the prime factors of $2013$) separately. Use Euler's theorem to climb the exponent ladder. In the end combine the answers by using the Chinese remainder theorem.

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .