numb 0.3.0

data/lib/numb.rb

@@ -0,0 +1,80 @@
+# coding: utf-8
+
+require 'rubygems'
+require 'backports'
+
+libs = %w{abundant achilles automorphic carol deficient dihedral_prime dudeney
+   economical emrip equidigital extravagant factorion frugal happy
+   harshad hilbert hyperperfect impolite kaprekar keith kynea mms_pair mobius
+   narcissistic nivenmorphic ordinal parasitic perfect perfect_power polite 
+   polydivisible powerful practical self self_descriptive semi_perfect semiprime 
+   smarandache_wellin smith sphenic square square_free triangular trimorphic
+   undulating vampire weird
+}
+
+class Integer
+  
+  def number_of_distinct_prime_factors
+    prime_factors.uniq.size
+  end
+  alias :omega :number_of_distinct_prime_factors
+
+  def number_of_prime_factors
+    prime_factors.size
+  end
+  alias :bigomega :number_of_prime_factors
+
+  def prime_factors
+    return [] if zero?
+    prime_division.map{|pair| [pair.first] * pair.last}.flatten
+  end
+
+  def politeness
+    positive_divisors.select{|d| d > 1}.select{|d| d.odd?}.size
+  end
+
+  def proper_positive_divisors
+    positive_divisors.reject {|d| d == self }
+  end
+
+  def positive_divisors
+    return [] unless self >= 0
+    (1..Math.sqrt(self).floor).select { |n| (self % n).zero? }.
+                              map {|n| [n, self/n]}.flatten.uniq
+  end
+
+  def sum_of_divisors
+    positive_divisors.reduce(:+)
+  end
+
+  def digital_root
+    self == 0 ? 0 : 1 + ((self - 1) % 9)
+  end
+
+  def digital_sum
+    digits.reduce(:+)
+  end
+  alias :sum_of_digits :digital_sum
+  alias :sod :digital_sum
+
+  def digits
+    self.to_s.split(//).map{|d| d.to_i}
+  end
+
+  def factor?(n)
+    return false if n == 0
+    (self % n) == 0
+  end
+end
+
+begin
+  require 'prime'
+  libs << 'ruby1.9'
+rescue LoadError
+  libs.unshift('ruby1.8','prime')
+end
+
+libs.each do |predicate|
+  require_relative "numb/#{predicate}"
+end
+

data/numb.gemspec

@@ -0,0 +1,201 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run the gemspec command
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{numb}
+  s.version = "0.3.0"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Run Paint Run Run"]
+  s.date = %q{2009-12-31}
+  s.email = %q{runrun@runpaint.org}
+  s.extra_rdoc_files = [
+    "LICENSE",
+     "README.rdoc"
+  ]
+  s.files = [
+    ".document",
+     ".gitignore",
+     "LICENSE",
+     "README.rdoc",
+     "Rakefile",
+     "VERSION",
+     "lib/numb.rb",
+     "lib/numb/abundant.rb",
+     "lib/numb/achilles.rb",
+     "lib/numb/automorphic.rb",
+     "lib/numb/carol.rb",
+     "lib/numb/deficient.rb",
+     "lib/numb/dihedral_prime.rb",
+     "lib/numb/dudeney.rb",
+     "lib/numb/economical.rb",
+     "lib/numb/emrip.rb",
+     "lib/numb/equidigital.rb",
+     "lib/numb/extravagant.rb",
+     "lib/numb/factorion.rb",
+     "lib/numb/frugal.rb",
+     "lib/numb/happy.rb",
+     "lib/numb/harshad.rb",
+     "lib/numb/hilbert.rb",
+     "lib/numb/hyperperfect.rb",
+     "lib/numb/impolite.rb",
+     "lib/numb/kaprekar.rb",
+     "lib/numb/keith.rb",
+     "lib/numb/kynea.rb",
+     "lib/numb/mms_pair.rb",
+     "lib/numb/mobius.rb",
+     "lib/numb/narcissistic.rb",
+     "lib/numb/nivenmorphic.rb",
+     "lib/numb/ordinal.rb",
+     "lib/numb/parasitic.rb",
+     "lib/numb/perfect.rb",
+     "lib/numb/perfect_power.rb",
+     "lib/numb/polite.rb",
+     "lib/numb/polydivisible.rb",
+     "lib/numb/powerful.rb",
+     "lib/numb/practical.rb",
+     "lib/numb/prime.rb",
+     "lib/numb/ruby1.8.rb",
+     "lib/numb/ruby1.9.rb",
+     "lib/numb/self.rb",
+     "lib/numb/self_descriptive.rb",
+     "lib/numb/semi_perfect.rb",
+     "lib/numb/semiprime.rb",
+     "lib/numb/smarandache_wellin.rb",
+     "lib/numb/smith.rb",
+     "lib/numb/sphenic.rb",
+     "lib/numb/square.rb",
+     "lib/numb/square_free.rb",
+     "lib/numb/triangular.rb",
+     "lib/numb/trimorphic.rb",
+     "lib/numb/undulating.rb",
+     "lib/numb/vampire.rb",
+     "lib/numb/weird.rb",
+     "numb.gemspec",
+     "spec/abundant_spec.rb",
+     "spec/achilles_spec.rb",
+     "spec/automorphic_spec.rb",
+     "spec/carol_spec.rb",
+     "spec/deficient_spec.rb",
+     "spec/digital_sum_spec.rb",
+     "spec/dihedral_prime_spec.rb",
+     "spec/dudeney_spec.rb",
+     "spec/economical_spec.rb",
+     "spec/emrip_spec.rb",
+     "spec/equidigital_spec.rb",
+     "spec/extravagant_spec.rb",
+     "spec/factor_spec.rb",
+     "spec/factorion_spec.rb",
+     "spec/frugal_spec.rb",
+     "spec/happy_spec.rb",
+     "spec/harshad_spec.rb",
+     "spec/hilbert_spec.rb",
+     "spec/hyperperfect_spec.rb",
+     "spec/kaprekar_spec.rb",
+     "spec/keith_spec.rb",
+     "spec/kynea_spec.rb",
+     "spec/maris_mcgwire_sosa_pair_spec.rb",
+     "spec/mobius_spec.rb",
+     "spec/narcissistic_spec.rb",
+     "spec/nivenmorphic_spec.rb",
+     "spec/number_of_distinct_prime_factors_spec.rb",
+     "spec/number_of_prime_factors_spec.rb",
+     "spec/ordinal_spec.rb",
+     "spec/parasitic_spec.rb",
+     "spec/perfect_power_spec.rb",
+     "spec/perfect_spec.rb",
+     "spec/polite_spec.rb",
+     "spec/politeness_spec.rb",
+     "spec/polydivisible_spec.rb",
+     "spec/powerful_spec.rb",
+     "spec/practical_spec.rb",
+     "spec/self_descriptive_spec.rb",
+     "spec/self_spec.rb",
+     "spec/semi_perfect_spec.rb",
+     "spec/semiprime_spec.rb",
+     "spec/smarandache_wellin_spec.rb",
+     "spec/smith_spec.rb",
+     "spec/spec_helper.rb",
+     "spec/sphenic_spec.rb",
+     "spec/square_free_spec.rb",
+     "spec/square_spec.rb",
+     "spec/triangular_spec.rb",
+     "spec/trimorphic_spec.rb",
+     "spec/undulating_spec.rb",
+     "spec/vampire_spec.rb",
+     "spec/weird_spec.rb"
+  ]
+  s.homepage = %q{http://github.com/runpaint/numb}
+  s.rdoc_options = ["--charset=UTF-8"]
+  s.require_paths = ["lib"]
+  s.required_ruby_version = Gem::Requirement.new(">= 1.9.1")
+  s.rubygems_version = %q{1.3.5}
+  s.summary = %q{Experiments in number theory with new predicate methods for Integer.}
+  s.test_files = [
+    "spec/economical_spec.rb",
+     "spec/polydivisible_spec.rb",
+     "spec/equidigital_spec.rb",
+     "spec/nivenmorphic_spec.rb",
+     "spec/dudeney_spec.rb",
+     "spec/square_free_spec.rb",
+     "spec/abundant_spec.rb",
+     "spec/self_spec.rb",
+     "spec/square_spec.rb",
+     "spec/ordinal_spec.rb",
+     "spec/perfect_spec.rb",
+     "spec/perfect_power_spec.rb",
+     "spec/polite_spec.rb",
+     "spec/automorphic_spec.rb",
+     "spec/hyperperfect_spec.rb",
+     "spec/spec_helper.rb",
+     "spec/kynea_spec.rb",
+     "spec/factor_spec.rb",
+     "spec/emrip_spec.rb",
+     "spec/smith_spec.rb",
+     "spec/vampire_spec.rb",
+     "spec/dihedral_prime_spec.rb",
+     "spec/sphenic_spec.rb",
+     "spec/practical_spec.rb",
+     "spec/parasitic_spec.rb",
+     "spec/number_of_prime_factors_spec.rb",
+     "spec/frugal_spec.rb",
+     "spec/semiprime_spec.rb",
+     "spec/deficient_spec.rb",
+     "spec/happy_spec.rb",
+     "spec/triangular_spec.rb",
+     "spec/semi_perfect_spec.rb",
+     "spec/smarandache_wellin_spec.rb",
+     "spec/maris_mcgwire_sosa_pair_spec.rb",
+     "spec/trimorphic_spec.rb",
+     "spec/harshad_spec.rb",
+     "spec/carol_spec.rb",
+     "spec/powerful_spec.rb",
+     "spec/weird_spec.rb",
+     "spec/number_of_distinct_prime_factors_spec.rb",
+     "spec/digital_sum_spec.rb",
+     "spec/factorion_spec.rb",
+     "spec/undulating_spec.rb",
+     "spec/extravagant_spec.rb",
+     "spec/self_descriptive_spec.rb",
+     "spec/kaprekar_spec.rb",
+     "spec/hilbert_spec.rb",
+     "spec/keith_spec.rb",
+     "spec/narcissistic_spec.rb",
+     "spec/achilles_spec.rb",
+     "spec/politeness_spec.rb",
+     "spec/mobius_spec.rb"
+  ]
+
+  if s.respond_to? :specification_version then
+    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::RubyGemsVersion) >= Gem::Version.new('1.2.0') then
+    else
+    end
+  else
+  end
+end
+

data/spec/abundant_spec.rb

@@ -0,0 +1,24 @@
+describe Integer, "#abundant?" do
+  ABUNDANT = [12,18,20,24,30,36,40,42,48,54,56,60,66,70,72,78,
+              80,84,88,90,96,100,102,104,108,112,114,120,126,
+              132,138,140,144,150,156,160,162,168,174,176,180,
+              186,192,196,198,200,204,208,210,216,220,222,224,
+              228,234,240,246,252,258,260,264,270]
+  it "returns true if the number is abundant" do
+    ABUNDANT.each do |number|
+      number.should be_abundant
+    end
+  end
+
+  it "returns false if the number is not abundant" do
+    ((1..270).to_a - ABUNDANT).each do |number|
+      number.should_not be_abundant
+    end
+  end
+
+  it "returns false if the number is negative" do
+    (1..270).each do |number|
+      (-number).should_not be_abundant
+    end
+  end
+end

data/spec/achilles_spec.rb

@@ -0,0 +1,24 @@
+describe Integer, "achilles?" do
+  ACHILLES = [72,108,200,288,392,432,500,648,675,800,864,968,
+              972,1125,1152,1323,1352,1372,1568,1800,1944,2000,
+              2312,2592,2700,2888,3087,3200,3267,3456,3528,3872,
+              3888,4000,4232,4500,4563,4608,5000,5292,5324,5400,
+              5408,5488]
+  it "returns true for Achilles numbers" do
+    ACHILLES.each do |number|
+      number.should be_achilles
+    end
+  end
+
+  it "returns false for non-Achilles numbers" do
+    ((1..5487).to_a - ACHILLES).sample(10).each do |number|
+      number.should_not be_achilles
+    end
+  end
+
+  it "returns false for negative numbers" do
+    (1..5487).each do |number|
+      (-number).should_not be_achilles
+    end
+  end
+end

data/spec/automorphic_spec.rb

@@ -0,0 +1,208 @@
+describe Integer, "#automorphic?" do
+  
+  AUTOMORPHIC = (
+    # http://www.research.att.com/~njas/sequences/A016090
+    [6,76,376,9376,9376,109376,7109376,87109376,
+     787109376,1787109376,81787109376,81787109376,
+     81787109376,40081787109376,740081787109376,
+     3740081787109376,43740081787109376,
+     743740081787109376] + 
+    # http://www.research.att.com/~njas/sequences/A007185
+    [5,25,625,625,90625,890625,2890625,12890625,
+     212890625,8212890625,18212890625,918212890625,
+     9918212890625,59918212890625,259918212890625,
+     6259918212890625,56259918212890625,
+     256259918212890625] +
+    # http://www.research.att.com/~njas/sequences/A003226
+    [0,1,5,6,25,76,376,625,9376,90625,109376,890625,
+     2890625,7109376,12890625,87109376,212890625,
+     787109376,1787109376,8212890625,18212890625,
+     81787109376,918212890625,9918212890625,
+     40081787109376,59918212890625]
+  ).uniq
+
+  it "returns true for automorphic numbers" do
+    AUTOMORPHIC.each do |n|
+      n.should be_automorphic
+    end
+  end
+
+  it "returns false for negative automorphic numbers" do
+    (AUTOMORPHIC - [0]).each do |n|
+      (-n).should_not be_automorphic
+    end
+  end
+
+  it "returns false for non-automorphic numbers" do
+    [2,4,626, 100228].each do |n|
+      n.should_not be_automorphic
+    end
+  end
+
+  it "returns false for negative numbers" do
+    [2,4,626, 100228].each do |n|
+      (-n).should_not be_automorphic
+    end
+  end
+
+  it "accepts an optional argument for n" do
+    lambda { 3.automorphic?(2) }.should_not raise_error(ArgumentError)
+  end
+
+  it "returns true if the number is 2-automorphic and 2 is given as an argument" do
+    # http://www.research.att.com/~njas/sequences/A030984
+    [8,88,688,4688,54688,554688,3554688,93554688,
+     893554688,893554688,40893554688,40893554688,
+     40893554688,70040893554688,870040893554688,
+     1870040893554688,71870040893554688,
+     871870040893554688].each do |number|
+      number.automorphic?(2).should be_true
+    end
+  end
+
+  it "returns false if the number is not 2-automorphic and 2 is given as an argument" do
+    [6, 13, 93, 552, 5003, 2827220126666].each do |number|
+      number.automorphic?(2).should be_false
+     end
+  end
+
+  it "returns true if the number is 3-automorphic and 3 is given as an argument" do
+    (
+      # http://www.research.att.com/~njas/sequences/A030986
+      [5,75,875,6875,96875,296875,4296875,4296875,
+       404296875,9404296875,39404296875,639404296875,
+       6639404296875,86639404296875,86639404296875,
+       2086639404296875,52086639404296875] +
+      # http://www.research.att.com/~njas/sequences/A030985
+      [2,92,792,9792,69792,369792,2369792,62369792,
+       262369792,7262369792,27262369792,27262369792,
+       27262369792,80027262369792,580027262369792,
+       4580027262369792,14580027262369792,
+       914580027262369792]
+    ).each do |number|
+      number.automorphic?(3).should be_true
+    end
+  end
+
+  it "returns false if the number is not 3-automorphic and 3 is given as an argument" do
+    [6, 13, 93, 55, 5003, 2827220126666].each do |number|
+      number.automorphic?(3).should be_false
+     end
+  end
+
+  it "returns true if the number is 4-automorphic and 4 is given as an argument" do
+    # http://www.research.att.com/~njas/sequences/A030987
+    [4,44,344,7344,77344,777344,6777344,46777344,
+     446777344,446777344,20446777344,20446777344,
+     5020446777344,35020446777344,935020446777344,
+     5935020446777344,35935020446777344].each do |number|
+      number.automorphic?(4).should be_true
+    end
+  end
+
+  it "returns false if the number is not 4-automorphic and 4 is given as an argument" do
+    [6, 14, 97, 55, 5000, 2827220126666].each do |number|
+      number.automorphic?(4).should be_false
+     end
+  end
+
+  it "returns true if the number is 5-automorphic and 5 is given as an argument" do
+    # http://www.research.att.com/~njas/sequences/A030988
+    [5,25,125,8125,78125,578125,2578125,42578125,
+     642578125,3642578125,83642578125,983642578125,
+     1983642578125,51983642578125,251983642578125,
+     1251983642578125,51251983642578125].each do |number|
+      number.automorphic?(5).should be_true
+    end
+  end
+
+  it "returns false if the number is not 5-automorphic and 5 is given as an argument" do
+    [6, 97, 55, 5000, 2827220126666].each do |number|
+      number.automorphic?(5).should be_false
+     end
+  end
+
+  it "returns true if the number is 6-automorphic and 6 is given as an argument" do
+    # http://www.research.att.com/~njas/sequences/A030989
+    [6,96,896,4896,84896,184896,1184896,31184896,
+     631184896,3631184896,13631184896,13631184896,
+     13631184896,90013631184896,290013631184896,
+     7290013631184896,57290013631184896,
+     957290013631184896].each do |number|
+      number.automorphic?(6).should be_true
+    end
+  end
+
+  it "returns false if the number is not 6-automorphic and 6 is given as an argument" do
+    [5, 97, 5000, 2827220126666].each do |number|
+      number.automorphic?(6).should be_false
+     end
+  end
+
+  it "returns true if the number is 7-automorphic and 7 is given as an argument" do
+    (
+    # http://www.research.att.com/~njas/sequences/A030993
+    [3,43,143,7143,57143,857143,2857143,42857143,
+     142857143,7142857143,57142857143,857142857143,
+     2857142857143,42857142857143,142857142857143,
+     7142857142857143,57142857142857143] +
+    # http://www.research.att.com/~njas/sequences/A030991
+    [5,75,375,4375,84375,984375,8984375,58984375,
+     458984375,5458984375,45458984375,845458984375,
+     2845458984375,22845458984375,322845458984375,
+     2322845458984375,22322845458984375] +
+    # http://www.research.att.com/~njas/sequences/A030992
+    [8,68,768,2768,72768,872768,3872768,83872768,
+     683872768,1683872768,11683872768,11683872768,
+     11683872768,20011683872768,820011683872768,
+     4820011683872768,34820011683872768,
+     534820011683872768]
+    ).each do |number|
+      number.automorphic?(7).should be_true
+    end
+  end
+
+  it "returns false if the number is not 7-automorphic and 7 is given as an argument" do
+    [2,71,3263,71526675754123263].each do |number|
+      number.automorphic?(7).should be_false
+     end
+  end
+
+  it "returns true if the number is 8-automorphic and 8 is given as an argument" do
+    # http://www.research.att.com/~njas/sequences/A030993
+    [2,72,672,8672,88672,388672,3388672,23388672,
+     223388672,223388672,10223388672,510223388672,
+     7510223388672,67510223388672,967510223388672,
+     7967510223388672,67967510223388672].each do |number|
+      number.automorphic?(8).should be_true
+     end
+  end
+
+  it "returns false if the number is not 8-automorphic and 8 is given as an argument" do
+    [3,71,3263,71526675754123263].each do |number|
+      number.automorphic?(8).should be_false
+     end
+  end
+
+  it "returns true if the number is 9-automorphic and 9 is given as an argument" do
+    # http://www.research.att.com/~njas/sequences/A030995
+    ([5,25,625,5625,65625,765625,4765625,34765625,
+     134765625,3134765625,13134765625,213134765625,
+     2213134765625,62213134765625,362213134765625,
+     7362213134765625,17362213134765625] +
+     # http://www.research.att.com/~njas/sequences/A030994
+    [4,64,264,3264,23264,123264,4123264,54123264,
+     754123264,5754123264,75754123264,675754123264,
+     6675754123264,26675754123264,526675754123264,
+     1526675754123264,71526675754123264]).each do |number|
+      number.automorphic?(9).should be_true
+     end
+  end
+
+  it "returns false if the number is not 9-automorphic and 9 is given as an argument" do
+    [6,65,200,3263,71526675754123263].each do |number|
+      number.automorphic?(9).should be_false
+     end
+  end
+end
+

data/spec/carol_spec.rb

@@ -0,0 +1,18 @@
+describe Integer, "#carol?" do
+  CAROL = [-1,7,47,223,959,3967,16127,65023,261119,1046527,
+           4190207,16769023,67092479,268402687,1073676287,
+           4294836223,17179607039,68718952447,274876858367,
+           1099509530623,4398042316799,17592177655807]
+
+  it "returns true for Carol numbers" do
+    CAROL.each do |number|
+      number.should be_carol
+    end
+  end
+
+  it "returns false for non-Carol numbers" do
+    ((1..300).to_a - CAROL).each do |number|
+      number.should_not be_carol
+    end
+  end
+end

data/spec/deficient_spec.rb

@@ -0,0 +1,23 @@
+describe Integer, "#deficient?" do
+  DEFICIENT = [1,2,3,4,5,7,8,9,10,11,13,14,15,16,17,19,21,22,23,
+               25,26,27,29,31,32,33,34,35,37,38,39,41,43,44,45,
+               46,47,49,50,51,52,53,55,57,58,59,61,62,63,64,65,
+               67,68,69,71,73,74,75,76,77,79,81,82,83,85,86]
+  it "returns true for deficient numbers" do
+    DEFICIENT.each do |number|
+      number.should be_deficient
+    end
+  end
+
+  it "returns false for non-deficient numbers" do
+    ((1..86).to_a - DEFICIENT).each do |number|
+      number.should_not be_deficient
+    end
+  end
+
+  it "returns false for negative numbers" do
+    (1..86).each do |number|
+      (-number).should_not be_deficient
+    end
+  end
+end

data/spec/digital_sum_spec.rb

@@ -0,0 +1,8 @@
+describe Integer, "#digital_sum" do
+  it "returns the sum of the digits of self" do
+    1.digital_sum.should == 1
+    10.digital_sum.should == 1
+    22.digital_sum.should == 4
+    282761.digital_sum.should == 26
+  end
+end

data/spec/dihedral_prime_spec.rb

@@ -0,0 +1,38 @@
+describe Integer, "#dihedral_prime?" do
+                   # http://www.research.att.com/~njas/sequences/A038136
+  DIHEDRAL_PRIME = ([2,11,101,181,1181,1811,18181,108881,110881,
+                    118081,120121,121021,121151,150151,151051,151121,
+                    180181,180811,181081,188011,188801,1008001,
+                    1022201,1028011,1055501,1058011,1082801,1085801,
+                    1088081] +
+                   # http://www.research.att.com/~njas/sequences/A134996
+                   [2,5,11,101,181,1181,1811,18181,108881,110881,
+                    118081,120121,121021,121151,150151,151051,151121,
+                    180181,180811,181081,188011,188801,1008001,
+                    1022201,1028011,1055501,1058011,1082801,1085801,
+                    1088081]).uniq
+
+  it "returns true for Dihedral primes" do
+    DIHEDRAL_PRIME.each do |number|
+      number.should be_dihedral_prime
+    end
+  end
+
+  it "returns false for non-Dihedral primes" do
+    [6,12,4827290].each do |number|
+      number.should_not be_dihedral_prime
+    end
+  end
+
+  it "returns false for primes which aren't Dihedral" do
+    [3,17,19].each do |number|
+      number.should_not be_dihedral_prime
+    end
+  end
+
+  it "returns false for non-primes which are Dihedral" do
+    [8, 808, 1101].each do |number|
+      number.should_not be_dihedral_prime
+    end
+  end
+end

data/spec/dudeney_spec.rb

@@ -0,0 +1,14 @@
+describe Integer, "#dudeney?" do
+  it "returns true for Dudeney numbers" do
+    # http://www.research.att.com/~njas/sequences/A061209
+    [1, 512, 4913, 5832, 17576, 19683].each do |number|
+      number.should be_dudeney
+    end
+  end
+
+  it "returns false for non-Dudeney numbers" do
+    [2, 511, 444444, 196833, 373627919182666355532718191].each do |number|
+      number.should_not be_dudeney
+    end
+  end
+end

data/spec/economical_spec.rb

@@ -0,0 +1,28 @@
+describe Integer, "#economical?" 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]  
+  # 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]
+
+  ECONOMICAL = EQUIDIGITAL + FRUGAL
+
+  it "returns true for economical numbers" do
+    ECONOMICAL.each do |number|
+      number.should be_economical
+    end
+  end
+
+  it "returns false for non-economical numbers" do
+    (((1..139).to_a - EQUIDIGITAL - FRUGAL)).each do |number|
+      number.should_not be_economical
+    end
+  end
+end