File Coverage

blib/lib/Math/NumSeq/HappyNumbers.pm

Criterion	Covered	Total	%
statement	49	49	100.0
branch	6	6	100.0
condition	4	6	66.6
subroutine	14	14	100.0
pod	2	2	100.0
total	75	77	97.4

# Copyright 2011, 2012, 2013, 2014 Kevin Ryde

# This file is part of Math-NumSeq.
#
# Math-NumSeq is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by the
# Free Software Foundation; either version 3, or (at your option) any later
# version.
#
# Math-NumSeq is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
# or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
# for more details.
#
# You should have received a copy of the GNU General Public License along
# with Math-NumSeq.  If not, see .

package Math::NumSeq::HappyNumbers;
use 5.004;
use strict;
use List::Util 'sum';

use vars '$VERSION', '@ISA';
$VERSION = 72;

use Math::NumSeq;
use Math::NumSeq::Base::IteratePred;
@ISA = ('Math::NumSeq::Base::IteratePred',
        'Math::NumSeq');
*_is_infinite = \&Math::NumSeq::_is_infinite;

use Math::NumSeq::Repdigits;
*_digit_split_lowtohigh = \&Math::NumSeq::Repdigits::_digit_split_lowtohigh;

# uncomment this to run the ### lines
# use Smart::Comments;


# use constant name => Math::NumSeq::__('Happy Numbers');
use constant description => Math::NumSeq::__('Happy numbers 1,7,10,13,19,23,etc, reaching 1 under iterating sum of squares of digits.');
use constant default_i_start => 1;
use constant values_min => 1;

use Math::NumSeq::Base::Digits
  'parameter_info_array';   # radix parameter

#------------------------------------------------------------------------------
# cf A035497 happy primes, happy numbers which are prime
#    A003621 how many steps to reach 1 or 4
#    A090425 how many steps for just the happy numbers
#    A031176 period of final cycle, being 1 or 8 in decimal
#
#    A000216 start 2 the cycle 4,16,37,58,89,145,42,20
#    A000218 start 3
#    A080709 start 4
#    A000221 start 5
#    A008460 start 6
#    A008462 start 8
#    A008463 start 9
#    A139566 start 15
#    A122065 start 74169
#
my @oeis_anum;
$oeis_anum[2] = 'A000027'; # 1,2,3,4, everything happy in base 2
# OEIS-Other: A000027 radix=2

$oeis_anum[4] = 'A000027'; # 1,2,3,4, everything happy in base 4
# OEIS-Other: A000027 radix=4

$oeis_anum[10] = 'A007770';
# OEIS-Catalogue: A007770 radix=10

sub oeis_anum {
  my ($self) = @_;
  return $oeis_anum[$self->{'radix'}];
}

#------------------------------------------------------------------------------

sub pred {
  my ($self, $value) = @_;
  ### HappyNumbers pred(): $value
  if ($value <= 0
      || $value != int($value)
      || _is_infinite($value)) {
    return 0;
  }
  my $radix = $self->{'radix'};
  my %seen;
  for (;;) {
    ### $value
    if ($value == 1) {
      return 1;
    }
    if ($seen{$value}) {
      return 0;  # inf loop
    }
    $seen{$value} = 1;
    $value = _sum_of_squares_of_digits($value,$radix);
  }
}
sub _sum_of_squares_of_digits {
  my ($n, $radix) = @_;
  return sum (map {$_ * $_} _digit_split_lowtohigh($n,$radix));
}

1;
__END__