Path: ...!feeds.phibee-telecom.net!2.eu.feeder.erje.net!feeder.erje.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com>
Newsgroups: sci.math
Subject: Re: Does the number of nines increase?
Date: Wed, 10 Jul 2024 18:33:39 -0700
Organization: A noiseless patient Spider
Lines: 67
Message-ID: <v6ncpk$23rhi$8@dont-email.me>
References: <tJf9P9dALSN4l2XH5vdqPbXSA7o@jntp>
 <69d5b220-850b-4faa-b9b4-b25cd74d1666@att.net>
 <iXwHO-pH72dPrRO8fKLu73u-pDc@jntp> <v6etjs$f608$6@dont-email.me>
 <rOlUS7lI7QcAQJM95Z2fo8X09x0@jntp> <v6etov$f604$2@dont-email.me>
 <02WQWLab8x41L6XRW0n7Ba0poZ8@jntp> <v6iaf6$18428$1@dont-email.me>
 <v6j2cm$1bggk$1@dont-email.me> <v6k5fj$1gsq2$2@dont-email.me>
 <v6k8rg$1hehh$1@dont-email.me> <v6kacc$1ho2l$1@dont-email.me>
 <v6kb9f$1hehi$2@dont-email.me> <v6n02q$231iu$3@dont-email.me>
 <v6n0mu$22nd0$5@dont-email.me> <v6n1q7$22opo$9@dont-email.me>
 <v6n3gg$22ncv$4@dont-email.me> <v6n3q0$22nd0$9@dont-email.me>
 <v6n3tb$22nd0$10@dont-email.me> <v6n5hm$2436h$1@dont-email.me>
 <v6n6bh$23rgt$1@dont-email.me> <87v81cn4xy.fsf@bsb.me.uk>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Thu, 11 Jul 2024 03:33:41 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="9e4d47bab28597d7f8b7db1375a7cff9";
	logging-data="2223666"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/UKAl+1xoKVmIM2PcT/lCWStg7+M0GaqA="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:PiHYssW1wTIZ6AlBSEjiZ/+GnFI=
In-Reply-To: <87v81cn4xy.fsf@bsb.me.uk>
Content-Language: en-US
Bytes: 3973

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? Does each string need to be unique?





> 
> The pairs (or tiles) are numbered from 1 to n.  The problem is to
> determine, for any finite set of tiles, if there is a finite sequence of
> numbers such that when those numbered tiles are laid out (we can use any
> tile as often as we like) the concatenation of the top stings is the
> same as the concatenation of the bottom strings.
> 
> For example, with these tiles, the sequence 1, 2, 1, 3 produces
> 
>    aa    bb    aa    abb
>    aab   ba    aab    b

      aa    bb    aab    b




> 
> with top string aabbaaabb = bottom string aabbaaabb.  So for this input,
> the program should print "yes".  You don't need to give the sequence
> that gives the matching top and bottom strings (though that would be a
> neat extra), you just have print yes or no depending on whether such a
> sequence of tiles exists or not.
>