Factorions: Difference between revisions
Content added Content deleted
m (→{{header|Pascal}}: added decimal output) |
(R) |
||
Line 385: | Line 385: | ||
end.</lang> |
end.</lang> |
||
=={{header|F_Sharp|F#}}== |
|||
<lang fsharp |
|||
// Factorians. Nigel Galloway: October 22nd., 2021 |
|||
let N=[|let mutable n=1 in yield n; for g in 1..11 do n<-n*g; yield n|] |
|||
let fG n g=let rec fN g=function i when i<n->g+N.[i] |i->fN(g+N.[i%n])(i/n) in fN 0 g |
|||
{9..12}|>Seq.iter(fun n->printf $"In base %d{n} Factorians are:"; {1..1500000}|>Seq.iter(fun g->if g=fG n g then printf $" %d{g}"); printfn "") |
|||
</lang> |
|||
{{out}} |
|||
<pre>In base 9 Factorians are: 1 2 41282 |
|||
In base 10 Factorians are: 1 2 145 40585 |
|||
In base 11 Factorians are: 1 2 26 48 40472 |
|||
In base 12 Factorians are: 1 2 |
|||
</pre> |
|||
=={{header|Factor}}== |
=={{header|Factor}}== |
||
<lang factor>USING: formatting io kernel math math.parser math.ranges memoize |
<lang factor>USING: formatting io kernel math math.parser math.ranges memoize |