Jump to content

Square-free integers: Difference between revisions

m
→‎{{header|ALGOL 68}}: Fix comment (again...)
m (→‎{{header|ALGOL 68}}: Fix comment (again...))
Line 35:
<lang algol68>BEGIN
# count/show some square free numbers #
# a number ifis square free isif not divisible by any square and so not divisible #
# by any squared prime #
# to satisfy the task we need to know the primes up to root 1 000 000 000 145 #
3,049

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.