Lah numbers: Difference between revisions

→‎{{header|Python}}: Python 2 -> Python 3; use functions from built-in math module
(Realize in F#)
(→‎{{header|Python}}: Python 2 -> Python 3; use functions from built-in math module)
Line 1,590:
 
=={{header|Python}}==
<syntaxhighlight lang="python">deffrom math import factorial(n):comb,
if n == 0: factorial)
return 1
res = 1
while n > 0:
res *= n
n -= 1
return res
 
 
def lah(n, k):
if k == 1:
return factorial(n)
Line 1,608 ⟶ 1,603:
if k < 1 or n < 1:
return 0
return (factorialcomb(n, k) * factorial(n - 1)) / (factorial(k) */ factorial(k - 1)) / factorial(n - k)
 
 
def main():
print ("Unsigned Lah numbers: L(n, k):")
print ("n/k ", end='\t')
for i in xrangerange(13):
print ("%11d" % i, end='\t')
print()
for row in xrangerange(13):
print ("%-4d" % row, end='\t')
for i in xrangerange(row + 1):
l = lah(row, i)
print ("%11d" % l, end='\t')
print()
print ("\nMaximum value from the L(100, *) row:")
maxValmax_val = max([lah(100, a) for a in xrangerange(100)])
print maxVal(max_val)
 
 
if __name__ == '__main__':
main()</syntaxhighlight>
{{out}}
<pre>Unsigned Lah numbers: L(n, k):
6

edits