Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

Post History

81%
+7 −0
Challenges 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...

13 answers  ·  posted 3y ago by celtschk‭  ·  last activity 2y ago by Shaggy‭

#2: Post edited by user avatar celtschk‭ · 2022-01-05T16:52:25Z (almost 3 years ago)
Added reference to OEIS and test cases
  • 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.
  • 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 <a href="https://oeis.org/A005117">A005117</a> (thanks to [Razetime][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
  • ```
  • [Razetime]: https://codegolf.codidact.com/users/53310
#1: Initial revision by user avatar celtschk‭ · 2022-01-05T15:22:31Z (almost 3 years ago)
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.