Answering njas: definition of POLYPON
Richard Mathar
mathar at strw.leidenuniv.nl
Mon Dec 10 19:52:57 CET 2007
--- Leroy Quet <q1qq2qqq3qqqq at yahoo.com> wrote:
>....
> So, for example, for n=6, we have the pair of
> permutations I wrote of in my original email on
> this topic:
>
> 4,2,6,3,5,1
> 6,2,4,1,5,3
>
> Then there is one, and only one, other pair of
> permutations for n=6 that are inverses of each
> other, are not self-inverse, and conform to the
> conditions spelled out in the original post on
> this topic. (Hmmm. I will try now to find that
> pair of permutations by hand now. No matter how
> easy it is to find that pair I will not post
> back
> here that the problem is much too easy to make
> a
> good puzzle. You have been warned.)
> :)
>
> Thanks,
> Leroy Quet
>
Okay, I won't post the answer. But with just a
little trial and error (it wasn't too hard to
find this), I get a solution with this set of
signs:
+-+-+
Thanks,
Leroy Quet
____________________________________________________________________________________
Looking for last minute shopping deals?
Find them fast with Yahoo! Search. http://tools.search.yahoo.com/newsearch/category.php?category=shopping
More information about the SeqFan
mailing list