is perfect power (v3)

Revision 3 of this benchmark created on March 3, 2016

Setup

function isPP1(n) {
      for (var m = 2; m * m <= n; ++ m)
        for (var k = 2; Math.pow(m, k) <= n; ++ k)
          if (Math.pow(m, k) == n) return [m, k];
      return null;
    }
    
    function isPP2(n){
       for(var i = 2 ; i <= Math.sqrt(n) | 0 ; ++i)
      {
         if( n % i == 0)
         {
            var k = Math.round( Math.log(n) / Math.log(i) );
            if( Math.pow(i,k) == n) return [i,k];
         }
      }
      
      return null;
    }
    
    var n = Math.floor(Math.random() * 1e8);

Test runner

isPP1(n);

isPP2(n);

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.

• Revision 1: published by computerguy103 on November 5, 2015
• Revision 3: published on March 3, 2016
• Revision 4: published by computerguy103 on March 25, 2016