The King's Puzzle Solver by XpertEdu

Welcome, wise puzzle solver!

A wise king wanted to honour the top artists of his country with gold coins. His generosity, however, followed a peculiar and challenging pattern based on the number of artists present each day.

The puzzle is this:

• On the 1st day, he takes a certain number of coins, let's call it 'n', and it must be perfectly divisible by the 1st group of artists.
• On the 2nd day, he adds one coin (n + 1) and this total must be perfectly divisible by the 2nd group of artists.
• On the 3rd day, he adds two coins (n + 2) and this is perfectly divisible by the 3rd group of artists.
• ...and so on for each group.

Your task is to enter the number of artists in each group. The solver will then calculate the smallest possible number of coins 'n' the king could have started with.

Examples to try:
A solvable puzzle: 5, 7, 9, 11
An insoluble puzzle: 3, 9, 11