numb 0.185.0 → 0.186.0

data/VERSION

@@ -1 +1 @@
-0.185.0
+0.186.0

data/lib/numb/divisors/perfect.rb

@@ -33,6 +33,9 @@ class Integer
  
   def almost_perfect?
     return true if self == 1
+    # TODO: All known almost perfect numbers are powers of 2. If self
+    # is within the range of integers thus tested, a power_of?(2) test
+    # would avoid the need to factorise.
     proper_divisors.reduce(:+) == self - 1
   end
 

data/lib/numb/totient.rb

@@ -7,4 +7,38 @@ class Integer
   end
 
   alias :totient :φ
+
+
+  # Returns `true` if `self` is equal to the sum of its iterated
+  # totients, otherwise `false`
+  #
+  # For example:  φ(183) = 120
+  #               φ(120)  = 32
+  #               φ(32)   = 16
+  #               φ(16)    = 8
+  #               φ(4)     = 2
+  #               φ(2)     = 1
+  # 120 + 32 + 16 + 8 + 4 + 2 + 1 = 183
+  # @return [true, false] `true` if `self` is a perfect totient; `false` otherwise.
+  def perfect_totient?
+    # TODO: Possible optimisation: once the totient is a power of 2,
+    # which we identify using bit ops, it is predictable what totients
+    # will follow. For example, consider 441027. Its iterated totients
+    # are [294012, 97992, 32640, 8192, 4096, 2048, 1024, 512, 256,
+    # 128, 64, 32, 16, 8, 4, 2, 1], i.e. 17 iterations are
+    # needed. Once we hit 8192, we can derive [2, 4, 8, 16, 32, 64,
+    # 128, 256, 512, 1024, 2048, 4096, 8192], add the 1, then return.
+
+    # TODO: The more obvious tweak is to return true immediately when
+    # self is a power of 3. I want to write a #power_of? predicate for
+    # the general case first, then benchmark it for use here.
+    return false if even?
+    a = [totient]
+    sum = a.first
+    until a.last == 1 or sum > self
+      a << a.last.totient
+      sum += a.last
+    end
+    sum == self
+  end
 end

data/spec/numb/perfect_totient_spec.rb

@@ -0,0 +1,30 @@
+describe Integer, "#perfect_totient?" do
+  # A082897
+  @seq = [3,9,15,27,39,81,111,183,243,255,327,363,471,729,
+          2187,2199,3063,4359,4375,5571,6561,8751,15723,
+          19683,36759,46791,59049,65535,140103,177147,
+          208191,441027,531441,1594323,4190263,4782969,
+          9056583,14348907,43046721] |
+    # A091847
+         [15,39,111,183,255,327,363,471,2199,3063,4359,
+          4375,5571,8751,15723,36759,46791,65535,140103,
+          208191,441027,4190263,9056583,57395631,172186887,
+          236923383,918330183,3932935775,4294967295,
+          4764161215]
+
+  @seq.each do |n|
+    it "returns true for perfect totient number #{n}" do
+      n.should be_perfect_totient
+    end
+
+    m =  n + 2
+    it "returns false for non-perfect-totient number #{m}" do
+      m.should_not be_perfect_totient
+    end  
+
+    m += 1
+    it "returns false for even number #{m}" do
+      m.should_not be_perfect_totient
+    end  
+  end
+end

metadata

@@ -4,9 +4,9 @@ version: !ruby/object:Gem::Version
   prerelease: false
   segments: 
   - 0
-  - 185
+  - 186
   - 0
-  version: 0.185.0
+  version: 0.186.0
 platform: ruby
 authors: 
 - Run Paint Run Run
@@ -343,6 +343,7 @@ files:
 - spec/numb/pentatope_spec.rb
 - spec/numb/perfect_power_spec.rb
 - spec/numb/perfect_spec.rb
+- spec/numb/perfect_totient_spec.rb
 - spec/numb/perrin_spec.rb
 - spec/numb/persistent_spec.rb
 - spec/numb/polite_spec.rb
@@ -493,6 +494,7 @@ test_files:
 - spec/numb/emrip_spec.rb
 - spec/numb/minimal_spec.rb
 - spec/numb/weird_spec.rb
+- spec/numb/perfect_totient_spec.rb
 - spec/numb/practical_spec.rb
 - spec/numb/ore_spec.rb
 - spec/numb/base_spec.rb