Timeline for answer to Is this number a prime? by Axuary
Current License: CC BY-SA 4.0
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2024 at 18:17 | comment | added | General Grievance |
For the second: A2^.5 is shorter.
|
|
| Feb 4, 2022 at 0:02 | comment | added | Taylor Raine |
Oh that's a good catch there - in that case the only improvement I can think of is pretty boring - -SUM(-(MOD(A1,SEQUENCE(A1))<1))=2 for 33 bytes
|
|
| Feb 3, 2022 at 23:41 | comment | added | Axuary |
I like the idea but SEQUENCE(A1-2,,2) breaks for A1 < 3.
|
|
| Feb 3, 2022 at 22:35 | comment | added | Taylor Raine |
I think that =AND(MOD(A1,SEQUENCE(A1-2,,2))>0) should work for 33 bytes - basically, invert the logic and search only the range from 0...n-1 for divisors
|
|
| Feb 1, 2022 at 13:04 | history | answered | Axuary | CC BY-SA 4.0 |