First 9 prime Fibonacci number: Difference between revisions
Content added Content deleted
Not a robot (talk | contribs) (add Miranda) |
Not a robot (talk | contribs) (Add Refal) |
||
Line 1,625: | Line 1,625: | ||
20: 36684474316080978061473613646275630451100586901195229815270242868417768061193560857904335017879540515228143777781065869</pre> |
20: 36684474316080978061473613646275630451100586901195229815270242868417768061193560857904335017879540515228143777781065869</pre> |
||
=={{header|Refal}}== |
|||
<syntaxhighlight lang="refal">$ENTRY Go { |
|||
= <Prout <Gen 9 Prime Fibo (1 1)>>; |
|||
} |
|||
Gen { |
|||
0 s.Filter s.Gen (e.State) = ; |
|||
s.N s.Filter s.Gen (e.State), |
|||
<Mu s.Gen (e.State)>: (e.Next) e.Val, |
|||
<Mu s.Filter e.Val>: { |
|||
True = e.Val <Gen <- s.N 1> s.Filter s.Gen (e.Next)>; |
|||
False = <Gen s.N s.Filter s.Gen (e.Next)>; |
|||
}; |
|||
}; |
|||
Fibo { |
|||
(s.A s.B) = (s.B <+ s.A s.B>) s.A; |
|||
}; |
|||
Prime { |
|||
0 = False; 1 = False; |
|||
2 = True; 3 = True; |
|||
s.N, <Mod s.N 2>: 0 = False; |
|||
s.N, <Mod s.N 3>: 0 = False; |
|||
s.N = <Prime1 s.N 5>; |
|||
}; |
|||
Prime1 { |
|||
s.N s.D, <Compare s.N <* s.D s.D>>: '-' = True; |
|||
s.N s.D, <Mod s.N s.D>: 0 = False; |
|||
s.N s.D = <Prime1 s.N <+ 2 s.D>>; |
|||
};</syntaxhighlight> |
|||
{{out}} |
|||
<pre>2 3 5 13 89 233 1597 28657 514229</pre> |
|||
=={{header|Ring}}== |
=={{header|Ring}}== |
||
<syntaxhighlight lang="ring"> |
<syntaxhighlight lang="ring"> |