[seqfan] Re: Differences of permutations of 1..2^k

[Maximilian Hasler]

If n>2 is a power of a prime p,
then the (n-1)-st difference of any permutation of 1..n is a multiple of p.
At least it seems so...

Maximilian

On Sat, Mar 6, 2010 at 3:12 PM, Ron Hardin <rhhardin at att.net> wrote:
>
> For n>1, the 2^n-1st difference of any permuation of 1..2^n is even.
>
> At least I think so.
>
>  ---rhhardin at mindspring.com
> rhhardin at att.net (either)
>
>
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>