File Coverage

blib/lib/Math/NumSeq/DuffinianNumbers.pm

Criterion	Covered	Total	%
statement	52	54	96.3
branch	8	10	80.0
condition	5	6	83.3
subroutine	15	15	100.0
pod	1	1	100.0
total	81	86	94.1

# Copyright 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::DuffinianNumbers;
use 5.004;
use strict;
use List::Util 'sum';
use Math::Prime::XS 0.23 'is_prime'; # version 0.23 fix for 1928099
use Math::Factor::XS 0.40 'factors'; # version 0.40 for factors() on BigInt


use vars '$VERSION', '@ISA';
$VERSION = 72;
use Math::NumSeq;
use List::Util 'min';
use Math::NumSeq::Base::IteratePred;
@ISA = ('Math::NumSeq::Base::IteratePred',
        'Math::NumSeq');
*_is_infinite = \&Math::NumSeq::_is_infinite;
*_to_bigint = \&Math::NumSeq::_to_bigint;

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


# use constant name => Math::NumSeq::__('Duffinian Numbers');
use constant description => Math::NumSeq::__('Duffinian numbers.');
use constant i_start => 1;

use constant values_min => 4;

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

use constant oeis_anum => 'A003624';


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

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

  if (_is_infinite($value)) {
    return undef;
  }
  if ($value < 2 || $value != int($value)) {
    return 0;
  }
  if ($value > 0xFFFF_FFFF) {
    return undef;
  }
  $value = "$value"; # numize any Math::BigInt for speed

  return ! is_prime($value)
    && _coprime($value, sum(1,factors($value)));
}

# return true if coprime
sub _coprime {
  my ($x, $y) = @_;
  ### _coprime(): "$x,$y"

  if ($y > $x) {
    ($x,$y) = ($y,$x);
  }
  for (;;) {
    if ($y <= 1) {
      ### result: ($y == 1)
      return ($y == 1);
    }
    ($x,$y) = ($y, $x % $y);
  }
}

1;
__END__