### Random Post

### Recent Posts

- Enigma 1105: Road ants
- Enigma 406: The ritual
- Puzzle 69: Division: letters for digits
- Enigma 1106: Not a square unused
- Enigma 405: Uncle bungles the answer
- Enigma 401: Uncle bungles the answer
- Puzzle 70: Football five teams: new method
- Enigma 1107: Factory work
- Enigma 404: Regular timepiece
- Tantalizer 477: Precognition

### Recent Comments

Hugh Casement on Enigma 1105: Road ants | |

Jim Randell on Enigma 1105: Road ants | |

geoffrounce on Enigma 35: Digits all wro… | |

hakank on Puzzle 70: Football five teams… | |

saracogluahmet on Enigma 1740: Sudoprime |

### Archives

### Categories

- article (11)
- enigma (1,089)
- misc (2)
- project euler (2)
- puzzle (23)
- site news (42)
- tantalizer (23)
- teaser (3)

### Site Stats

- 159,510 hits

The

SubstitutedSum()solver from theenigma.pylibrary can be used to solve this. I added ago()method to the solver that outputs all solutions (that pass an optional filter), which lets you solve problems like this with a one-liner.The following Python program runs in 54ms.

Solution:JONNY = 52331.There are two corresponding sums:

52331 = 48608 + 3723

52331 = 48708 + 3623

L and S are 6 and 7, but it doesn’t matter which way round.