File Coverage

blib/lib/Math/NumSeq/MoranNumbers.pm

Criterion	Covered	Total	%
statement	53	55	96.3
branch	10	12	83.3
condition	2	3	66.6
subroutine	13	13	100.0
pod	3	3	100.0
total	81	86	94.1

# Copyright 2012, 2013, 2014, 2016 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::MoranNumbers;
use 5.004;
use strict;
use Math::Prime::XS 0.23 'is_prime'; # version 0.23 fix for 1928099

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;

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

use constant name => Math::NumSeq::__('Moran Numbers');
use constant description => Math::NumSeq::__('Moran numbers, divisible by the sum of their digits and that division resulting in a prime.');
use constant i_start => 1;

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

sub values_min {
  my ($self) = @_;
  if (! $self->{'values_min'}) {
    for (my $value = $self->{'radix'}; ; $value++) {
      if ($self->pred($value)) {
        $self->{'values_min'} = $value;
        last;
      }
    }
  }
  return $self->{'values_min'};
}

#------------------------------------------------------------------------------
# cf A007953 digit sum (in Math::NumSeq::DigitSum)
#    A085775 both n/digitsum(n) and (n+1)/digitsum(n+1) prime
#    A108780 n/digitsum(n) is a golden semiprime
#    A130338 primes not occurring as n/digitsum(n)
#    A003635 inconsummate, quotients not occurring as n/digitsum(n)
#
my @oeis_anum;
$oeis_anum[10] = 'A001101';  # OFFSET=1
# OEIS-Catalogue: A001101

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

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

sub pred {
  my ($self, $value) = @_;
  ### MoranNumbers pred(): $value

  if ($value <= 0 || $value != int($value)) {
    return 0;
  }
  if (_is_infinite($value)) {
    return undef;
  }

  my $radix = $self->{'radix'};
  my $sum = 0;
  my $v = $value;
  while ($v) {
    $sum += ($v % $radix);
    $v = int($v/$radix);
  }
  if ($value % $sum) {
    return 0;
  }
  $value /= $sum;
  if ($value > 0xFFFF_FFFF) {
    return undef;
  }
  return is_prime($value);
}

1;
__END__