1Math::NumSeq::TotientStUespesr(3C)ontributed Perl DocumeMnattaht:i:oNnumSeq::TotientSteps(3)
2
3
4
6 Math::NumSeq::TotientSteps -- count of repeated totients to reach 1
7
9 use Math::NumSeq::TotientSteps;
10 my $seq = Math::NumSeq::TotientSteps->new;
11 my ($i, $value) = $seq->next;
12
14 How many repeated applications of the totient function to reach 1, so
15 from i=1
16
17 0, 1, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, ...
18
19 For example i=5 goes 5- > 4 -> 2 -> 1 so value=3 steps.
20
22 See "FUNCTIONS" in Math::NumSeq for behaviour common to all sequence
23 classes.
24
25 "$seq = Math::NumSeq::TotientSteps->new ()"
26 Create and return a new sequence object.
27
28 Random Access
29 "$value = $seq->ith($i)"
30 Return the count of totient(i) steps to get down to 1.
31
32 "$value = $seq->pred($value)"
33 Return true if $value occurs in the sequence, which simply means a
34 count "$value >= 0".
35
37 Math::NumSeq, Math::NumSeq::Totient, Math::NumSeq::TotientStepsSum,
38 Math::NumSeq::DedekindPsiSteps
39
41 <http://user42.tuxfamily.org/math-numseq/index.html>
42
44 Copyright 2011, 2012, 2013, 2014 Kevin Ryde
45
46 Math-NumSeq is free software; you can redistribute it and/or modify it
47 under the terms of the GNU General Public License as published by the
48 Free Software Foundation; either version 3, or (at your option) any
49 later version.
50
51 Math-NumSeq is distributed in the hope that it will be useful, but
52 WITHOUT ANY WARRANTY; without even the implied warranty of
53 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
54 General Public License for more details.
55
56 You should have received a copy of the GNU General Public License along
57 with Math-NumSeq. If not, see <http://www.gnu.org/licenses/>.
58
59
60
61perl v5.28.0 2014-06-29 Math::NumSeq::TotientSteps(3)