Square-free integers: Difference between revisions

m
(→‎{{header|zkl}}: added code)
m (→‎{{header|zkl}}: crunchify)
Line 729:
fcn squareFree(start,end,save=False){ //-->(cnt,list|n)
sink := Sink(if(save) List else Void); // Sink(Void) is one item sink
cnt, numPrimes := 0, (end - start).toFloat().sqrt().toInt() - 1;
foreach in in ([start..end]){
free,n := True,i;
foreach j in ([0..numPrimes]){
p,p2 := primes[j], p*p;
if(p2>in) break;
if(in%p2 == 0){ free=Falsecontinue(2); break; }// -->foreach n
}
if(free){ sink.write(n); cnt+=1 }
}
return(cnt,sink.close());
Anonymous user