Sujet : Re: MathsBombe - observations but not the answer
De : richard (at) *nospam* cogsci.ed.ac.uk (Richard Tobin)
Groupes : rec.puzzlesDate : 20. Feb 2025, 21:41:43
Autres entêtes
Organisation : Language Technology Group, University of Edinburgh
Message-ID : <vp8427$1b04$1@macpro.inf.ed.ac.uk>
References : 1 2 3 4
User-Agent : trn 4.0-test76 (Apr 2, 2001)
In article <
hbidnYrnI_7s7Cr6nZ2dnZfqnPadnZ2d@brightview.co.uk>,
Mike Terry <
news.dead.person.stones@darjeeling.plus.com> wrote:
[detailed description and worked example]
To reduce it to its minimum...
If
15 = x^2 + x
then
15x^n = x^(n+2) + x^(n+1)
so we can exchange 15 coins of any one denomination for one each of
the two next higher denominations.
-- Richard