## Maths challenge 11

Posted by Chris on August 1, 2011 – 4:43 pm

Here’s another: I believe that 2^(2*3^(n-1)) = 1 (mod 3^n), n > 0 where the power 2*3^(n-1) is the smallest possible and is the same as the Euler totient. Prove or disprove it. A single counterexample will suffice for the false proof.

August 5th, 2011 at 1:53 am

Here the same induction argument works, so I leave the details to the rest for exercise

August 5th, 2011 at 6:21 pm

i dnt get this :0 cause im in the 5 grade

August 6th, 2011 at 10:28 am

Me neither lil drizzy, I’m a rocket scientist…