Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: More on Leroy Quet's prime trees.
Replies: 2   Last Post: Dec 16, 2002 4:06 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Bill Taylor

Posts: 1,909
Registered: 12/8/04
Re: More on Leroy Quet's prime trees.
Posted: Dec 15, 2002 9:55 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


mathwft@math.canterbury.ac.nz (Bill Taylor) writes:

|> For 15-trees, there are apparently six feasible parity-patterns, and, of
|> course, a great many example trees. I haven't checked that there is at
|> least one for each of the six patterns, (exercise for the reader), but
|> I guess there is, as it is fairly easy to construct examples.

Yes there is at least one of each type, I just checked. It's not hard.


There is another special type that might be fun to search for, and will be
rather easier to program a machine search for, thus maybe giving us some
clue on the matter of whether there are infinitely many overall, or just
(as I suspect) finitely many.

We can also look for "sequential prime trees". These are as before, but
with the further property that all the levels above the bottom have the
integers in sequential order from 1 onwards. It's easy to check there
are none with 2 or 3 levels; and the 4-levellers only *just* miss out too.
The nearest miss is:
1
/ 2 3
/ \ / 4 5 6 7
/ \ / \ / \ / 10 12 11 15 9 13 8 14

totals: 17 19 19 23 19 23 19 25 <----- not quite a prime.


It's not very hard to construct a sequential prime tree with 5 levels;
indeed I expect there are several of them. And I expect they continue
to be just as easy to construct as prime trees in general; up to the point
where the number of levels hits the failure barrier for trees in general,
if there is such a thing.

But as I say, I expect sequential trees are very much easier to search for,
so if anyone cares to try a computer search, it would be fun to see if and
where the search broke down.

Cheers,
,,,))) _____________
\ (, ,) | '\\\\\ c\ >' | ' ____|_
) o/ | + '||::::::
___/ /___ | '||_____|
'--/ \_/ ) \'_______|_____|
|'/'. / =' \ ___/____|___\___
_|/_oOo__:__oOo_\| _ ' <<<:|
/___/__________/__|_________'___o_o|


------------------------------------------------------------------------------
Bill Taylor W.Taylor@math.canterbury.ac.nz
------------------------------------------------------------------------------
"There are only 10 kinds of people in the world --
Those who understand binary, and those who don't."
------------------------------------------------------------------------------




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.