You are Here: Home >< Maths

# A Summer of Maths (ASoM) 2016

Announcements Posted on
Would YOU be put off a uni with a high crime rate? First 50 to have their say get a £5 Amazon voucher! 27-10-2016
1. (Original post by drandy76)
Always get this mixed up, is that a divides n, or n divides a?

Posted from TSR Mobile
a divides n so n/a=k EZ

Posted from TSR Mobile
2. (Original post by drandy76)
Always get this mixed up, is that a divides n, or n divides a?

Posted from TSR Mobile
a divides n
3. Dunno how to double quote so cheers lads

Posted from TSR Mobile

4. Was looking at this and noticed something odd when I looked at the middle two/one, with the outer sides you can 'follow' the trail from top to bottom with no problems, but if you try the same for either of the middle pillar thingies it can't be done, does anyone know how they managed this?

Posted from TSR Mobile
5. (Original post by drandy76)

Was looking at this and noticed something odd when I looked at the middle two/one, with the outer sides you can 'follow' the trail from top to bottom with no problems, but if you try the same for either of the middle pillar thingies it can't be done, does anyone know how they managed this?

Posted from TSR Mobile
They joined gaps on one end and respectively opposite on the other side the extra comes from gap between 4 is 3 spaces etc.
Proper weird though.

Posted from TSR Mobile
6. (Original post by physicsmaths)
They joined gaps on one end and respectively opposite on the other side the extra comes from gap between 4 is 3 spaces etc.
Proper weird though.

Posted from TSR Mobile
Yeah it was giving me a headache trying to trace it lol, thanks geometry nerd

Posted from TSR Mobile
7. (Original post by drandy76)
Yeah it was giving me a headache trying to trace it lol, thanks geometry nerd

Posted from TSR Mobile
No geometry in this one lad. Just using those eyes.

Posted from TSR Mobile
8. (Original post by physicsmaths)
No geometry in this one lad. Just using those eyes.

Posted from TSR Mobile
I have 1 1 vision bro

Posted from TSR Mobile
9. If for p prime, why are there p-1 choices for a,b such that (mod p) ?
10. (Original post by EnglishMuon)
If for p prime, why are there p-1 choices for a,b such that (mod p) ?
for each of 1,...,p-1 there is a multiplicative inverse to pair off with (e.g. for p = 3 you have (1,1), (2,2), for p = 5 you have (1,1), (2,3), (3,2), (4,4) )
edit: lol didn't notice the +/- tho
I presume it means we care either only about pairs such that ab = -1 (modp) or only about pairs such that ab = 1 (modp), or else there seem to be counterexamples. In this case proving the former is also fairly simple; multiplication is commutative and we can just multiply one of the elements in the inverse pair by p-1 (or -1 if you prefer) to get the corresponding pair that multiply to -1
11. (Original post by 13 1 20 8 42)
for each of 1,...,p-1 there is a multiplicative inverse to pair off with (e.g. for p = 3 you have (1,1), (2,2), for p = 5 you have (1,1), (2,3), (3,2), (4,4) )
edit: lol didn't notice the +/- tho
Yep, thought so for the +1 case. Was the -1 case I wasnt sure how to explain though. thanks
12. (Original post by EnglishMuon)
Yep, thought so for the +1 case. Was the -1 case I wasnt sure how to explain though. thanks
dunno if you've seen the edit. But it's probably not worded amazingly; basically the point is that given each pair (a,b) for the +1 case, you can multiply b by -1 to find a pair for the -1 case (as you get a(-b) = -(ab) = -1), i.e. you can sort of set up a correspondence
13. (Original post by 13 1 20 8 42)
dunno if you've seen the edit. But it's probably not worded amazingly; basically the point is that given each pair (a,b) for the +1 case, you can multiply b by -1 to find a pair for the -1 case (as you get a(-b) = -(ab) = -1), i.e. you can sort of set up a correspondence
thanks yea that makes sense. My mistake was that after multiplying one of a or b but p-1 stupidly I forgot that that is congruent to one of the other elements in Zp.
14. Any hints on how to prove this? :

If is a group and are subgroups of G of finite index in G, prove that is of finite index in .

Some initial thoughts:
Spoiler:
Show
Its straightforwards to show is also a subgroup of G.
The problem is trivial if G is finite so we assume it is infinite (order).

Let the index of H be m, the index of K be n.
Then there are only m distinct elements such that is distinct

and n distinct elements such that is distinct.

Now Itd be nice to say that these constitute to all elements g in G such that are distinct, but I dont think thats obviously the case- imagine forming where for some . Although the elements in are the same as in couldnt the elements in be different to still be different ? (i.e. we have permuted H)

15. (Original post by EnglishMuon)
Any hints on how to prove this? :

If is a group and are subgroups of G of finite index in G, prove that is of finite index in .

Some initial thoughts:
Spoiler:
Show
Its straightforwards to show is also a subgroup of G.
The problem is trivial if G is finite so we assume it is infinite (order).

Let the index of H be m, the index of K be n.
Then there are only m distinct elements such that is distinct

and n distinct elements such that is distinct.

Now Itd be nice to say that these constitute to all elements g in G such that are distinct, but I dont think thats obviously the case- imagine forming where for some . Although the elements in are the same as in couldnt the elements in be different to still be different ? (i.e. we have permuted H)

G being finite.
Since you have proven that the intersection of H and K is a group, you are done! From the proof of Lagrange, this subgroup has a particular (finite) index.

G being infinite. A good example of this that I can think of is G = Z with the + operation and subgroups H,K being the {3n | n in Z} and {4n | n in Z}. These have finite indexes in G. (Eg, the left cosets of H are {3n | n in Z}, {3n+1 | n in Z}, and {3n+2 | n in Z}.) The intersection of H and K is {12n | n in Z} which has index 12 in G - clearly finite.

The only problem is that it would seem difficult to generalise this example to other infinite groups. Here I would turn to contradiction.

Suppose that H and K have finite indexes in G but their intersection has an infinite index. The intersection of H and K is a subgroup of H. At this point, I'm going to point out that K is irrelevant - K is only here to give us a subset of H (intersection of H,K), which is actually a group (so that we can talk about the index of this subset). If a subset (subgroup) of H has infinite index... How can H possibly have a finite index?

Posted from TSR Mobile
16. (Original post by Ecasx)
G being finite.
Since you have proven that the intersection of H and K is a group, you are done! From the proof of Lagrange, this subgroup has a particular (finite) index.

G being infinite. A good example of this that I can think of is G = Z with the + operation and subgroups H,K being the {3n | n in Z} and {4n | n in Z}. These have finite indexes in G. (Eg, the left cosets of H are {3n | n in Z}, {3n+1 | n in Z}, and {3n+2 | n in Z}.) The intersection of H and K is {12n | n in Z} which has index 12 in G - clearly finite.

The only problem is that it would seem difficult to generalise this example to other infinite groups. Here I would turn to contradiction.

Suppose that H and K have finite indexes in G but their intersection has an infinite index. The intersection of H and K is a subgroup of H. At this point, I'm going to point out that K is irrelevant - K is only here to give us a subset of H (intersection of H,K), which is actually a group (so that we can talk about the index of this subset). If a subset (subgroup) of H has infinite index... How can H possibly have a finite index?

Posted from TSR Mobile
Thanks, and Indeed the integers was the example I was drawn to to help get a feel for whats happening!

I have the following argument so far:

Let be the elements that account for all distinct
and
be the elements that account for all distinct .
As any two subgroups are either equal or disjoint,

But is a rightcoset so we can choose our xi, yj such that wlog . Still cant see the final argument from this though...

p.s apologies for this disgusting formatting, if someone knows how to 'displaysyle' the intersections and have 2 lines of subscript one under the other, id appreciate it.
17. Ah I might have it:

Basically I think you can show if isnt the empty set. So
hence
for i.e. there are less than or equal to mn right cosets of H n K in G:

(as may equal some )
18. (Original post by EnglishMuon)
p.s apologies for this disgusting formatting, if someone knows how to 'displaysyle' the intersections and have 2 lines of subscript one under the other, id appreciate it.
\bigcup:
19. (Original post by EnglishMuon)
Ah I might have it:

Basically I think you can show if isnt the empty set. So
hence
for i.e. there are less than or equal to mn right cosets of H n K in G:

(as may equal some )
I don't quite see what you are trying to do. I don't think your first sentence is true: 'Basically I think you can show...'. If a coset of H, say Hx, and a coset of K, say Ky, are to be equal, then H and K must be of equal size, which is not guaranteed in the question.

I would suggest looking for a contradiction. We have H and K being finite-indexed subgroups. We have T = (H intersection K) being a subgroup of H. If T has infinite index (infinitely many different cosets), then surely H must have infinite index too - why?

The benefit of contradiction here is that there is no detailed considerations needing to be made, in contrast to m, n being the number of cosets of H, K in your attempt, for example.

Posted from TSR Mobile
20. Ok. whats wrong with the first sentence? We know that any two right cosets in a group are either equal or disjoint. So if we are looking at the intersection of 1 right coset and another and this set is not empty, they must both equal some for some . There was a typo actually in the 2nd line as I meant to say but I don't see why the rest of argument doesn't work.

## Register

Thanks for posting! You just need to create an account in order to submit the post
1. this can't be left blank
2. this can't be left blank
3. this can't be left blank

6 characters or longer with both numbers and letters is safer

4. this can't be left empty
1. Oops, you need to agree to our Ts&Cs to register

Updated: September 28, 2016
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:
Today on TSR

Poll
Useful resources