numb 0.3.0

data/spec/emrip_spec.rb

@@ -0,0 +1,26 @@
+describe Integer, "emrip?" do
+  # http://www.research.att.com/~njas/sequences/A006567
+  EMRIP = [13,17,31,37,71,73,79,97,107,113,149,157,167,179,
+           199,311,337,347,359,389,701,709,733,739,743,751,
+           761,769,907,937,941,953,967,971,983,991,1009,1021,
+           1031,1033,1061,1069,1091,1097,1103,1109,1151,1153,
+           1181,1193]
+
+  it "returns true for primes that give a different prime when reversed" do
+    EMRIP.each do |number|
+      number.should be_emrip
+    end
+  end
+
+  it "returns false for non-emrips" do
+    ((1..1193).to_a  - EMRIP).each do |number|
+      number.should_not be_emrip
+    end
+  end
+
+  it "returns false for palindromic primes" do
+    [11,151].each do |number|
+      number.should_not be_emrip
+    end
+  end
+end

data/spec/equidigital_spec.rb

@@ -0,0 +1,27 @@
+describe Integer, "#equidigital?" do
+  # http://www.research.att.com/~njas/sequences/A046758
+  EQUIDIGITAL = [1,2,3,5,7,10,11,13,14,15,16,17,19,21,23,25,27,29,
+                 31,32,35,37,41,43,47,49,53,59,61,64,67,71,73,79,
+                 81,83,89,97,101,103,105,106,107,109,111,112,113,
+                 115,118,119,121,122,123,127,129,131,133,134,135,
+                 137,139]
+
+  it "returns true for equidigital numbers" do
+    EQUIDIGITAL.each do |number|
+      number.should be_equidigital
+    end
+  end
+
+  it "returns true for prime numbers" do
+    [193, 197, 199].each do |number|
+      number.should be_equidigital
+    end
+  end
+
+  it "returns false for non-equidigital numbers" do
+    ((1..139).to_a - EQUIDIGITAL).each do |number|
+      number.should_not be_equidigital
+    end
+  end
+end
+

data/spec/extravagant_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#extravagant?" do
+  # http://www.research.att.com/~njas/sequences/A046760
+  EXTRAVAGANT = [4,6,8,9,12,18,20,22,24,26,28,30,33,34,36,38,39,
+                 40,42,44,45,46,48,50,51,52,54,55,56,57,58,60,62,
+                 63,65,66,68,69,70,72,74,75,76,77,78,80,82,84,85,
+                 86,87,88,90,91,92,93,94,95,96,98,99,100,102,104,
+                 108,110,114]
+  
+  it "returns true for extravagant numbers" do
+    EXTRAVAGANT.each do |number|
+      number.should be_extravagant
+    end
+  end
+
+  it "returns false for non-extravagant numbers" do
+    ((1..114).to_a - EXTRAVAGANT).each do |number|
+      number.should_not be_extravagant
+    end
+  end
+end

data/spec/factor_spec.rb

@@ -0,0 +1,22 @@
+describe Integer, "#factor?" do
+  it "returns true if self divided by other leaves no remainder" do
+    100.factor?(10).should be_true
+    9.factor?(3).should be_true    
+  end
+
+  it "returns false if other is bigger than self" do
+    50.factor?(500).should be_false
+  end
+
+  it "returns false if self divided by other leaves a remainder" do
+    10.factor?(3).should be_false
+  end
+
+  it "returns false if other is 0" do
+    44.factor?(0).should be_false
+  end
+
+  it "works with negative numbers" do
+    20.factor?(-5).should be_true
+  end
+end

data/spec/factorion_spec.rb

@@ -0,0 +1,13 @@
+describe Integer, "#factorion?" do
+  it "returns true for factorions" do
+    [1, 2, 145, 40585].each do |number|
+      number.should be_factorion
+    end
+  end
+
+  it "returns false for non-factorions" do
+    [3, 146, 4828291001].each do |number|
+      number.should_not be_factorion
+    end
+  end
+end

data/spec/frugal_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#frugal?" do
+  # http://www.research.att.com/~njas/sequences/A046759
+  FRUGAL = [125,128,243,256,343,512,625,729,1024,1029,1215,
+            1250,1280,1331,1369,1458,1536,1681,1701,1715,1792,
+            1849,1875,2048,2187,2197,2209,2401,2560,2809,3125,
+            3481,3584,3645,3721,4096,4374,4375,4489,4802,
+            4913]
+  
+  it "returns true for frugal numbers" do
+    FRUGAL.each do |number|
+      number.should be_frugal
+    end
+  end
+
+  it "returns false for non-frugal numbers" do
+    ((126..4912).to_a - FRUGAL).each do |number|
+      number.should_not be_frugal
+    end
+  end
+end

data/spec/happy_spec.rb

@@ -0,0 +1,24 @@
+describe Integer, "#happy?" do
+  HAPPY = [1,7,10,13,19,23,28,31,32,44,49,68,70,79,82,86,91,
+           94,97,100,103,109,129,130,133,139,167,176,188,190,
+           192,193,203,208,219,226,230,236,239,262,263,280,
+           291,293,301,302,310,313,319,320,326,329,331,338]
+  it "returns true for happy numbers" do
+    HAPPY.each do |number|
+      number.should be_happy
+    end
+  end
+
+  it "returns false for unhappy numbers" do
+    ((1..338).to_a - HAPPY).each do |number|
+      number.should_not be_happy
+    end
+  end
+
+  it "returns false for negative numbers" do
+    (1..338).each do |number|
+      (-number).should_not be_happy
+    end
+  end
+end
+

data/spec/harshad_spec.rb

@@ -0,0 +1,25 @@
+describe Integer, "#harshad?" do
+  # http://www.research.att.com/~njas/sequences/A005349
+  HARSHAD = [1,2,3,4,5,6,7,8,9,10,12,18,20,21,24,27,30,36,40,
+             42,45,48,50,54,60,63,70,72,80,81,84,90,100,102,
+             108,110,111,112,114,117,120,126,132,133,135,140,
+             144,150,152,153,156,162,171,180,190,192,195,198,
+             200,201,204]
+  it "returns true for Harshad (Niven) numbers" do
+    HARSHAD.each do |number|
+      number.should be_harshad
+    end
+  end
+
+  it "returns false for non-Harshad/Niven numbers" do
+    ((1..204).to_a - HARSHAD).each do |number|
+      number.should_not be_harshad
+    end
+  end
+
+  it "returns false for negative numbers" do
+    (1..204).each do |number|
+      (-number).should_not be_harshad
+    end
+  end
+end

data/spec/hilbert_spec.rb

@@ -0,0 +1,24 @@
+describe Integer, "#hilbert?" do
+  HILBERT = [1,5,9,13,17,21,25,29,33,37,41,45,49,53,57,61,65,
+             69,73,77,81,85,89,93,97,101,105,109,113,117,121,
+             125,129,133,137,141,145,149,153,157,161,165,169,
+             173,177,181,185,189]
+  it "returns true for a Hilbert number" do
+    HILBERT.each do |number|
+      number.should be_hilbert
+    end
+  end
+
+  it "returns false for a non-Hilbert number" do
+    ((1..188).to_a - HILBERT).each do |number|
+      number.should_not be_hilbert
+    end
+  end
+
+  it "returns false for a negative number" do
+    (1..189).each do |number|
+      (-number).should_not be_hilbert
+    end
+  end
+end
+

data/spec/hyperperfect_spec.rb

@@ -0,0 +1,59 @@
+describe Integer, "#hyperperfect?" do
+  # http://www.research.att.com/~njas/sequences/A000396
+  PERFECT = [6,28,496,8128,33550336,8589869056,137438691328,
+             2305843008139952128,
+             2658455991569831744654692615953842176,
+             191561942608236107294793378084303638130997321548169216]
+
+
+  it "returns true for a 1-hyperperfect (perfect) number" do
+    PERFECT.first(5).each do |number|
+      number.should be_hyperperfect
+    end
+  end
+
+  it "returns false for a non-1-hyperperfect (non-perfect) number" do
+    ((1..2000).to_a - PERFECT).sample(5).each do |number|
+      number.should_not be_hyperperfect
+    end
+  end
+
+  it "returns true for 6-hyperperfect numbers with an argument of 6" do
+    # http://www.research.att.com/~njas/sequences/A028499
+    [301,16513,60110701,1977225901].each do |number|
+      number.hyperperfect?(6).should be_true
+    end
+  end
+
+  it "returns false for non-6-hyperperfect numbers with an argument of 6" do
+    [302,6].each do |number|
+      number.hyperperfect?(6).should be_false
+    end
+  end
+
+  it "returns true for 18-hyperperfect numbers with an argument of 18" do
+    # http://www.research.att.com/~njas/sequences/A028501
+    [1333,1909,2469601,893748277].each do |number|
+      number.hyperperfect?(18).should be_true
+    end
+  end
+
+  it "returns false for non-18-hyperperfect numbers with an argument of 18" do
+    [6,1334].each do |number|
+      number.hyperperfect?(18).should be_false
+    end
+  end
+
+  it "returns true for 2772-hyperperfect numbers with an argument of 2772" do
+    # http://www.research.att.com/~njas/sequences/A028502
+    [95295817,124035913,749931337,4275383113].each do |number|
+      number.hyperperfect?(2772).should be_true
+    end
+  end
+
+  it "returns false for non-2722-hyperperfect numbers with an argument of 2722" do
+    [6,95295816].each do |number|
+      number.hyperperfect?(2772).should be_false
+    end
+  end
+end

data/spec/kaprekar_spec.rb

@@ -0,0 +1,25 @@
+describe Integer, "#kaprekar?" do
+  KAPREKAR = [1,9,45,55,99,297,703,999,2223,2728,4879,4950,
+              5050,5292,7272,7777,9999,17344,22222,38962,77778,
+              82656,95121,99999,142857,148149,181819,187110,
+              208495,318682,329967,351352,356643,390313,461539,
+              466830,499500,500500,533170]
+
+  it "returns true for Kaprekar numbers" do
+    KAPREKAR.each do |number|
+      number.should be_kaprekar
+    end
+  end
+
+  it "returns false for non-Kaprekar numbers" do
+    ((1..300).to_a - KAPREKAR).each do |number|
+      number.should_not be_kaprekar
+    end
+  end
+
+  it "returns false for negative numbers" do
+    [-5, -9, -297, -345].each do |number|
+      number.should_not be_kaprekar
+    end
+  end
+end

data/spec/keith_spec.rb

@@ -0,0 +1,21 @@
+describe Integer, "#keith?" do
+  # http://www.research.att.com/~njas/sequences/A007629
+  KEITH = [14,19,28,47,61,75,197,742,1104,1537,2208,2580,
+           3684,4788,7385,7647,7909,31331,34285,34348,55604,
+           62662,86935,93993,120284,129106,147640,156146,
+           174680,183186,298320,355419,694280,925993,1084051,
+           7913837,11436171,33445755,44121607]
+
+  it "returns true for Keith numbers" do
+    KEITH.each do |number|
+      number.should be_keith
+    end
+  end
+
+  it "returns false for non-Keith numbers" do
+    ((1..200).to_a - KEITH).each do |number|
+      number.should_not be_keith
+    end
+  end
+end
+

data/spec/kynea_spec.rb

@@ -0,0 +1,19 @@
+describe Integer, "#kynea?" do
+  # http://www.research.att.com/~njas/sequences/A093069
+  KYNEA = [7,23,79,287,1087,4223,16639,66047,263167,1050623,
+           4198399,16785407,67125247,268468223,1073807359,
+           4295098367,17180131327,68720001023,274878955519,
+           1099513724927,4398050705407,17592194433023]
+
+  it "returns true for Kynea numbers" do
+    KYNEA.each do |number|
+      number.should be_kynea
+    end
+  end
+
+  it "returns false for non-Kynea numbers" do
+    ((1..300).to_a - KYNEA).each do |number|
+      number.should_not be_kynea
+    end
+  end
+end

data/spec/maris_mcgwire_sosa_pair_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#maris_mcgwire_sosa_pair?" do
+
+  MMS = [7,14,43,50,61,63,67,80,84,118,122,134,137,163,
+         196,212,213,224,241,273,274,277,279,283,351,352,
+         373,375,390,398,421,457,462,474,475,489,495,510,
+         516,523,526,537,547,555,558,577,584,590,592,616,
+         638,644,660,673,687,691]
+
+  it "returns true for Maris-McGwire-Sosa pairs" do
+    MMS.each do |number|
+      number.maris_mcgwire_sosa_pair?(number+1).should be_true
+    end
+  end
+
+  it "returns false for non-Maris-McGwire-Sosa pairs" do
+    ((1..200).to_a - MMS).each do |number|
+      number.maris_mcgwire_sosa_pair?(number+1).should be_false
+    end
+  end
+end

data/spec/mobius_spec.rb

@@ -0,0 +1,52 @@
+# coding: utf-8
+describe Integer, "#mobius" do
+  # http://www.research.att.com/~njas/sequences/A008683
+  MOBIUS = [1,-1,-1,0,-1,1,-1,0,0,1,-1,0,-1,1,1,0,-1,0,-1,0,
+            1,1,-1,0,0,1,0,0,-1,-1,-1,0,1,1,1,0,-1,1,1,0,-1,
+            -1,-1,0,0,1,-1,0,0,0,1,0,-1,0,1,0,1,1,-1,0,-1,1,0,
+            0,1,-1,-1,0,1,-1,-1,0,-1,1,0,0,1]
+
+  it "returns 1 if n is a square-free positive integer with an even number of distinct prime factors" do
+    MOBIUS.each_with_index do |value, idx|
+      next unless value == 1
+      (idx + 1).mobius.should == 1
+    end
+  end
+
+  it "returns −1 if n is a square-free positive integer with an odd number of distinct prime factors" do
+    MOBIUS.each_with_index do |value, idx|
+      next unless value == -1
+      (idx + 1).mobius.should == -1
+    end
+  end
+
+  it "returns −1 if n is prime" do
+    Prime.each(200).each do |prime|
+      next if MOBIUS.size < prime
+      prime.mobius.should == -1
+    end
+  end
+
+  it "returns 0 iff n is not square-free." do
+    MOBIUS.each_with_index do |value, idx|
+      next unless value == 0
+      (idx + 1).mobius.should == 0
+    end
+
+    # http://www.research.att.com/~njas/sequences/A013929
+    [4,8,9,12,16,18,20,24,25,27,28,32,36,40,44,45,48,
+     49,50,52,54,56,60,63,64,68,72,75,76,80,81,84,88,
+     90,92,96,98,99,100,104,108,112,116,117,120,121,
+     124,125,126,128,132,135,136,140,144,147,148,150,
+     152,153,156,160].each do |number|
+      next if MOBIUS.size < number
+      number.mobius.should == 0
+     end
+  end
+
+  it "returns nil if n is not a positive integer" do
+    (0..25).each do |number|
+      (-number).mobius.should be_nil
+    end
+  end
+end

data/spec/narcissistic_spec.rb

@@ -0,0 +1,18 @@
+describe Integer, "#narcissistic?" do
+  NARCISSISTIC = [1,2,3,4,5,6,7,8,9,153,370,371,407,1634,8208,9474,
+                  54748,92727,93084,548834,1741725,4210818,9800817,
+                  9926315,24678050,24678051,88593477,146511208,
+                  472335975,534494836,912985153,4679307774,
+                  32164049650,32164049651]
+  it "returns true for narcissistic numbers" do
+    NARCISSISTIC.each do |number|
+      number.should be_narcissistic
+    end
+  end
+
+  it "returns false for non-narcissistic numbers" do
+    [10,30,100,178762628].each do |number|
+      number.should_not be_narcissistic
+    end
+  end
+end

data/spec/nivenmorphic_spec.rb

@@ -0,0 +1,24 @@
+describe Integer, "#nivenmorphic?" do
+  NIVENMORPHIC = [1,2,3,4,5,6,7,8,9,910,0,912,11713,6314,915,3616,
+                  15317,918,17119,9920,18921,9922,82823,19824,9925,
+                  46826,18927,18928,78329,99930,585931,388832,
+                  1098933,198934,289835,99936,99937,478838,198939,
+                  1999840]
+  it "returns true for Nivenmorphic numbers" do
+    NIVENMORPHIC.each do |number|
+      number.should be_nivenmorphic
+    end
+  end
+
+  it "returns false for non-Nivenmorphic numbers" do
+    ((1..300).to_a - NIVENMORPHIC).each do |number|
+      number.should_not be_nivenmorphic
+    end
+  end
+
+  it "returns false for negative numbers" do
+    (1..300).each do |number|
+      (-number).should_not be_nivenmorphic
+    end
+  end
+end

data/spec/number_of_distinct_prime_factors_spec.rb

@@ -0,0 +1,35 @@
+# coding: utf-8
+describe Integer, "#number_of_distinct_prime_factors" do
+  # http://www.research.att.com/~njas/sequences/A001221
+  OMEGA = [0,1,1,1,1,2,1,1,1,2,1,2,1,2,2,1,1,2,1,2,2,2,1,2,
+           1,2,1,2,1,3,1,1,2,2,2,2,1,2,2,2,1,3,1,2,2,2,1,2,1,
+           2,2,2,1,2,2,2,2,2,1,3,1,2,2,1,2,3,1,2,2,3,1,2,1,2,
+           2,2,2,3,1,2,1,2,1,3,2,2,2,2,1,3,2,2,2,2,2,2,1,2,2,
+           2,1,3,1,2,3,2,1,2,1,3,2]
+
+  it "returns the number of distinct prime factors of self" do
+    OMEGA.each_with_index do |omega, number|
+      (number + 1).number_of_distinct_prime_factors.should == omega
+    end
+
+    # http://www.research.att.com/~njas/sequences/A046386
+    [210,330,390,462,510,546,570,690,714,770,798,858,
+     870,910,930,966,1110,1122,1155,1190,1218,1230,
+     1254,1290,1302,1326,1330,1365,1410,1430,1482,1518,
+     1554,1590,1610,1722,1770,1785,1794,1806,1830,1870,
+     1914,1938,1974].each do |number|
+      number.number_of_distinct_prime_factors.should == 4
+     end
+  end
+
+  it "does not count any factor more than once" do
+    [4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 
+     50, 52, 54, 56, 60, 63, 64, 68, 72, 75, 76, 80, 81, 84, 88, 90, 92, 
+     96, 98, 99, 100, 104, 108, 112, 116, 117, 120, 121, 124, 125, 126, 128,
+     132, 135, 136, 140, 144, 147, 148, 150].each do |number|
+      number.prime_factors.size.should >= 2
+      number.prime_factors.uniq.should_not == number.prime_factors
+      number.number_of_distinct_prime_factors.should == number.prime_factors.uniq.size
+     end
+  end
+end

data/spec/number_of_prime_factors_spec.rb

@@ -0,0 +1,32 @@
+# coding: utf-8
+describe Integer, "#number_of_prime_factors" do
+  # http://www.research.att.com/~njas/sequences/A001222
+  BIGOMEGA = [0,1,1,2,1,2,1,3,2,2,1,3,1,2,2,4,1,3,1,3,2,2,1,4,
+              2,2,3,3,1,3,1,5,2,2,2,4,1,2,2,4,1,3,1,3,3,2,1,5,2,
+              3,2,3,1,4,2,4,2,2,1,4,1,2,3,6,2,3,1,3,2,3,1,5,1,2,
+              3,3,2,3,1,5,4,2,1,4,2,2,2,4,1,4,2,3,2,2,2,6,1,3,3,
+              4,1,3,1,4,3,2,1,5,1,3,2]
+
+  it "returns the number of prime factors (counted with multiplicity) of self" do
+    BIGOMEGA.each_with_index do |bigomega, number|
+      (number + 1).number_of_prime_factors.should == bigomega
+    end
+  end
+
+  it "is >= ω" do
+    BIGOMEGA.each_with_index do |bigomega, number|
+      (number + 1).number_of_prime_factors.should >= (number + 1).number_of_distinct_prime_factors
+    end
+  end
+
+  it "counts factors more than once" do
+    [4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 
+     50, 52, 54, 56, 60, 63, 64, 68, 72, 75, 76, 80, 81, 84, 88, 90, 92, 
+     96, 98, 99, 100, 104, 108, 112, 116, 117, 120, 121, 124, 125, 126, 128,
+     132, 135, 136, 140, 144, 147, 148, 150].each do |number|
+      number.prime_factors.size.should >= 2
+      number.prime_factors.uniq.should_not == number.prime_factors
+      number.number_of_prime_factors.should == number.prime_factors.size
+     end
+  end
+end

data/spec/ordinal_spec.rb

@@ -0,0 +1,64 @@
+describe Integer, "#ordinal" do
+  it "returns 'th' for numbers ending in 0" do
+    0.ordinal.should == 'th'
+    20.ordinal.should == 'th'
+  end
+
+  it "returns 'st' for numbers ending in 1" do
+    1.ordinal.should == 'st'
+    201.ordinal.should == 'st'
+    111.ordinal.should == 'st'
+  end
+
+  it "returns 'nd' for numbers ending in 2" do
+    2.ordinal.should == 'nd'
+    202.ordinal.should == 'nd'
+    222.ordinal.should == 'nd'
+  end
+
+  it "returns 'rd' for numbers ending in 3" do
+    3.ordinal.should == 'rd'
+    203.ordinal.should == 'rd'
+    333.ordinal.should == 'rd'
+  end
+
+  it "returns 'th' for numbers ending in 4" do
+    4.ordinal.should == 'th'
+    204.ordinal.should == 'th'
+    444.ordinal.should == 'th'
+  end
+
+  it "returns 'th' for numbers ending in 5" do
+    5.ordinal.should == 'th'
+    205.ordinal.should == 'th'
+    555.ordinal.should == 'th'
+  end
+
+  it "returns 'th' for numbers ending in 6" do
+    6.ordinal.should == 'th'
+    206.ordinal.should == 'th'
+    666.ordinal.should == 'th'
+  end
+
+  it "returns 'th' for numbers ending in 7" do
+    7.ordinal.should == 'th'
+    207.ordinal.should == 'th'
+    777.ordinal.should == 'th'
+  end
+
+  it "returns 'th' for numbers ending in 8" do
+    8.ordinal.should == 'th'
+    208.ordinal.should == 'th'
+    888.ordinal.should == 'th'
+  end
+
+  it "returns 'th' for numbers ending in 9" do
+    9.ordinal.should == 'th'
+    209.ordinal.should == 'th'
+    999.ordinal.should == 'th'
+  end
+
+  it "returns 'th' for 10..19" do
+    (10..19).each{|n| n.ordinal.should == 'th'}
+  end
+end

data/spec/parasitic_spec.rb

@@ -0,0 +1,29 @@
+describe Integer, "#parasitic?" do
+  # http://www.research.att.com/~njas/sequences/A092697
+  PARASITIC = [1,105263157894736842,
+               1034482758620689655172413793,102564,
+               102040816326530612244897959183673469387755,
+               1016949152542372881355932203389830508474576271186440677966,
+               1014492753623188405797,1012658227848,
+               10112359550561797752808988764044943820224719]
+
+  
+  it "returns true for parasitic numbers" do
+    PARASITIC.each do |number|
+      number.should be_parasitic
+    end
+  end
+  
+  PARASITIC.each_with_index do |number,n|
+    n += 1
+    it "returns true for #{n}-parasitic numbers when #{n} is the argument" do
+      number.parasitic?(n).should be_true
+    end
+  end
+
+  it "returns false for non-parasitic numbers" do
+    [2, 8, 105263157894736843].each do |number|
+      number.should_not be_parasitic
+    end
+  end
+end

data/spec/perfect_power_spec.rb

@@ -0,0 +1,24 @@
+describe Integer, "#perfect_power?" do
+  PERFECT_POWERS = [1, 4,8,9,16,25,27,32,36,49,64,81,100,121,125,128,
+                    144,169,196,216,225,243,256,289,324,343,361,400,
+                    441,484,512,529,576,625,676,729,784,841,900,961,
+                    1000,1024,1089,1156,1225,1296,1331,1369,1444,1521,
+                    1600,1681,1728,1764]
+  it "returns true for perfect powers" do
+    PERFECT_POWERS.each do |power|
+      power.should be_perfect_power
+    end
+  end
+
+  it "returns false for imperfect powers" do
+    ((1..1764).to_a - PERFECT_POWERS).each do |power|
+      power.should_not be_perfect_power
+    end
+  end
+
+  it "returns false for negative numbers" do
+    (1..1764).each do |power|
+      (-power).should_not be_perfect_power
+    end
+  end
+end