### Random Post

### Recent Posts

- Tantalizer 478: Surprises
- Enigma 1109: All square in games
- Enigma 402: A DIY puzzle
- Puzzle 71: All wrong, all wrong
- Enigma 1110: Dots and lines
- Enigma 400: Potential difficulties
- Tantalizer 479: Cat and five tales
- Enigma 1111: Base-age
- Enigma 399: Time, gentlemen, please
- Tantalizer 480: Pitter patter

### Recent Comments

### Archives

### Categories

- article (11)
- enigma (1,080)
- misc (2)
- project euler (2)
- puzzle (21)
- site news (42)
- tantalizer (22)
- teaser (3)

### Site Stats

- 157,227 hits

I used the generalised Alphametic solver –

SubstitutedExpression()– in theenigma.pylibrary to generate possible values for MORE and LESS, and then deal with the fractions in Python. This gives a compact program that runs in 287ms.Solution:The fraction is 59/101.The actual decimal fractions are:

101 is the smallest prime denominator (and probably the smallest integer denominator at all) that gives repeating decimal fractions of period 4. See OEIS no. A051626 and A007138.

Any simplifying of the denominator by division must be a factor of 9999, so 3, 9, 11, 101. LESS cannot have 11, or 101 as a factor by applying the remainder theorem; a factor of 11 means L-E+S-S is a multiple of 11, for 101 LE – SS is a multiple of 101. From the simplification of the denominator MORE must have either 11, or 101 as a factor. And the multiple by which to multiply LESS to obtain MORE must also have a factor 11 or 101.