Register

Combinatorics-Kenneth Rosen (Ex 5.2 12)

459 views
0 votes
0 votes
How many ordered pairs of integers (a,b) are needed to guarantee that there are two ordered pairs ($a_{1}$,$b_1$) and

($a_2,b_2)$ such that $a_1$ mod 5=$a_2$ mod 5 and $b_1$ mod 5=$b_2$ mod 5?

My answer comes to be 26. Please confirm.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Ayush Upadhyaya asked Oct 24, 2017
326 views
Kenneth Rosen Ex 5.2
How many numbers must be selected from the set {1,2,3,4,5,6} to guarantee that at least one pair of these numbers add up to 7?
How many numbers must be selected from the set {1,2,3,4,5,6} to guarantee that at least one pair of these numbers add up to 7?
User Avatar
0 votes
0 votes
1 answer
2
admin asked Apr 29, 2020
432 views
Kenneth Rosen Edition 7 Exercise 6.2 Question 12 (Page No. 405)
How many ordered pairs of integers $(a, b)$ are needed to guarantee that there are two ordered pairs $(a_{1}, b_{1})\: \text{and}\: (a_{2}, b_{2})$ such that $a_{1} \mod 5 = a_{2} \mod 5\:\text{and}\: b_{1} \mod 5 = b_{2} \mod 5?$
How many ordered pairs of integers $(a, b)$ are needed to guarantee that there are two ordered pairs $(a_{1}, b_{1})\: \text{and}\: (a_{2}, b_{2})$ such that $a_{1} \mod ...
User Avatar
0 votes
0 votes
1 answer
3
Ayush Upadhyaya asked Jun 24, 2018
254 views
Combinatorics-Kenneth Rosen(Ex 5.3-41)
How many ways are there for a horse race with three horses to finish if ties are possible.(Two or three horses may tie).
How many ways are there for a horse race with three horses to finish if ties are possible.(Two or three horses may tie).
User Avatar
0 votes
0 votes
1 answer
4
admin asked Apr 29, 2020
4,145 views
Kenneth Rosen Edition 7 Exercise 6.2 Question 5 (Page No. 405)
Show that among any group of five (not necessarily consecutive) integers, there are two with the same remainder when divided by $4.$
Show that among any group of five (not necessarily consecutive) integers, there are two with the same remainder when divided by $4.$
User Avatar
Link Copied!