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
than   1   (unity).

For this task, only positive square-free numbers will be used.



Show here (on this page) all square-free integers (in a horizontal format) that are between:

   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     (inclusive)
   1   ───►   one thousand     (inclusive)
   1   ───►   ten thousand     (inclusive)
   1   ───►   one hundred thousand     (inclusive)
   1   ───►   one million     (inclusive)


See also

   the Wikipedia entry:   square-free integer


F SquareFree(_number)
   V max = Int(sqrt(_number))
 
   L(root) 2 .. max
      I 0 == _number % (Int64(root) ^ 2)
         R 0B
 
   R 1B
 
F ListSquareFrees(Int64 _start, Int64 _end)
   V count = 0
   L(i) _start .. _end
      I SquareFree(i)
         print(i"\t", end' ‘’)
         I count % 5 == 4
            print()
         count++
 
   print("\n\nTotal count of square-free numbers between #. and #.: #.".format(_start, _end, count))
 
ListSquareFrees(1, 100)
ListSquareFrees(1000000000000, 1000000000145)