### Random Post

### Recent Posts

- Enigma 1096: Prime break
- Enigma 415: Buses galore
- Puzzle 65: Division: figures all wrong
- Enigma 1097: Chessboard triangles
- Enigma 414: Nicely bungled, Sir!
- Tantalizer 473: Pigeon post
- Enigma 1098: Soccer heroes
- Enigma 413: Quargerly dues
- Puzzle 66: Hopes and successes on the island
- Enigma 1099: Unconnected cubes

### Recent Comments

geoffrounce on Enigma 1096: Prime break | |

Brian Gladman on Enigma 1096: Prime break | |

Hugh Casement on Enigma 1096: Prime break | |

Jim Randell on Enigma 1096: Prime break | |

Jim Randell on Enigma 415: Buses galore |

### Archives

### Categories

- article (11)
- enigma (1,107)
- misc (2)
- project euler (2)
- puzzle (27)
- site news (43)
- tantalizer (27)
- teaser (3)

### Site Stats

- 164,476 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.