### Random Post

### Recent Posts

- Enigma 427: Settle some new scores
- Puzzle 59: Cricket
- Enigma 426: Time and again
- Enigma 1084: 1-2-3 triangles
- Tantalizer 466: Diplomacy
- Tantalizer 467: Nine men went to mow
- Enigma 1085: Cut and run
- Enigma 425: Them thar’ Hills
- Puzzle 60: Uncle Bungle gets the last line wrong
- Enigma 1086: Stacking trays

### Recent Comments

Jim Randell on Enigma 427: Settle some new… | |

Jim Randell on Enigma 427: Settle some new… | |

geoffrounce on Enigma 1503: Division dec… | |

arthurvause on Enigma 425: Them thar’… | |

Jim Randell on Puzzle 59: Cricket |

### Archives

### Categories

- article (11)
- enigma (1,130)
- misc (2)
- project euler (2)
- puzzle (33)
- site news (43)
- tantalizer (34)
- teaser (3)

### Site Stats

- 170,314 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.