is perfect power (v4)

Revision 4 of this benchmark created by computerguy103 on March 25, 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){
      var maxB = Math.floor(Math.log2(n)+1);
      var maxA = Math.floor(Math.sqrt(n));
      for(var b = 2; b <= maxB; b++) {
          for(var a = 1; a <= maxA; a++) {
            if (Math.pow(a, b) === n) {
              return [a, b];
            }
          }
      }
      return null;
    }
    
    function isPP3(n){
      for (var m = 1; ++m*m <= n;)
        for (var k = 2;;k++) {
          var pow = Math.pow(m,k)
          if (pow == n) return [m,k]
          else if (pow > n) break
        }
      
      return null
    }
    
    var n = Math.floor(Math.random() * 1e8);

Test runner

isPP1(n);

isPP2(n);

isPP3(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