Title: Professor Propsters' Garden Fence
Although I'm fairly new to PPCG, I had this nice idea for a cops-and-robbers game. Although it may take some time to read the suggestion, please take some time to improve the challenge as I have zero experience with this! Thank you.
Description:
Profess...
I'm creating a language where the arity of a command depends on the next value (as a number) but I can't think of a name. Does anyone have any suggestions?
@cairdcoinheringaahing I'm not actually sure, but arity made me think of that - I thought it meant something related but a google search brings up nothing, I might have made it up
@WheatWizard I only saw half the rep from my Taxi answer, although I think that was a break from the norm of HNQ answers that get lots of rep (as in it took a lot of work and wasn't a FGITW)
Description
We consider an integer with at least 3 digits triple-balanced if, when split in three parts, the digits in every part sum up to the same number. We split numbers as follows:
abcdefghi - Standard case: the number of digits is divisable through 3:
abc def ghi
abcdefgh - Number % 3 ==...
As we all know, it's turtles all the way down. But is it primes all the way down too?
A number is considered a "turtle-prime" if it satisfies the following conditions:
1) It is prime.
2) It is possible to remove a single digit leaving a prime number.
3) Step 2 can be repeated until left with a ...
In a popular image editing software there is a feature, that patches (The term used in image processing is inpainting as @mınxomaτ pointed out.) a selected area of an image, based on the information outside of that patch. And it does a quite good job, considering it is just a program. As a human,...
Determining whether a Language is Turing Complete is very important when designing a language. It is a also a pretty difficult task for a lot of esoteric programming languages to begin with, but lets kick it up a notch. Lets make some programming languages that are so hard to prove Turing Compl...
Jelly, 6 bytes
Ḋṁ7;ḢX
A monadic link taking a list of four characters and returning one with the probability distribution described.
Try it online!
How?
Ḋṁ7;ḢX - Link: list of characters, s e.g. ABCD
Ḋ - dequeue s BCD
ṁ7 - mould like 7 (implicit range) ...
Assuming that the king starts on some square of an infinite chessboard. In the puzzle of chess, the king can move to any neighbouring square horizontally, vertically, or diagonally. In this puzzle, the king takes one move extra after n number of moves. You have to find that in how many different ...
Primality testing and checking if x applies to every character are equally trivial in golflangs, and in every other language, the primality testing is the less trivial part
@Downgoat You say most of the languages have those built-ins, but primality checking does not have a built-in in the languages .charCodes and .every exist??
Sorry, but I disagree. Please hammer-dupe it though, because I want to leave that challenge anyway.
@totallyhuman I tried to delete it ever since the very first answer was posted, but unfortunately that got an upvote and I personally think it's unfair to the answerer.
Write a code poem programming-puzzle
It is said that Larry Wall, creator of Perl, wrote a poem titled "Black Perl" in said language, as shown here.
The poem is fully functional (working syntax, no runtime errors, etc. [no errors in general]).
The challenge:
In any language (practical language...
Here's an example of a very similar, yet IMO more interesting challenge: Given a positive integer N, determine if it's very prime. A number is very prime if it is prime and each digit of its decimal representation is also prime. For example, 17 is very-prime, but 19 is not.
Here's an example of a very similar, yet IMO more interesting challenge: Given a positive integer N, determine if it's very prime. A number is very prime if it is prime and each digit of its decimal representation is also prime. For example, 17 is very-prime, not very prime, but 19 is not and neither is 19.