You are Here: Home >< Maths

# Linear algebra - permutations and cycles watch

1. Let Sym(n), p be prime, r be the remainder when n is divided by p (so 0r<p and n=qp+r for some integer q).

1. Show that ^p = iff the cycles of all have lengths 1 or p.

2. Show that if ^p = then |Supp()| is a multiple of p and |Fix()| r(mod p).

I really don't have many ideas on these at all.

Fix() := {x|x = x}
Supp() := {x|x x}

1) If all cycles have length 1 then it is clear that ^p is the identity.
I don't know what I can deduce from all cycles having length p. The other way around, I can see if we have the identity that all cycles could be length 1, but I don't know how to go about getting length p.

2) I have no idea how to start this.

Thanks.
2. For (i), you should know the result that a permutation (where the are disjoint permutations) has order the lowest common multiple of the orders of all the . If you haven't already proved this result it's maybe worth proving it (it's not too difficult), because it makes the answer fall out fairly fast.

Unfortunately my memory fails me for (ii), but it's worth looking more closely at the definitions given to try and work out how they relate to p and r.

### Related university courses

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: January 24, 2010
The home of Results and Clearing

### 4,379

people online now

### 1,567,000

students helped last year
Today on TSR

### IT'S TODAY!

A-level results chat here

### University open days

1. Bournemouth University
Fri, 17 Aug '18
2. University of Bolton
Fri, 17 Aug '18
3. Bishop Grosseteste University
Fri, 17 Aug '18
Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams