Comments on Determine whether an integer is square-free
Parent
Determine whether an integer is square-free
An integer is called square-free if it is not a multiple of a perfect square other than 1. For example, 42 is square-free, but 44 is not because it is a multiple of the perfect square 4 = 2².
Your task is to write a program or function that takes a positive integer, and returns a truthy value if the integer is square-free and a falsey value otherwise.
This is code golf, the shortest code wins.
The square-free numbers are OEIS sequence A005117 (thanks to Razetime for pointing this out).
Some test cases:
1 true
2 true
3 true
4 false
5 true
6 true
7 true
8 false
9 false
10 true
12 false
14 true
16 false
18 false
20 false
30 true
40 false
50 false
100 false
110 true
111 true
Vyxal, 4 bytes ``` K∆²a ``` …
3y ago
Python3, 39 bytes ```python …
3y ago
Scala, 41 bytes ```scala x=> …
3y ago
Ruby, 27 bytes ```ruby ->n …
3y ago
Japt, 5 bytes k eU …
2y ago
Myby, 12 5 bytes ``` primf=p …
2y ago
J, 7 char ``` ./:q: ``` …
2y ago
MATL, 6 bytes ``` YftuX= `` …
2y ago
J, 17 bytes ```J {{./y|:2+ …
2y ago
BQN, 13 bytesSBCS ```none ∧´ …
3y ago
JavaScript, 31 bytes Output …
2y ago
Factor, 108 bytes ``` USIN …
2y ago
Japt, 6 bytes -1 byte thank …
2y ago
Post
2 comment threads