Square-free integers: Difference between revisions

{{draft task}}

;Task:

Write a function to test if a number is   ''square-free''.

A   ''square-free''   is an integer which is divisible by no perfect square other

::*   '''1'''   ───►   '''145'''     (inclusive)

::*   '''1''' trillion   ───►   '''1''' trillion + '''145'''     (inclusive)

(One trillion = 1,000,000,000,000)

Show here (on this page) the count of square-free integers from:

::*   '''1'''   ───►   one hundred thousand     (inclusive)

::*   '''1'''   ───►   one million     (inclusive)

;See also:

=={{header|C}}==

{{trans|Go}}

<lang c>#include <stdio.h>

#include <stdlib.h>

return 0;

}</lang>

{{out}}

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

from 1 to 10000 = 6083

from 1 to 100000 = 60794

=={{header|Factor}}==

2 6 [a,b] [ 10 swap ^ ] map [ sq-free-count ] each ! part 2</lang>

{{out}}

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

6083 square-free integers from 1 to 10000

60794 square-free integers from 1 to 100000

=={{header|Go}}==

<lang go>package main

fmt.Printf(" from %d to %d = %d\n", 1, 1000000, len(squareFree(1, 1000000)))

}</lang>

{{out}}

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

from 1 to 10000 = 6083

from 1 to 100000 = 60794

=={{header|Java}}==

{{trans|Go}}

<lang java>import java.util.ArrayList;

}

}</lang>

{{out}}

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

from 1 to 10000 = 6083

from 1 to 100000 = 60794

{{trans|Go}}

<lang scala>// Version 1.2.50

System.out.printf(" from %d to %d = %d\n", 1, 1000000, squareFree(1, 1000000).size)

}</lang>

{{out}}

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

from 1 to 10000 = 6083

from 1 to 100000 = 60794

=={{header|Perl 6}}==

This REXX program makes use of &nbsp; '''linesize''' &nbsp; REXX program (or BIF) &nbsp; which is used to determine the screen width (or linesize) of the terminal (console); &nbsp; not all REXXes have this BIF.

{{out|output|text=&nbsp; when using the default input:}}

(Shown at three-quarter size.)

{{out|output|text=&nbsp; when using the input of: &nbsp; &nbsp; <tt> 1000000000000 &nbsp; 1000000000145 </tt>}}

1000000000099 1000000000101 1000000000102 1000000000103 1000000000105 1000000000106 1000000000109 1000000000111 1000000000113 1000000000114

1000000000115 1000000000117 1000000000118 1000000000119 1000000000121 1000000000122 1000000000123 1000000000126 1000000000127 1000000000129

{{out|output|text=&nbsp; when using the (separate runs) inputs of: &nbsp; &nbsp; <tt> 1 &nbsp; -100 </tt> &nbsp; (and others)

The number of square─free numbers between 1 and 1000 (inclusive) is: 608

The number of square─free numbers between 1 and 100000 (inclusive) is: 60794

=={{header|zkl}}==

1000000000122 1000000000123 1000000000126 1000000000127 1000000000129

1000000000130 1000000000133 1000000000135 1000000000137 1000000000138

<lang zkl>n:=100; do(5){

}</lang>

{{out}}

608 square-free integers from 1 to 1,000

6,083 square-free integers from 1 to 10,000

60,794 square-free integers from 1 to 100,000