Subscribe via feed.

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.


This post is under “MathsChallenge” and has 3 respond so far.
If you enjoy this article, make sure you subscribe to my RSS Feed.

3 Responds so far- Add one»

  1. 1. slavy Said:

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

  2. 2. lil drizzy Said:

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

  3. 3. Karl Sharman Said:

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

Post a reply




PHP Warning: PHP Startup: Unable to load dynamic library 'C:\Program Files (x86)\Parallels\Plesk\Additional\PleskPHP5\ext\php_mssql.dll' - The specified module could not be found. in Unknown on line 0 PHP Warning: PHP Startup: Unable to load dynamic library 'C:\Program Files (x86)\Parallels\Plesk\Additional\PleskPHP5\ext\php_pdo_mssql.dll' - The specified module could not be found. in Unknown on line 0