Sujet : Re: Does the number of nines increase?
De : ben (at) *nospam* bsb.me.uk (Ben Bacarisse)
Groupes : sci.mathDate : 11. Jul 2024, 02:46:32
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <87le28lmyv.fsf@bsb.me.uk>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
User-Agent : Gnus/5.13 (Gnus v5.13)
"Chris M. Thomasson" <
chris.m.thomasson.1@gmail.com> writes:
On 7/10/2024 5:32 PM, Ben Bacarisse wrote:
"Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:
On 7/10/2024 4:29 PM, Moebius wrote:
Am 11.07.2024 um 01:02 schrieb Moebius:
Am 11.07.2024 um 01:00 schrieb Moebius:
Am 11.07.2024 um 00:55 schrieb Moebius:
>
Math SHOULD BE fun! (imho)
>
Hmmm... It's quite clear that WM doesn't have ANY fun with math, I'd
say.
>
Actually, he doesn't DO any math.
Most cranks don't to any (real) math, they just "criticizes" (sort of)
things they don't really understand.
>
If I am having a hard time understanding something, I ask/read around until
I can finally grasp the underlying meaning of the problem to a point where
I can code up a working solution. It has certainly tended worked for me in
the past.
Here's and interesting problem to code up. The input is a finite array
of n pairs of strings, so there are 2n strings in all. They are often
thought of as strings on the top and bottom of a collection of tiles or
dominos, but that just help visualise the problem. An example with n=3
might be
aa bb abb
aab ba b
>
Just making up an example:
>
ab ab ab = ababab
aba ba b = ababab
>
Would that work?
If I understand you, yes. It's a simple case where the tiles, used once
in some order make a solution. In most cases is will be much harder to
determine if there is a solution.
Does each string need to be unique?
No.
-- Ben.