A prime checker in Python would go along the lines of:
>>> def isPrime(n):
for x in range(2, n):
if n % x == 0:
return False
else:
# loop fell through without finding a factor
return True
>>> isPrime(3)
True
>>> isPrime(4)
False
But the only things we have in nested structures is a while TOS is nonzero loop, and an if TOS is nonzero construct.
Also we don't have else clauses.
With that in mind, and also taking in mind that / is a divmod operator, how come would we have a prime checker?
Golf Unipants' Golfing Language numbers
tags: code-challenge
Sandbox notes are, as always, put in blockquotes.
Unipants' Golfing Language is a golfing language I'm working on. One item on this language's TODO list is golfing numbers in this language. In this challenge I hereby provide a ...
^ To note: pin these messages when I can.
Moving on.
Make a GitHub commit feed for the room.
I'll ask in the Nineteenth Byte. brb with the laptop.