Thread: Problem 29
View Single Post
  #1  
Old July 1st, 2007, 09:05 PM
ThePerfectHacker's Avatar
ThePerfectHacker ThePerfectHacker is offline
Global Moderator

 
Join Date: Nov 2005
Location: New York City
Posts: 11,186
Country:
Thanks: 482
Thanked 3,758 Times in 3,070 Posts
ThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond reputeThePerfectHacker has a reputation beyond repute
Default Problem 29

1)In a room let there be n>1 people. Show that there must exist two people that shaked the same number of hands with others.

2)Let a_1,a_2,...,a_n be distinct integers from \{1,2,...,n\} not necessarily in that order. Show that if n is odd then (a_1-1)(a_2-2)...(a_n-n) is an even number.
__________________

To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.


"Democracy has proved only that the best way to gain power
over people is to assure the people that they are ruling
themselves. Once they believe that, they make wonderfully
submissive slaves." - Joseph Sobran


To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.

Last edited by ThePerfectHacker; July 1st, 2007 at 10:00 PM.