Square-free integers: Difference between revisions
Content deleted Content added
Line 979: | Line 979: | ||
The number of square─free numbers between 1 and 1000000 (inclusive) is: 607926</pre> |
The number of square─free numbers between 1 and 1000000 (inclusive) is: 607926</pre> |
||
=={{header|Phix}}== |
|||
<lang Phix>function square_free(atom start, finish) |
|||
sequence res = {} |
|||
if start=1 then res = {1} start = 2 end if |
|||
while start<=finish do |
|||
sequence pf = prime_factors(start, duplicates:=true) |
|||
for i=2 to length(pf) do |
|||
if pf[i]=pf[i-1] then |
|||
pf = {} |
|||
exit |
|||
end if |
|||
end for |
|||
if pf!={} then |
|||
res &= start |
|||
end if |
|||
start += 1 |
|||
end while |
|||
return res |
|||
end function |
|||
function format_res(sequence res, string fmt) |
|||
for i=1 to length(res) do |
|||
res[i] = sprintf(fmt,res[i]) |
|||
end for |
|||
return res |
|||
end function |
|||
constant ONE_TRILLION = 1_000_000_000_000 |
|||
procedure main() |
|||
sequence res = square_free(1,145) |
|||
printf(1,"There are %d square-free integers from 1 to 145:\n",length(res)) |
|||
puts(1,join_by(format_res(res,"%4d"),1,20,"")) |
|||
res = square_free(ONE_TRILLION,ONE_TRILLION+145) |
|||
printf(1,"\nThere are %d square-free integers from %,d to %,d:\n", |
|||
{length(res),ONE_TRILLION, ONE_TRILLION+145}) |
|||
puts(1,join_by(format_res(res,"%14d"),1,5,"")) |
|||
printf(1,"\nNumber of square-free integers:\n"); |
|||
for i=2 to 6 do |
|||
integer lim = power(10,i), |
|||
len = length(square_free(1,lim)) |
|||
printf(1," from %,d to %,d = %,d\n", {1,lim,len}) |
|||
end for |
|||
end procedure |
|||
main()</lang> |
|||
{{out}} |
|||
<pre> |
|||
There are 90 square-free integers from 1 to 145: |
|||
1 2 3 5 6 7 10 11 13 14 15 17 19 21 22 23 26 29 30 31 |
|||
33 34 35 37 38 39 41 42 43 46 47 51 53 55 57 58 59 61 62 65 |
|||
66 67 69 70 71 73 74 77 78 79 82 83 85 86 87 89 91 93 94 95 |
|||
97 101 102 103 105 106 107 109 110 111 113 114 115 118 119 122 123 127 129 130 |
|||
131 133 134 137 138 139 141 142 143 145 |
|||
There are 89 square-free integers from 1,000,000,000,000 to 1,000,000,000,145: |
|||
1000000000001 1000000000002 1000000000003 1000000000005 1000000000006 |
|||
1000000000007 1000000000009 1000000000011 1000000000013 1000000000014 |
|||
1000000000015 1000000000018 1000000000019 1000000000021 1000000000022 |
|||
1000000000023 1000000000027 1000000000029 1000000000030 1000000000031 |
|||
1000000000033 1000000000037 1000000000038 1000000000039 1000000000041 |
|||
1000000000042 1000000000043 1000000000045 1000000000046 1000000000047 |
|||
1000000000049 1000000000051 1000000000054 1000000000055 1000000000057 |
|||
1000000000058 1000000000059 1000000000061 1000000000063 1000000000065 |
|||
1000000000066 1000000000067 1000000000069 1000000000070 1000000000073 |
|||
1000000000074 1000000000077 1000000000078 1000000000079 1000000000081 |
|||
1000000000082 1000000000085 1000000000086 1000000000087 1000000000090 |
|||
1000000000091 1000000000093 1000000000094 1000000000095 1000000000097 |
|||
1000000000099 1000000000101 1000000000102 1000000000103 1000000000105 |
|||
1000000000106 1000000000109 1000000000111 1000000000113 1000000000114 |
|||
1000000000115 1000000000117 1000000000118 1000000000119 1000000000121 |
|||
1000000000122 1000000000123 1000000000126 1000000000127 1000000000129 |
|||
1000000000130 1000000000133 1000000000135 1000000000137 1000000000138 |
|||
1000000000139 1000000000141 1000000000142 1000000000145 |
|||
Number of square-free integers: |
|||
from 1 to 100 = 61 |
|||
from 1 to 1,000 = 608 |
|||
from 1 to 10,000 = 6,083 |
|||
from 1 to 100,000 = 60,794 |
|||
from 1 to 1,000,000 = 607,926 |
|||
</pre> |
|||
=={{header|Python}}== |
=={{header|Python}}== |