Pisano period: Difference between revisions
add APL
(added RPL) |
Not a robot (talk | contribs) (add APL) |
||
| (13 intermediate revisions by 6 users not shown) | |||
Line 177:
</pre>
=={{header|ALGOL 68}}==
The pisano procedure is based on the Go sample.
<syntaxhighlight lang="algol68">
BEGIN # find the Pisano period of some primes and composites #
INT max number = 180; # maximum number we will consider #
# sieve the primes to max number #
[ 1 : max number ]BOOL is prime; FOR i TO UPB is prime DO is prime[ i ] := ODD i OD;
is prime[ 1 ] := FALSE;
is prime[ 2 ] := TRUE;
FOR s FROM 3 BY 2 TO ENTIER sqrt( max number ) DO
IF is prime[ s ] THEN
FOR p FROM s * s BY s TO UPB is prime DO is prime[ p ] := FALSE OD
FI
OD;
# returns the Pisano period of m #
PROC pisano = ( INT m )INT:
BEGIN
INT p := 0;
INT c := 1;
INT r := 0;
FOR i FROM 0 TO m * m WHILE r = 0 DO
INT t = p;
p := c;
c := ( t + c ) MOD m;
IF p = 0 AND c = 1 THEN r := i + 1 FI
OD;
IF r = 0 THEN 1 ELSE r FI
END # pisano # ;
# returns the Pisano period of p^k or 0 if p is not prime or k < 1 #
PROC pisano prime = ( INT p, k )INT:
IF NOT is prime[ p ] OR k < 1 THEN 0 ELSE p ^ ( k - 1 ) * pisano( p ) FI;
print( ( "Pisano period of p^2 where p is a prime < 15:", newline ) );
FOR p TO 15 DO
IF is prime[ p ] THEN print( ( " ", whole( p, 0 ), ":", whole( pisano prime( p, 2 ), 0 ) ) ) FI
OD;
print( ( newline ) );
print( ( "Pisano period of primes up to 180, non-primes shown as ""*"":", newline ) );
FOR p TO 180 DO
IF NOT is prime[ p ]
THEN print( ( " *" ) )
ELSE print( ( whole( pisano prime( p, 1 ), -4 ) ) )
FI;
IF p MOD 10 = 0 THEN print( ( newline ) ) FI
OD;
print( ( newline ) );
print( ( "Pisano period of positive integers up to 180:", newline ) );
FOR n TO 180 DO
print( ( whole( pisano( n ), -4 ) ) );
IF n MOD 10 = 0 THEN print( ( newline ) ) FI
OD
END
</syntaxhighlight>
{{out}}
<pre>
Pisano period of p^2 where p is a prime < 15:
2:6 3:24 5:100 7:112 11:110 13:364
Pisano period of primes up to 180, non-primes shown as "*":
* 3 8 * 20 * 16 * * *
10 * 28 * * * 36 * 18 *
* * 48 * * * * * 14 *
30 * * * * * 76 * * *
40 * 88 * * * 32 * * *
* * 108 * * * * * 58 *
60 * * * * * 136 * * *
70 * 148 * * * * * 78 *
* * 168 * * * * * 44 *
* * * * * * 196 * * *
50 * 208 * * * 72 * 108 *
* * 76 * * * * * * *
* * * * * * 256 * * *
130 * * * * * 276 * 46 *
* * * * * * * * 148 *
50 * * * * * 316 * * *
* * 328 * * * 336 * * *
* * 348 * * * * * 178 *
Pisano period of positive integers up to 180:
1 3 8 6 20 24 16 12 24 60
10 24 28 48 40 24 36 24 18 60
16 30 48 24 100 84 72 48 14 120
30 48 40 36 80 24 76 18 56 60
40 48 88 30 120 48 32 24 112 300
72 84 108 72 20 48 72 42 58 120
60 30 48 96 140 120 136 36 48 240
70 24 148 228 200 18 80 168 78 120
216 120 168 48 180 264 56 60 44 120
112 48 120 96 180 48 196 336 120 300
50 72 208 84 80 108 72 72 108 60
152 48 76 72 240 42 168 174 144 120
110 60 40 30 500 48 256 192 88 420
130 120 144 408 360 36 276 48 46 240
32 210 140 24 140 444 112 228 148 600
50 36 72 240 60 168 316 78 216 240
48 216 328 120 40 168 336 48 364 180
72 264 348 168 400 120 232 132 178 120
</pre>
=={{header|APL}}==
{{works with|Dyalog APL}}
<syntaxhighlight lang="apl">pisano_period←{
prime ← 2∘≤∧0∧.≠1↓⍳∘(⌊*∘0.5)|⊢
select ← {(⍺⍺¨⍵)/⍵}
factors ← {⍺←2 ⋄ ⍺≥⍵×⍵:⍬ ⋄ 0=⍺|⍵:⍺,⍺∇⍵÷⍺ ⋄ (⍺+1)∇⍵}
pisanoPeriod ← {⊃⍸1 0⍷(⊢,⍵|(+/¯2∘↑))⍣(⍵×⍵),0 1}
pisanoPrime ← {(pisanoPeriod ⍺)×⍺*⍵-1}
pisano ← {∧/{⍺=0:1 ⋄ ⍺ pisanoPrime ≢⍵}⌸factors ⍵}
showPisanoPrimes ← {+⎕←⍵'pisanoPrime'⍺'→'(⍵ pisanoPrime ⍺)}¨
_←2 showPisanoPrimes prime select ⍳15
⎕←''
_←1 showPisanoPrimes prime select ⍳180
⎕←''
⎕←'pisano ⍵ for integers ''⍵'' from 1 to 180 are:'
⎕←pisano¨12 15⍴⍳180
}</syntaxhighlight>
{{out}}
<pre>2 pisanoPrime 2 → 6
3 pisanoPrime 2 → 24
5 pisanoPrime 2 → 100
7 pisanoPrime 2 → 112
11 pisanoPrime 2 → 110
13 pisanoPrime 2 → 364
2 pisanoPrime 1 → 3
3 pisanoPrime 1 → 8
5 pisanoPrime 1 → 20
7 pisanoPrime 1 → 16
11 pisanoPrime 1 → 10
13 pisanoPrime 1 → 28
17 pisanoPrime 1 → 36
19 pisanoPrime 1 → 18
23 pisanoPrime 1 → 48
29 pisanoPrime 1 → 14
31 pisanoPrime 1 → 30
37 pisanoPrime 1 → 76
41 pisanoPrime 1 → 40
43 pisanoPrime 1 → 88
47 pisanoPrime 1 → 32
53 pisanoPrime 1 → 108
59 pisanoPrime 1 → 58
61 pisanoPrime 1 → 60
67 pisanoPrime 1 → 136
71 pisanoPrime 1 → 70
73 pisanoPrime 1 → 148
79 pisanoPrime 1 → 78
83 pisanoPrime 1 → 168
89 pisanoPrime 1 → 44
97 pisanoPrime 1 → 196
101 pisanoPrime 1 → 50
103 pisanoPrime 1 → 208
107 pisanoPrime 1 → 72
109 pisanoPrime 1 → 108
113 pisanoPrime 1 → 76
127 pisanoPrime 1 → 256
131 pisanoPrime 1 → 130
137 pisanoPrime 1 → 276
139 pisanoPrime 1 → 46
149 pisanoPrime 1 → 148
151 pisanoPrime 1 → 50
157 pisanoPrime 1 → 316
163 pisanoPrime 1 → 328
167 pisanoPrime 1 → 336
173 pisanoPrime 1 → 348
179 pisanoPrime 1 → 178
pisano ⍵ for integers '⍵' from 1 to 180 are:
1 3 8 6 20 24 16 12 24 60 10 24 28 48 40
24 36 24 18 60 16 30 48 24 100 84 72 48 14 120
30 48 40 36 80 24 76 18 56 60 40 48 88 30 120
48 32 24 112 300 72 84 108 72 20 48 72 42 58 120
60 30 48 96 140 120 136 36 48 240 70 24 148 228 200
18 80 168 78 120 216 120 168 48 180 264 56 60 44 120
112 48 120 96 180 48 196 336 120 300 50 72 208 84 80
108 72 72 108 60 152 48 76 72 240 42 168 174 144 120
110 60 40 30 500 48 256 192 88 420 130 120 144 408 360
36 276 48 46 240 32 210 140 24 140 444 112 228 148 600
50 36 72 240 60 168 316 78 216 240 48 216 328 120 40
168 336 48 364 180 72 264 348 168 400 120 232 132 178 120</pre>
=={{header|C++}}==
<syntaxhighlight lang="c++">#include <functional>
Line 379 ⟶ 563:
50 36 72 240 60 168 316 78 216 240 48 216 328 120 40
168 336 48 364 180 72 264 348 168 400 120 232 132 178 120</pre>
=={{header|EasyLang}}==
{{trans|Go}}
<syntaxhighlight>
fastfunc isprim num .
if num mod 2 = 0
if num = 2
return 1
.
return 0
.
if num mod 3 = 0
if num = 3
return 1
.
return 0
.
i = 5
while i <= sqrt num
if num mod i = 0
return 0
.
i += 2
if num mod i = 0
return 0
.
i += 4
.
return 1
.
func gcd a b .
if b = 0
return a
.
return gcd b (a mod b)
.
func lcm a b .
return a / gcd a b * b
.
func ipow x p .
prod = 1
while p > 0
if p mod 2 = 1
prod *= x
.
p = p div 2
x *= x
.
return prod
.
proc getprims n . prims[] .
prims[] = [ ]
for i = 2 to n
d = n / i
m = n mod i
if m = 0
prims[] &= i
cnt = 0
while m = 0
cnt += 1
n = d
d = n div i
m = n mod i
.
prims[] &= cnt
.
.
.
func pisanoPeriod m .
c = 1
for i = 1 to m * m
swap p c
c = (p + c) mod m
if p = 0 and c = 1
return i
.
.
return 1
.
func pisanoPrime p k .
if isprim p = 0 or k = 0
return 0
.
return ipow p (k - 1) * pisanoPeriod p
.
func pisano m .
getprims m p[]
for i = 1 step 2 to len p[] - 1
pps[] &= pisanoPrime p[i] p[i + 1]
.
if len pps[] = 0
return 1
.
if len pps[] = 1
return pps[1]
.
f = pps[1]
for i = 2 to len pps[]
f = lcm f pps[i]
.
return f
.
proc main . .
for p = 2 to 14
pp = pisanoPrime p 2
if pp > 0
print "pisanoPrime(" & p & ": 2) = " & pp
.
.
print ""
for p = 2 to 179
pp = pisanoPrime p 1
if pp > 0
print "pisanoPrime(" & p & ": 1) = " & pp
.
.
print ""
numfmt 0 3
print "pisano(n) for integers 'n' from 1 to 180 are:"
for n = 1 to 180
write pisano (n) & " "
if n mod 15 = 0
print ""
.
.
.
main
</syntaxhighlight>
=={{header|Factor}}==
{{works with|Factor|0.99 2020-01-23}}
Line 1,200 ⟶ 1,513:
48 216 328 120 40 168 336 48 364 180
72 264 348 168 400 120 232 132 178 120
</pre>
=={{header|JavaScript}}==
{{Trans|Lua}}
<syntaxhighlight lang="javascript">
{ // find the Pisano period of some primes and composites
const maxNumber = 180
// sieve the primes to maxNumber
let isPrime = []
for( let i = 1; i <= maxNumber; i ++ ){ isPrime[ i ] = i % 2 != 0 }
isPrime[ 1 ] = false
isPrime[ 2 ] = true
const rootMaxNumber = Math.floor( Math.sqrt( maxNumber ) )
for( let s = 3; s <= rootMaxNumber; s += 2 )
{
if( isPrime[ s ] )
{
for( let p = s * s; p <= maxNumber; p += s ){ isPrime[ p ] = false }
}
}
function pisano( m ) // returns the Pisano period of m
{
let p = 0, c = 1
for( let i = 0; i < ( m * m ); i ++ )
{
[ p, c ] = [ c, ( p + c ) % m ]
if( p == 0 && c == 1 ){ return i + 1 }
}
return 1
}
// returns the Pisano period of p^k or 0 if p is not prime or k < 1
function pisanoPrime( p, k )
{
return ( ! isPrime[ p ] || k < 1 ) ? 0 : Math.floor( p ** ( k - 1 ) ) * pisano( p )
}
function d4( n ) // returns n formatted in 4 characcters
{
return n.toString().padStart( 4 )
}
console.log( "Pisano period of p^2 where p is a prime < 15:" )
let list = ""
for( let p = 1; p < 15; p ++ )
{
if( isPrime[ p ] ){ list += " " + p + ":" + pisanoPrime( p, 2 ) }
}
console.log( list )
console.log( "Pisano period of primes up to 180, non-primes shown as \"*\":" )
list = ""
for( p = 1; p <= 180; p ++ )
{
list += ( ! isPrime[ p ] ? " *" : d4( pisanoPrime( p, 1 ) ) )
if( p % 10 == 0 ){ list += "\n" }
}
console.log( list )
console.log( "Pisano period of positive integers up to 180:" )
list = ""
for( let n = 1; n <= 180; n ++ )
{
list += d4( pisano( n ) )
if( n % 10 == 0 ){ list += "\n" }
}
console.log( list )
}
</syntaxhighlight>
{{out}}
<pre>
Pisano period of p^2 where p is a prime < 15:
2:6 3:24 5:100 7:112 11:110 13:364
Pisano period of primes up to 180, non-primes shown as "*":
* 3 8 * 20 * 16 * * *
10 * 28 * * * 36 * 18 *
* * 48 * * * * * 14 *
30 * * * * * 76 * * *
40 * 88 * * * 32 * * *
* * 108 * * * * * 58 *
60 * * * * * 136 * * *
70 * 148 * * * * * 78 *
* * 168 * * * * * 44 *
* * * * * * 196 * * *
50 * 208 * * * 72 * 108 *
* * 76 * * * * * * *
* * * * * * 256 * * *
130 * * * * * 276 * 46 *
* * * * * * * * 148 *
50 * * * * * 316 * * *
* * 328 * * * 336 * * *
* * 348 * * * * * 178 *
Pisano period of positive integers up to 180:
1 3 8 6 20 24 16 12 24 60
10 24 28 48 40 24 36 24 18 60
16 30 48 24 100 84 72 48 14 120
30 48 40 36 80 24 76 18 56 60
40 48 88 30 120 48 32 24 112 300
72 84 108 72 20 48 72 42 58 120
60 30 48 96 140 120 136 36 48 240
70 24 148 228 200 18 80 168 78 120
216 120 168 48 180 264 56 60 44 120
112 48 120 96 180 48 196 336 120 300
50 72 208 84 80 108 72 72 108 60
152 48 76 72 240 42 168 174 144 120
110 60 40 30 500 48 256 192 88 420
130 120 144 408 360 36 276 48 46 240
32 210 140 24 140 444 112 228 148 600
50 36 72 240 60 168 316 78 216 240
48 216 328 120 40 168 336 48 364 180
72 264 348 168 400 120 232 132 178 120
</pre>
=={{header|jq}}==
'''Adapted from [[#Wren|Wren]]'''
'''Works with jq, the C implementation of jq'''
'''Works with gojq, the Go implementation of jq'''
<syntaxhighlight lang="jq">
### In case gojq is used:
# Require $n > 0
def _nwise($n):
def _n: if length <= $n then . else .[:$n] , (.[$n:] | _n) end;
if $n <= 0 then "nwise: argument should be non-negative" else _n end;
### Generic utilities
def lpad($len): tostring | ($len - length) as $l | (" " * $l) + .;
def lcm($m; $n):
# The helper function takes advantage of jq's tail-recursion optimization
def _lcm:
# state is [m, n, i]
if (.[2] % .[1]) == 0 then .[2] else (.[0:2] + [.[2] + $m]) | _lcm end;
[$m, $n, $m] | _lcm;
# Preserve integer accuracy as much as the implementation of jq allows
def power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);
def is_prime:
. as $n
| if ($n < 2) then false
elif ($n % 2 == 0) then $n == 2
elif ($n % 3 == 0) then $n == 3
elif ($n % 5 == 0) then $n == 5
elif ($n % 7 == 0) then $n == 7
elif ($n % 11 == 0) then $n == 11
elif ($n % 13 == 0) then $n == 13
elif ($n % 17 == 0) then $n == 17
elif ($n % 19 == 0) then $n == 19
else sqrt as $s
| 23
| until( . > $s or ($n % . == 0); . + 2)
| . > $s
end;
# Emit an array of the prime factors of . in order using a wheel with basis [2, 3, 5]
# e.g. 44 | primeFactors => [2,2,11]
def primeFactors:
def out($i): until (.n % $i != 0; .factors += [$i] | .n = ((.n/$i)|floor) );
if . < 2 then []
else [4, 2, 4, 2, 4, 6, 2, 6] as $inc
| { n: .,
factors: [] }
| out(2)
| out(3)
| out(5)
| .k = 7
| .i = 0
| until(.k * .k > .n;
if .n % .k == 0
then .factors += [.k]
| .n = ((.n/.k)|floor)
else .k += $inc[.i]
| .i = ((.i + 1) % 8)
end)
| if .n > 1 then .factors += [ .n ] else . end
| .factors
end;
# Calculate the Pisano period of . from first principles.
def pisanoPeriod:
. as $m
| {p: 0, c: 1}
| first(foreach range(0; $m*$m) as $i (.;
.p as $t
| .p = .c
| .c = ($t + .c) % $m;
select(.p == 0 and .c == 1) | $i + 1
)) // 1;
# Calculate the Pisano period of $p^$k where $p is prime and $k is a positive integer.
def pisanoPrime($p; $k):
$p
| if (is_prime|not) or $k == 0 then 0 # no can do
else ( power($k-1) * pisanoPeriod )
end;
# Calculate the Pisano period of . using pisanoPrime/2.
def pisano:
. as $m
| (reduce primeFactors[] as $p ({}; .[$p|tostring] += 1)
| to_entries | map([(.key|tonumber), .value]) ) as $primePowers
| (reduce $primePowers[] as [$p, $n] ([];
. + [ pisanoPrime($p;$n) ] ) ) as $pps
| ($pps|length) as $ppsl
| if $ppsl == 0 then 1
elif $ppsl == 1 then $pps[0]
else {f: $pps[0], i: 1}
| until(.i >= $ppsl;
.f = lcm(.f; $pps[.i])
| .i += 1)
| .f
end;
def examples:
(range( 2; 15)
| pisanoPrime(.; 2) as $pp
| select($pp > 0)
| "pisanoPrime(\(.); 2) = \($pp)" ),
"",
(range( 2; 180)
| pisanoPrime(.; 1) as $pp
| select($pp > 0)
| "pisanoPrime(\(.);1) = \($pp)" )
;
examples,
"\npisano(n) for integers 'n' from 1 to 180 are:",
( [range(1; 181) | pisano ]
| _nwise(15)
| map(lpad(3))
| join(" "))
</syntaxhighlight>
{{output}}
<pre style="height:20lh;overflow:auto>
pisanoPrime(2; 2) = 6
pisanoPrime(3; 2) = 24
pisanoPrime(5; 2) = 100
pisanoPrime(7; 2) = 112
pisanoPrime(11; 2) = 110
pisanoPrime(13; 2) = 364
pisanoPrime(2;1) = 3
pisanoPrime(3;1) = 8
pisanoPrime(5;1) = 20
pisanoPrime(7;1) = 16
pisanoPrime(11;1) = 10
pisanoPrime(13;1) = 28
pisanoPrime(17;1) = 36
pisanoPrime(19;1) = 18
pisanoPrime(23;1) = 48
pisanoPrime(29;1) = 14
pisanoPrime(31;1) = 30
pisanoPrime(37;1) = 76
pisanoPrime(41;1) = 40
pisanoPrime(43;1) = 88
pisanoPrime(47;1) = 32
pisanoPrime(53;1) = 108
pisanoPrime(59;1) = 58
pisanoPrime(61;1) = 60
pisanoPrime(67;1) = 136
pisanoPrime(71;1) = 70
pisanoPrime(73;1) = 148
pisanoPrime(79;1) = 78
pisanoPrime(83;1) = 168
pisanoPrime(89;1) = 44
pisanoPrime(97;1) = 196
pisanoPrime(101;1) = 50
pisanoPrime(103;1) = 208
pisanoPrime(107;1) = 72
pisanoPrime(109;1) = 108
pisanoPrime(113;1) = 76
pisanoPrime(127;1) = 256
pisanoPrime(131;1) = 130
pisanoPrime(137;1) = 276
pisanoPrime(139;1) = 46
pisanoPrime(149;1) = 148
pisanoPrime(151;1) = 50
pisanoPrime(157;1) = 316
pisanoPrime(163;1) = 328
pisanoPrime(167;1) = 336
pisanoPrime(173;1) = 348
pisanoPrime(179;1) = 178
pisano(n) for integers 'n' from 1 to 180 are:
1 3 8 6 20 24 16 12 24 60 10 24 28 48 40
24 36 24 18 60 16 30 48 24 100 84 72 48 14 120
30 48 40 36 80 24 76 18 56 60 40 48 88 30 120
48 32 24 112 300 72 84 108 72 20 48 72 42 58 120
60 30 48 96 140 120 136 36 48 240 70 24 148 228 200
18 80 168 78 120 216 120 168 48 180 264 56 60 44 120
112 48 120 96 180 48 196 336 120 300 50 72 208 84 80
108 72 72 108 60 152 48 76 72 240 42 168 174 144 120
110 60 40 30 500 48 256 192 88 420 130 120 144 408 360
36 276 48 46 240 32 210 140 24 140 444 112 228 148 600
50 36 72 240 60 168 316 78 216 240 48 216 328 120 40
168 336 48 364 180 72 264 348 168 400 120 232 132 178 120
</pre>
Line 1,238 ⟶ 1,852:
println("\nPisano(n) using pisanoPrime for n from 2 to 180:\n", [pisanotask(i) for i in 2:180])
</syntaxhighlight>{{out}}
<pre style="height:20lh;overflow:auto>
pisanoPrime(2, 2) = 6
pisanoPrime(3, 2) = 24
Line 1,293 ⟶ 1,907:
[3, 8, 6, 20, 24, 16, 12, 24, 60, 10, 24, 28, 48, 40, 24, 36, 24, 18, 60, 16, 30, 48, 24, 100, 84, 72, 48, 14, 120, 30, 48, 40, 36, 80, 24, 76, 18, 56, 60, 40, 48, 88, 30, 120, 48, 32, 24, 112, 300, 72, 84, 108, 72, 20, 48, 72, 42, 58, 120, 60, 30, 48, 96, 140, 120, 136, 36, 48, 240, 70, 24, 148, 228, 200, 18, 80, 168, 78, 120, 216, 120, 168, 48, 180, 264, 56, 60, 44, 120, 112, 48, 120, 96, 180, 48, 196, 336, 120, 300, 50, 72, 208, 84, 80, 108, 72, 72, 108, 60, 152, 48, 76, 72, 240, 42, 168, 174, 144, 120, 110, 60, 40, 30, 500, 48, 256, 192, 88, 420, 130, 120, 144, 408, 360, 36, 276, 48, 46, 240, 32, 210, 140, 24, 140, 444, 112, 228, 148, 600, 50, 36, 72, 240, 60, 168, 316, 78, 216, 240, 48, 216, 328, 120, 40, 168, 336, 48, 364, 180, 72, 264, 348, 168, 400, 120, 232, 132, 178, 120]
</pre>
=={{header|Lua}}==
{{Trans|ALGOL 68}}
<syntaxhighlight lang="lua">
do -- find the Pisano period of some primes and composites
local maxNumber = 180
-- sieve the primes to maxNumber
local isPrime = {}
for i = 1, maxNumber do isPrime[ i ] = i % 2 ~= 0 end
isPrime[ 1 ] = false
isPrime[ 2 ] = true
for s = 3, math.floor( math.sqrt( maxNumber ) ), 2 do
if isPrime[ s ] then
for p = s * s, maxNumber, s do isPrime[ p ] = false end
end
end
local function pisano( m ) -- returns the Pisano period of m
local p, c = 0, 1
for i = 0, ( m * m ) - 1 do
p, c = c, ( p + c ) % m
if p == 0 and c == 1 then return i + 1 end
end
return 1
end
-- returns the Pisano period of p^k or 0 if p is not prime or k < 1
local function pisanoPrime( p, k )
return ( not isPrime[ p ] or k < 1 ) and 0 or math.floor( p ^ ( k - 1 ) * pisano( p ) )
end
local function d4( n ) -- returns n formatted in 4 characcters
return string.format( "%4d", n )
end
io.write( "Pisano period of p^2 where p is a prime < 15:\n" )
for p = 1, 15 do
if isPrime[ p ] then io.write( " "..p..":"..pisanoPrime( p, 2 ) ) end
end
io.write( "\nPisano period of primes up to 180, non-primes shown as \"*\":\n" )
for p = 1, 180 do
io.write( not isPrime[ p ] and " *" or d4( pisanoPrime( p, 1 ) ) )
if p % 10 == 0 then io.write( "\n" ) end
end
io.write( "\nPisano period of positive integers up to 180:\n" )
for n = 1, 180 do
io.write( d4( pisano( n ) ) )
if n % 10 == 0 then io.write( "\n" ) end
end
end
</syntaxhighlight>
{{out}}
<pre>
Pisano period of p^2 where p is a prime < 15:
2:6 3:24 5:100 7:112 11:110 13:364
Pisano period of primes up to 180, non-primes shown as "*":
* 3 8 * 20 * 16 * * *
10 * 28 * * * 36 * 18 *
* * 48 * * * * * 14 *
30 * * * * * 76 * * *
40 * 88 * * * 32 * * *
* * 108 * * * * * 58 *
60 * * * * * 136 * * *
70 * 148 * * * * * 78 *
* * 168 * * * * * 44 *
* * * * * * 196 * * *
50 * 208 * * * 72 * 108 *
* * 76 * * * * * * *
* * * * * * 256 * * *
130 * * * * * 276 * 46 *
* * * * * * * * 148 *
50 * * * * * 316 * * *
* * 328 * * * 336 * * *
* * 348 * * * * * 178 *
Pisano period of positive integers up to 180:
1 3 8 6 20 24 16 12 24 60
10 24 28 48 40 24 36 24 18 60
16 30 48 24 100 84 72 48 14 120
30 48 40 36 80 24 76 18 56 60
40 48 88 30 120 48 32 24 112 300
72 84 108 72 20 48 72 42 58 120
60 30 48 96 140 120 136 36 48 240
70 24 148 228 200 18 80 168 78 120
216 120 168 48 180 264 56 60 44 120
112 48 120 96 180 48 196 336 120 300
50 72 208 84 80 108 72 72 108 60
152 48 76 72 240 42 168 174 144 120
110 60 40 30 500 48 256 192 88 420
130 120 144 408 360 36 276 48 46 240
32 210 140 24 140 444 112 228 148 600
50 36 72 240 60 168 316 78 216 240
48 216 328 120 40 168 336 48 364 180
72 264 348 168 400 120 232 132 178 120
</pre>
=={{header|Mathematica}}/{{header|Wolfram Language}}==
{{trans|Julia}}
<syntaxhighlight>
ClearAll["Global`*"];
pisanos = <||>;
pisano[p_] := Module[{lastn, n, i}, If[p < 2, Return[1]];
i = pisanos[p];
If[i > 0, Return[i]];
lastn = 0; n = 1;
For[i = 1, i <= p^2, i++, {lastn, n} = {n, Mod[lastn + n, p]};
If[lastn == 0 && n == 1, pisanos[p] = i;
Return[i]]];
Return[1]]
pisanoprime[p_, k_] := Module[{}, Assert[PrimeQ[p]];
p^(k - 1)*pisano[p]]
pisanotask[n_] := Module[{factors}, factors = FactorInteger[n];
Map[pisanoprime[#[[1]], #[[2]]] &, factors] // Apply[LCM, #] &]
Do[If[PrimeQ[i],
Print["pisanoPrime[", i, ", 2] = ", pisanoprime[i, 2]]], {i, 1, 15}]
Do[If[PrimeQ[i],
Print["pisanoPrime[", i, ", 1] = ", pisanoprime[i, 1]]], {i, 1, 180}]
Print["\nPisano[n] for n from 2 to 180:"];
Print[Table[pisano[i], {i, 2, 180}]]
Print["\nPisano[n] using pisanoPrime for n from 2 to 180:"];
Print[Table[pisanotask[i], {i, 2, 180}]]
</syntaxhighlight>
{{out}}
<pre>
pisanoPrime[2, 2] = 6
pisanoPrime[3, 2] = 24
pisanoPrime[5, 2] = 100
pisanoPrime[7, 2] = 112
pisanoPrime[11, 2] = 110
pisanoPrime[13, 2] = 364
pisanoPrime[2, 1] = 3
pisanoPrime[3, 1] = 8
pisanoPrime[5, 1] = 20
pisanoPrime[7, 1] = 16
pisanoPrime[11, 1] = 10
pisanoPrime[13, 1] = 28
pisanoPrime[17, 1] = 36
pisanoPrime[19, 1] = 18
pisanoPrime[23, 1] = 48
pisanoPrime[29, 1] = 14
pisanoPrime[31, 1] = 30
pisanoPrime[37, 1] = 76
pisanoPrime[41, 1] = 40
pisanoPrime[43, 1] = 88
pisanoPrime[47, 1] = 32
pisanoPrime[53, 1] = 108
pisanoPrime[59, 1] = 58
pisanoPrime[61, 1] = 60
pisanoPrime[67, 1] = 136
pisanoPrime[71, 1] = 70
pisanoPrime[73, 1] = 148
pisanoPrime[79, 1] = 78
pisanoPrime[83, 1] = 168
pisanoPrime[89, 1] = 44
pisanoPrime[97, 1] = 196
pisanoPrime[101, 1] = 50
pisanoPrime[103, 1] = 208
pisanoPrime[107, 1] = 72
pisanoPrime[109, 1] = 108
pisanoPrime[113, 1] = 76
pisanoPrime[127, 1] = 256
pisanoPrime[131, 1] = 130
pisanoPrime[137, 1] = 276
pisanoPrime[139, 1] = 46
pisanoPrime[149, 1] = 148
pisanoPrime[151, 1] = 50
pisanoPrime[157, 1] = 316
pisanoPrime[163, 1] = 328
pisanoPrime[167, 1] = 336
pisanoPrime[173, 1] = 348
pisanoPrime[179, 1] = 178
Pisano[n] for n from 2 to 180:
{3, 8, 6, 20, 24, 16, 12, 24, 60, 10, 24, 28, 48, 40, 24, 36, 24, 18, 60, 16, 30, 48, 24, 100, 84, 72, 48, 14, 120, 30, 48, 40, 36, 80, 24, 76, 18, 56, 60, 40, 48, 88, 30, 120, 48, 32, 24, 112, 300, 72, 84, 108, 72, 20, 48, 72, 42, 58, 120, 60, 30, 48, 96, 140, 120, 136, 36, 48, 240, 70, 24, 148, 228, 200, 18, 80, 168, 78, 120, 216, 120, 168, 48, 180, 264, 56, 60, 44, 120, 112, 48, 120, 96, 180, 48, 196, 336, 120, 300, 50, 72, 208, 84, 80, 108, 72, 72, 108, 60, 152, 48, 76, 72, 240, 42, 168, 174, 144, 120, 110, 60, 40, 30, 500, 48, 256, 192, 88, 420, 130, 120, 144, 408, 360, 36, 276, 48, 46, 240, 32, 210, 140, 24, 140, 444, 112, 228, 148, 600, 50, 36, 72, 240, 60, 168, 316, 78, 216, 240, 48, 216, 328, 120, 40, 168, 336, 48, 364, 180, 72, 264, 348, 168, 400, 120, 232, 132, 178, 120}
Pisano[n] using pisanoPrime for n from 2 to 180:
{3, 8, 6, 20, 24, 16, 12, 24, 60, 10, 24, 28, 48, 40, 24, 36, 24, 18, 60, 16, 30, 48, 24, 100, 84, 72, 48, 14, 120, 30, 48, 40, 36, 80, 24, 76, 18, 56, 60, 40, 48, 88, 30, 120, 48, 32, 24, 112, 300, 72, 84, 108, 72, 20, 48, 72, 42, 58, 120, 60, 30, 48, 96, 140, 120, 136, 36, 48, 240, 70, 24, 148, 228, 200, 18, 80, 168, 78, 120, 216, 120, 168, 48, 180, 264, 56, 60, 44, 120, 112, 48, 120, 96, 180, 48, 196, 336, 120, 300, 50, 72, 208, 84, 80, 108, 72, 72, 108, 60, 152, 48, 76, 72, 240, 42, 168, 174, 144, 120, 110, 60, 40, 30, 500, 48, 256, 192, 88, 420, 130, 120, 144, 408, 360, 36, 276, 48, 46, 240, 32, 210, 140, 24, 140, 444, 112, 228, 148, 600, 50, 36, 72, 240, 60, 168, 316, 78, 216, 240, 48, 216, 328, 120, 40, 168, 336, 48, 364, 180, 72, 264, 348, 168, 400, 120, 232, 132, 178, 120}
</pre>
=={{header|Nim}}==
Line 1,431 ⟶ 2,235:
50 36 72 240 60 168 316 78 216 240 48 216 328 120 40
168 336 48 364 180 72 264 348 168 400 120 232 132 178 120</pre>
=={{header|PARI/GP}}==
{{trans|Mathematica/Wolfram_Language}}
<syntaxhighlight lang="PARI/GP">
\\ Initialize an associative array equivalently
pisanos = Map();
\\ Function to calculate the Pisano period for a given prime p
pisano(p) = {
local(lastn, n, i);
if (p < 2, return(1));
if (mapisdefined(pisanos, p),
return(mapget(pisanos, p));
);
lastn = 0; n = 1;
for (i = 1, p^2,
[lastn, n] = [n, Mod(lastn + n, p)];
if (lastn == 0 && n == 1,
mapput(pisanos, p, i);
return(i);
);
);
return(1);
}
\\ Function to calculate Pisano period for a prime p and a power k
pisanoprime(p, k) = {
my(i = pisano(p));
if (!isprime(p), error("p must be prime"));
p^(k-1) * i;
}
\\ Function to calculate Pisano period for a composite number n
pisanotask(n) = {
my(factors = factor(n));
\\print("factors=" factors);
\\apply(x -> print("x=" x), factors);
lcm( vector(#factors~, i, pisanoprime(factors[i, 1], factors[i, 2])) );
}
{
\\ Print Pisano periods for prime numbers up to 15 with k=2
for (i = 1, 15,
if (isprime(i),
print("pisanoPrime[" i ", 2] = " pisanoprime(i, 2))
);
);
\\ Print Pisano periods for prime numbers up to 180 with k=1
for (i = 1, 180,
if (isprime(i),
print("pisanoPrime[" i ", 1] = " pisanoprime(i, 1))
);
);
\\ Print Pisano periods for numbers 2 to 180
print("\nPisano[n] for n from 2 to 180:");
print(vector(179, i, pisano(i+1)));
\\ Print Pisano periods using pisanotask for numbers 2 to 180
print("\nPisano[n] using pisanoPrime for n from 2 to 180:");
print(vector(179, i, pisanotask(i+1)));
}
</syntaxhighlight>
{{out}}
<pre>
pisanoPrime[2, 2] = 6
pisanoPrime[3, 2] = 24
pisanoPrime[5, 2] = 100
pisanoPrime[7, 2] = 112
pisanoPrime[11, 2] = 110
pisanoPrime[13, 2] = 364
pisanoPrime[2, 1] = 3
pisanoPrime[3, 1] = 8
pisanoPrime[5, 1] = 20
pisanoPrime[7, 1] = 16
pisanoPrime[11, 1] = 10
pisanoPrime[13, 1] = 28
pisanoPrime[17, 1] = 36
pisanoPrime[19, 1] = 18
pisanoPrime[23, 1] = 48
pisanoPrime[29, 1] = 14
pisanoPrime[31, 1] = 30
pisanoPrime[37, 1] = 76
pisanoPrime[41, 1] = 40
pisanoPrime[43, 1] = 88
pisanoPrime[47, 1] = 32
pisanoPrime[53, 1] = 108
pisanoPrime[59, 1] = 58
pisanoPrime[61, 1] = 60
pisanoPrime[67, 1] = 136
pisanoPrime[71, 1] = 70
pisanoPrime[73, 1] = 148
pisanoPrime[79, 1] = 78
pisanoPrime[83, 1] = 168
pisanoPrime[89, 1] = 44
pisanoPrime[97, 1] = 196
pisanoPrime[101, 1] = 50
pisanoPrime[103, 1] = 208
pisanoPrime[107, 1] = 72
pisanoPrime[109, 1] = 108
pisanoPrime[113, 1] = 76
pisanoPrime[127, 1] = 256
pisanoPrime[131, 1] = 130
pisanoPrime[137, 1] = 276
pisanoPrime[139, 1] = 46
pisanoPrime[149, 1] = 148
pisanoPrime[151, 1] = 50
pisanoPrime[157, 1] = 316
pisanoPrime[163, 1] = 328
pisanoPrime[167, 1] = 336
pisanoPrime[173, 1] = 348
pisanoPrime[179, 1] = 178
Pisano[n] for n from 2 to 180:
[3, 8, 6, 20, 24, 16, 12, 24, 60, 10, 24, 28, 48, 40, 24, 36, 24, 18, 60, 16, 30, 48, 24, 100, 84, 72, 48, 14, 120, 30, 48, 40, 36, 80, 24, 76, 18, 56, 60, 40, 48, 88, 30, 120, 48, 32, 24, 112, 300, 72, 84, 108, 72, 20, 48, 72, 42, 58, 120, 60, 30, 48, 96, 140, 120, 136, 36, 48, 240, 70, 24, 148, 228, 200, 18, 80, 168, 78, 120, 216, 120, 168, 48, 180, 264, 56, 60, 44, 120, 112, 48, 120, 96, 180, 48, 196, 336, 120, 300, 50, 72, 208, 84, 80, 108, 72, 72, 108, 60, 152, 48, 76, 72, 240, 42, 168, 174, 144, 120, 110, 60, 40, 30, 500, 48, 256, 192, 88, 420, 130, 120, 144, 408, 360, 36, 276, 48, 46, 240, 32, 210, 140, 24, 140, 444, 112, 228, 148, 600, 50, 36, 72, 240, 60, 168, 316, 78, 216, 240, 48, 216, 328, 120, 40, 168, 336, 48, 364, 180, 72, 264, 348, 168, 400, 120, 232, 132, 178, 120]
Pisano[n] using pisanoPrime for n from 2 to 180:
[3, 8, 6, 20, 24, 16, 12, 24, 60, 10, 24, 28, 48, 40, 24, 36, 24, 18, 60, 16, 30, 48, 24, 100, 84, 72, 48, 14, 120, 30, 48, 40, 36, 80, 24, 76, 18, 56, 60, 40, 48, 88, 30, 120, 48, 32, 24, 112, 300, 72, 84, 108, 72, 20, 48, 72, 42, 58, 120, 60, 30, 48, 96, 140, 120, 136, 36, 48, 240, 70, 24, 148, 228, 200, 18, 80, 168, 78, 120, 216, 120, 168, 48, 180, 264, 56, 60, 44, 120, 112, 48, 120, 96, 180, 48, 196, 336, 120, 300, 50, 72, 208, 84, 80, 108, 72, 72, 108, 60, 152, 48, 76, 72, 240, 42, 168, 174, 144, 120, 110, 60, 40, 30, 500, 48, 256, 192, 88, 420, 130, 120, 144, 408, 360, 36, 276, 48, 46, 240, 32, 210, 140, 24, 140, 444, 112, 228, 148, 600, 50, 36, 72, 240, 60, 168, 316, 78, 216, 240, 48, 216, 328, 120, 40, 168, 336, 48, 364, 180, 72, 264, 348, 168, 400, 120, 232, 132, 178, 120]
</pre>
=={{header|Perl}}==
Line 1,934 ⟶ 2,860:
1: { 1 3 8 6 20 24 16 12 24 60 10 24 28 48 40 24 36 24 18 60 16 30 48 24 100 84 72 48 14 120 30 48 40 36 80 24 76 18 56 60 40 48 88 30 120 48 32 24 112 300 72 84 108 72 20 48 72 42 58 120 60 30 48 96 140 120 136 36 48 240 70 24 148 228 200 18 80 168 78 120 216 120 168 48 180 264 56 60 44 120 112 48 120 96 180 48 196 336 120 300 50 72 208 84 80 108 72 72 108 60 152 48 76 72 240 42 168 174 144 120 110 60 40 30 500 48 256 192 88 420 130 120 144 408 360 36 276 48 46 240 32 210 140 24 140 444 112 228 148 600 50 36 72 240 60 168 316 78 216 240 48 216 328 120 40 168 336 48 364 180 72 264 348 168 400 120 232 132 178 120 }
</pre>
=={{header|SETL}}==
<syntaxhighlight lang="setl">program pisano_period;
loop for p in [2..15] | prime p do
print("pisanoPrime(" + lpad(str p,3) + ", 2) = "
+ lpad(str pisanoPrime(p,2), 3));
end loop;
print;
loop for p in [2..180] | prime p do
print("pisanoPrime(" + lpad(str p,3) + ", 1) = "
+ lpad(str pisanoPrime(p,1), 3));
end loop;
print;
print("pisano(n) for integers 'n' from 1 to 180 are:");
loop for n in [1..180] do
nprint(lpad(str pisano n,4));
if (col +:= 1) mod 15 = 0 then print; end if;
end loop;
op gcd(a, b);
return {[0, a]}(b) ? (b gcd (a mod b));
end op;
op lcm(a, b);
return a div (a gcd b) * b;
end op;
op factors(n);
d := 2;
f := {};
loop while d <= n do
loop while n mod d=0 do
f(d) +:= 1;
n div:= d;
end loop;
d +:= 1;
end loop;
return f;
end op;
op prime(n);
if n<=4 then return n in {2,3}; end if;
if n mod 2=0 then return n=2; end if;
if n mod 3=0 then return n=3; end if;
d := 5;
loop while d*d <= n do
if n mod d=0 then return false; end if;
d +:= 2;
if n mod d=0 then return false; end if;
d +:= 4;
end loop;
return true;
end op;
op pisanoPeriod(n);
[p, c, i] := [0, 1, 0];
loop while i < n*n do
[p, c] := [c, (p+c) mod n];
i +:= 1;
if p=0 and c=1 then return i; end if;
end loop;
return 1;
end op;
proc pisanoPrime(p, k);
return if not prime p or k=0
then om
else p**(k-1) * pisanoPeriod p
end;
end proc;
op pisano(m);
primePowers := factors m;
pps := [pisanoPrime(p, k) : k = primePowers(p)];
if #pps = 0 then return 1; end if;
if #pps = 1 then return pps(1); end if;
return lcm/pps;
end op;
end program;</syntaxhighlight>
{{out}}
<pre>pisanoPrime( 2, 2) = 6
pisanoPrime( 3, 2) = 24
pisanoPrime( 5, 2) = 100
pisanoPrime( 7, 2) = 112
pisanoPrime( 11, 2) = 110
pisanoPrime( 13, 2) = 364
pisanoPrime( 2, 1) = 3
pisanoPrime( 3, 1) = 8
pisanoPrime( 5, 1) = 20
pisanoPrime( 7, 1) = 16
pisanoPrime( 11, 1) = 10
pisanoPrime( 13, 1) = 28
pisanoPrime( 17, 1) = 36
pisanoPrime( 19, 1) = 18
pisanoPrime( 23, 1) = 48
pisanoPrime( 29, 1) = 14
pisanoPrime( 31, 1) = 30
pisanoPrime( 37, 1) = 76
pisanoPrime( 41, 1) = 40
pisanoPrime( 43, 1) = 88
pisanoPrime( 47, 1) = 32
pisanoPrime( 53, 1) = 108
pisanoPrime( 59, 1) = 58
pisanoPrime( 61, 1) = 60
pisanoPrime( 67, 1) = 136
pisanoPrime( 71, 1) = 70
pisanoPrime( 73, 1) = 148
pisanoPrime( 79, 1) = 78
pisanoPrime( 83, 1) = 168
pisanoPrime( 89, 1) = 44
pisanoPrime( 97, 1) = 196
pisanoPrime(101, 1) = 50
pisanoPrime(103, 1) = 208
pisanoPrime(107, 1) = 72
pisanoPrime(109, 1) = 108
pisanoPrime(113, 1) = 76
pisanoPrime(127, 1) = 256
pisanoPrime(131, 1) = 130
pisanoPrime(137, 1) = 276
pisanoPrime(139, 1) = 46
pisanoPrime(149, 1) = 148
pisanoPrime(151, 1) = 50
pisanoPrime(157, 1) = 316
pisanoPrime(163, 1) = 328
pisanoPrime(167, 1) = 336
pisanoPrime(173, 1) = 348
pisanoPrime(179, 1) = 178
pisano(n) for integers 'n' from 1 to 180 are:
1 3 8 6 20 24 16 12 24 60 10 24 28 48 40
24 36 24 18 60 16 30 48 24 100 84 72 48 14 120
30 48 40 36 80 24 76 18 56 60 40 48 88 30 120
48 32 24 112 300 72 84 108 72 20 48 72 42 58 120
60 30 48 96 140 120 136 36 48 240 70 24 148 228 200
18 80 168 78 120 216 120 168 48 180 264 56 60 44 120
112 48 120 96 180 48 196 336 120 300 50 72 208 84 80
108 72 72 108 60 152 48 76 72 240 42 168 174 144 120
110 60 40 30 500 48 256 192 88 420 130 120 144 408 360
36 276 48 46 240 32 210 140 24 140 444 112 228 148 600
50 36 72 240 60 168 316 78 216 240 48 216 328 120 40
168 336 48 364 180 72 264 348 168 400 120 232 132 178 120</pre>
=={{header|Sidef}}==
Line 2,012 ⟶ 3,082:
{{libheader|Wren-math}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="
import "./fmt" for Fmt
// Calculates the Pisano period of 'm' from first principles.
| |||