Math Help Forum

Math Help Forum Feed Site Feed

Go Back   Math Help Forum > University Math Help > Number theory
Reply
 
Thread Tools Display Modes
  #1  
Old July 4th, 2009, 10:05 AM
Junior Member
 
Join Date: May 2008
Posts: 43
Country:
Thanks: 11
Thanked 0 Times in 0 Posts
Cairo is on a distinguished road
Default Quadratic residues

The set {1,2,...16} is to be split into two disjoint non-empty sets S and T in such a way that;

the product (mod 17) of any two elements of S lies in S;
the product (mod 17) of any two elements of T lies in S;
the product (mod 17) of any elements of S and any element of T lies in T.

Prove that the ONLY solution is

S={1,2,4,8,9,13,15,16} and T={3,5,6,7,10,11,12,14}.

I'd also like to know if there is a way to generalise this?
Reply With Quote
Advertisement
 
  #2  
Old July 4th, 2009, 04:19 PM
NonCommAlg's Avatar
MHF Contributor

 
Join Date: May 2008
Location: Vancouver
Posts: 1,757
Country:
Thanks: 211
Thanked 1,284 Times in 955 Posts
NonCommAlg has much to be proud ofNonCommAlg has much to be proud ofNonCommAlg has much to be proud ofNonCommAlg has much to be proud ofNonCommAlg has much to be proud ofNonCommAlg has much to be proud ofNonCommAlg has much to be proud ofNonCommAlg has much to be proud ofNonCommAlg has much to be proud ofNonCommAlg has much to be proud of
Default

Quote:
Originally Posted by Cairo View Post
The set {1,2,...16} is to be split into two disjoint non-empty sets S and T in such a way that;

the product (mod 17) of any two elements of S lies in S;
the product (mod 17) of any two elements of T lies in S;
the product (mod 17) of any elements of S and any element of T lies in T.

Prove that the ONLY solution is

S={1,2,4,8,9,13,15,16} and T={3,5,6,7,10,11,12,14}.

I'd also like to know if there is a way to generalise this?
Generalization:

let F be a finite field of odd order and F^{\times}=F-\{0\}. we know that F^{\times} is a cyclic group. there exist unique non-empty sets S,T \subset \mathbb{F}^{\times} which satisfy the following conditions:

1) S \cap T = \emptyset and S \cup T=F^{\times},

2) a,b \in S \Longrightarrow ab \in S,

3) a,b \in T \Longrightarrow ab \in S,

4) a \in S, \ b\in T \Longrightarrow ab \in T.

Proof: first note that 1) & 3) implies that 1 \in S and thus by 4) we have a^{-1} \in S, for all a \in S. thus by 2), S is a subgroup of F^{\times}. now fix a \in S, \ b \in T. see that aS=S and bS=T.

thus |S|=\frac{1}{2}|F^{\times}|, which proves the uniqueness of S (and therefore the uniqueness of T), because we know that a cyclic group cannot have two subgroups of the same order. Q.E.D.

Remark: the above proof also gives the set S (and therefore T): suppose F^{\times}=<\alpha>. then S=<\alpha^2> and T=F^{\times}-S.
__________________
There's more than one of everything.

Last edited by NonCommAlg; July 4th, 2009 at 07:05 PM.
Reply With Quote
The Following 2 Users Say Thank You to NonCommAlg For This Useful Post:
Donate to MHF
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are Off
Pingbacks are Off
Refbacks are Off
Forum Jump


All times are GMT -7. The time now is 06:08 PM.


Powered by vBulletin® Version 3.7.3
Copyright ©2000 - 2009, Jelsoft Enterprises Ltd.
SEO by vBSEO 3.2.0 ©2008, Crawlability, Inc.
©2005 - 2009 Math Help Forum


Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.