File Coverage

blib/lib/Math/NumSeq/ErdosSelfridgeClass.pm

Criterion	Covered	Total	%
statement	79	80	98.7
branch	12	14	85.7
condition	9	12	75.0
subroutine	21	21	100.0
pod	5	6	83.3
total	126	133	94.7

# 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::ErdosSelfridgeClass;
use 5.004;
use strict;
use Math::NumSeq::Primes;

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

use Math::NumSeq;
@ISA = ('Math::NumSeq');

use Math::NumSeq::PrimeFactorCount;;
*_prime_factors = \&Math::NumSeq::PrimeFactorCount::_prime_factors;

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


# use constant name => Math::NumSeq::__('Erdos-Selfridge Class');
use constant description => Math::NumSeq::__('Erdos-Selfridge class of a prime.');
use constant default_i_start => 1;
use constant characteristic_integer => 1;
use constant characteristic_increasing => 0;
use constant characteristic_non_decreasing => 0;
use constant characteristic_smaller => 1;
use constant values_min => 0;

use constant parameter_info_array =>
  [
   { name        => 'p_or_m',
     display     => Math::NumSeq::__('+/-'),
     type        => 'enum',
     default     => '+',
     choices     => ['+','-'],
     choices_display => [Math::NumSeq::__('+'),
                         Math::NumSeq::__('-')],
     description => Math::NumSeq::__('Class + or -, factorizing p+1 or p-1 respectively in the classification.'),
   },
   { name        => 'on_values',
     share_key   => 'on_values_primes',
     display     => Math::NumSeq::__('On Values'),
     type        => 'enum',
     default     => 'all',
     choices     => ['all','primes'],
     choices_display => [Math::NumSeq::__('All'),
                         Math::NumSeq::__('Primes')],
     description => Math::NumSeq::__('Values to classify, either all integers or just the primes.'),
   },
  ];

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

# cf A098661 cumulative class+
#    A005109 1-, Pierpont
#    A005110 2-
#    A005111 3-
#    A005112 4-
#    A081424 5-
#    A081425 6-
#    A081640 12-
#    A129248 14-
#    A129249 15-
#    A129250 16-
#    A005105 1+
#    A005106 2+
#    A005107 3+
#    A005108 4+
#    A081633 5+
#    ...
#    A081639 11+
#    A084071 12+
#    A090468 13+
#    A129474 14+
#    A129475 15+
#    A178382 in both k+ and k- for some k
#    A005113 least prime in class n+
#    A056637 least prime of class n-
#    A129470 where largest factor of p+1 isn't largest class
#    A129469 first prime of class n+ in A129470
#    A129471 3+ with largest factor of p+1 not in 2+
#    A129472 4+ with largest factor of p+1 not in 3+
#
my %oeis_anum = ('+' => { 'primes' => 'A126433', # class+ of primes
                          'all'    => 'A078442',
                        },
                 '-' => { 'primes' => 'A126805', # class- of primes
                        });
# OEIS-Catalogue: A126433 on_values=primes
# OEIS-Catalogue: A126805 on_values=primes p_or_m=-
sub oeis_anum {
  my ($self) = @_;
  return $oeis_anum{$self->{'p_or_m'}}->{$self->{'on_values'}};
}

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

sub rewind {
  my ($self) = @_;
  $self->{'i'} = $self->i_start;
  if ($self->{'on_values'} eq 'primes') {
    $self->{'seq'} = Math::NumSeq::Primes->new;
  }
}
sub next {
  my ($self) = @_;
  my $i = $self->{'i'}++;
  my $value;
  if (my $seq = $self->{'seq'}) {
    (undef, $value) = $self->{'seq'}->next;
  } else {
    $value = $i;
  }
  return ($i, _classify($self,$value));
}

sub ith {
  my ($self, $i) = @_;
  if ($self->{'on_values'} eq 'primes') {
    return undef; # no i'th prime yet
  }
  return _classify($self,$i);
}
sub can {
  my ($class_or_self, $method) = @_;
  if (($method eq 'ith' || $method eq 'seek_to_i')
      && ref $class_or_self
      && $class_or_self->{'on_values'} eq 'primes') {
    return undef;
  }
  return $class_or_self->SUPER::can($method);
}

sub _classify {
  my ($self, $i) = @_;

  Math::NumSeq::Primes->pred($i)
      or return 0;

  my $offset = ($self->{'p_or_m'} eq '+' ? 1 : -1);
  my $ret = 0;
  my @this = ($i);
  while (@this) {
    $ret++;
    my %next;
    foreach my $prime (@this) {
      my ($good, @primes) = _prime_factors($prime + $offset);
      return undef unless $good;

      @next{@primes} = ();  # hash slice, for uniq
    }
    delete @next{2,3}; # hash slice, not 2 or 3
    @this = keys %next;
  }
  return $ret;
}

sub pred {
  my ($self, $value) = @_;
  return ($value >= 0
          && $value == int($value));
}

1;
__END__