Fastest Cashier in the West You're trying to design an automatic cashier that is able to dispense the correct amount of change in any denominations as quickly as possible. Your goal is to implement a program that accepts a target integer T ≥ 0 which is the amount you're trying to make change for...

The Goldbach Conjecture states that every even number greater than two can be expressed as the sum of two primes. For example, 4 = 2 + 2 6 = 3 + 3 8 = 5 + 3 However, once we get to 10 something interesting happens. Not only can 10 be written as 5 + 5 but it can also be written as 7 + 3 S...

Your task is to generate a random digit following these steps: First, generate 10 random digits to make a binary number, 50% 0, and 50% 1: 010011001 If it is all zeros, generate a new one. Convert this to decimal: 153 For each digit, write that amount of alternating 0s and 1s (first digit...

Tetration, represented as a^^b, is repeated exponentation. For example, 2^^3 is 2^2^2, which is 16. Given two numbers a and b, print a^^b. Test cases 1 2 -> 1 2 2 -> 4 5 2 -> 3125 etc. Scientific notation is acceptable. Remember, this is code-golf, so the code with the smallest number o...

A Milky Way golf I am offering a 50-rep bounty to anyone who can answer a code-golf question using Milky Way in fewer bytes than myself. To compete, the author of the answer should ping me in The Nineteenth Byte, or email me (see my profile page). This bounty is offered to any answers that are ...

Fitting but Unsuitable Languages: 4 x 500 points There are some challenges for which we all want to see answers in a certain language, even if the solution is very difficult. I'll award 500 points for an answer in such a language to any. Hexagonal Maze Time! in Hexagony Current shortest soluti...

2x 500 rep for quines in Hexagony There are two ways to write a quine in Hexagony (which will probably result in very different solutions). The former is clearly the golfier version but the other one is would be a lot neater. I'll give a 500 rep bounty to the first person who manages to write ei...

1000 Rep for a modulo in Brain-Flak The current record for the shortest modulo is 64 characters: ({}(<()>)){({}[()]<(({}()[({})])){{}(<({}({}))>)}{}>)}({}{}<{}>) This was set by Dennis here. If you can implement modulo in less than 64 characters in Brain-Flak, you will get 1000 rep. 1000 f...

50 rep for a quine in Logicode It's what it says on the tin. Just write a quine for Logicode, and post it on Golf you a quine for great good. Simple as that. You are allowed linefeeds below the output. I will be offering 50 rep to whoever can complete the task. Just write a comment down on thi...

Suppose that we have a wallet whose total amount(let's say it's N) is given by the user at runtime of the programme. The restriction in the contents of the wallet is that only 1,2,5 or 10 notes are allowed. **The question ** is to print all possible combinations of the notes adding to the total o...

Print the Greek alphabet! Fairly obviously, you have to print the Greek alphabet. But I thought I'd make it slightly more interesting, so there's a twist: when your program is ran with an argument (anything), it should output the Greek alphabet in lowercase. Information Greek alphabet (Capita...