Much like the Word-tank-wheel challenge, but numbers!
Find a number that can 'rotate' in a way that the origin number and its rotations must be divisible (i.e. whole number) by the number of times it rotated.
Here's some examples of potential answer:
Example 1:
Number to start with: 321
Rotations: 3
Result:
origin number - 321 (321/3 = 107, pass)
rotation 1: 213 (213/3 = 71, pass)
rotation 2: 132 (132/3 = 44, pass)
rotation 3: 321 (pass)
Example 2:
Number to start with: 1644444
Rotations: 4
Result:
origin number - 1644444 (1644444 /4 = 411111, pass)
rotation 1: 4164444 (4164444/4 = 1041111, pass)
rotation 2: 4416444 (4416444/4 = 1104111, pass)
rotation 3: 4441644 (4441644/4 = 1110411, pass)
rotation 4: 4444164 (4444164/4 = 1111041, pass)
Rules:
- Must be at least 3 digits & 3 rotations
- Rotation must be in the same direction
- Rotation ≤ Digit (to prevent infinite looping, see example 1)
- Cannot use repeating numbers (11111, 22222, etc) or number starting / ending with 0's (100, 01230, etc)
- Base 10 number system, positive numbers
Scoring:
- ([Digit] x [Rotations]) / (1 + (Digit - Rotation)), hence:
- Example 1 = 3 (Digits) x 3 (Rotations) / 1 = score of 9
- Example 2 = 7 (Digits) x 4 (Rotations) / 4 = score of 7
Highest score wins.
This challenge will remains open for at least 2 days.
Time's up!
Highest score:
Jonathan Allan with score of ..um... ∞!
Great attempts with others who joined the challenge!