Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- From: "Jesse F. Hughes" <jesse@xxxxxxxxxxxxx>
- Date: Thu, 17 Jan 2008 11:39:53 -0500
Han de Bruijn <Han.deBruijn@xxxxxxxxxxxxxx> writes:
Jesse F. Hughes wrote:
Han de Bruijn <Han.deBruijn@xxxxxxxxxxxxxx> writes:
Plonk! Plonk! How can something be true for the composition of finitelyPlease pardon my notation, but I hope that the meaning is clear.
many permutations and not true if there are infinitely many?
Consider the ordered set <1,2,3>. Let p the permutation that
switches
the order of the first two elements, so that
p = <2,1,3>
pp = <1,2,3>
ppp = <2,1,3>
pppp = <1,2,3>
and so on.
Let poo be the infinite composition of p with itself. You claim poo
is a permutation. What is the first element of poo? Is it 1? Is it
2?
I've covered an alike question already, in my response to David
Ullrich in this thread. I'm not going to make the same homework
twice. Sorry.
You have *not* covered this question. This is a different question
than his, because I have an oscillating sequence and he did not.
So, I ask again: what is the first element of poo?
--
Jesse F. Hughes
"Like the ski resort full of girls hunting for husbands
and husbands hunting for girls, the situation is not as
symmetrical as it might seem." -- Alan MacKay
.
- Follow-Ups:
- Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- From: Han de Bruijn
- Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- References:
- 1-1/2+1/3-1/4+1/5-1/6+1/7
- From: tommy1729
- Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- From: lwalke3
- Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- From: Han de Bruijn
- Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- From: Jesse F. Hughes
- Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- From: Han de Bruijn
- 1-1/2+1/3-1/4+1/5-1/6+1/7
- Prev by Date: Re: Reachability of nodes in a complete binary tree
- Next by Date: Re: A question in module theory!
- Previous by thread: Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- Next by thread: Re: 1-1/2+1/3-1/4+1/5-1/6+1/7
- Index(es):
Relevant Pages
|