Mertens function: Difference between revisions

Added 11l
(Add Modula-2)
(Added 11l)
Line 32:
:* [[Möbius function]]
<br><br>
 
=={{header|11l}}==
{{trans|Python}}
 
<lang 11l>F mertens(count)
‘Generate Mertens numbers’
V m = [-1, 1]
L(n) 2 .. count
m.append(1)
L(k) 2 .. n
m[n] -= m[n I/ k]
R m
 
V ms = mertens(1000)
 
print(‘The first 99 Mertens numbers are:’)
print(‘ ’, end' ‘ ’)
V col = 1
L(n) ms[1.<100]
print(‘#2’.format(n), end' ‘ ’)
col++
I col == 10
print()
col = 0
 
V zeroes = sum(ms.map(x -> Int(x == 0)))
V crosses = sum(zip(ms, ms[1..]).map((a, b) -> Int(a != 0 & b == 0)))
print(‘M(N) equals zero #. times.’.format(zeroes))
print(‘M(N) crosses zero #. times.’.format(crosses))</lang>
 
{{out}}
<pre>
The first 99 Mertens numbers are:
1 0 -1 -1 -2 -1 -2 -2 -2
-1 -2 -2 -3 -2 -1 -1 -2 -2 -3
-3 -2 -1 -2 -2 -2 -1 -1 -1 -2
-3 -4 -4 -3 -2 -1 -1 -2 -1 0
0 -1 -2 -3 -3 -3 -2 -3 -3 -3
-3 -2 -2 -3 -3 -2 -2 -1 0 -1
-1 -2 -1 -1 -1 0 -1 -2 -2 -1
-2 -3 -3 -4 -3 -3 -3 -2 -3 -4
-4 -4 -3 -4 -4 -3 -2 -1 -1 -2
-2 -1 -1 0 1 2 2 1 1 1
M(N) equals zero 92 times.
M(N) crosses zero 59 times.
</pre>
 
=={{header|8080 Assembly}}==
Line 249 ⟶ 295:
M(N) is zero 92 times.
M(N) crosses zero 59 times.</pre>
 
 
=={{header|8086 Assembly}}==
1,481

edits