Scribd
Upload
16 views3 pages

C2 Solution

Uploaded by

Durgesh Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views3 pages

C2 Solution

Uploaded by

Durgesh Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Olymprep Combinatorics Problems, Week 3

Mathematics Initiatives in Nepal

April 4, 2023

1 Problem 1
Let A and B be two finite sets, with |A| = m and |B| = n. How many
distinct functions (mappings) can you define from set A to B, f : A → B?
Answer: We can solve this problem using the multiplication principle. Let:
A = {a1 , a2 , a3 , a4 ....., an }
B = {b1 , b2 , b3 , b4 ....., bn }.
Note that to define a mapping from A to B, we have n options for
f (a1 ), i.e., f (a1 ) ∈ B = {b1 , b2 , b3 , b4 ....., bn }. Similarly we have n options
for f (a2 ) and so on. Thus by multiplication principle, the total number of
distinct functions f : A → B is
n.n.n.n...n = nm

2 Problem 2
An urn contains 30 red balls and 70 green balls. What is the probability of
drawing exactly k red balls in a sample of size 20 if the sampling is done
with replacement (repetition allowed)? Assume 0 ≤ k ≤ 20.
Answer: Here any time we take a sample from the urn we put it back before
the next sample. Thus in this experiment each time we sample, the proba-
bility of choosing a red ball is 30/100, and we repeat this in 20 independent
trials. This is exactly the binomial experiment. Thus by using the binomial
formula we obtain 
P(k red balls) = 20 k
(0.3)k (0.7)20−k

1
3 Problem 3
How many triangles can be formed by choosing 3 distinct points from the
given graphic (two parallel lines)?

Answer: To form a triangle we can select 3 points from the 8 given point,
2 at max from a line. So from a total of 5 and  3 points
 we can choose at
max 2 from a single line leaving us to subtract 3 and 33 from the total of
5
 
8
3
total possible combinations, as you cannot choose three points from the
same line.
Sothe total
   number of triangles in the figure is:
8 5
3
- 3
- 33 .

i.e. 45.

4 Problem 4
A random number selector can only select one of the nine integers 1, 2, ..., 9
,and it makes these selections with equal probability. Determine the proba-
bility that after n selections (n > 1), the product of the n numbers selected
will be divisible by 10.

Answer:For the product to be divisible by 10, there must be a factor of


2 and a factor of 5 in there.  n
The probability that there is no 5 is 89 .
 n
5
The probability that there is no 2 is 9
.
 n
The probability that there is neither a 2 nor 5 is 49 , which is included
in both previous cases. The only possibility left is getting a 2 and a 5,
making the product divisible by 10. By complementarity
 n  andn principle
 n  of
inclusion-exclusion, the probability of that is 1 − 9 + 9 − 49
8 5
=
n n n
1 − (8/9) − (5/9) + (4/9) .

2
5 Problem 5
Call a number prime-looking if it is composite but not divisible by 2, 3, or 5.
The three smallest prime-looking numbers are 49, 77, and 91. There are 168
prime numbers less than 1000. How many prime-looking numbers are there
less than 1000?

Answer: The given states that there are 168 prime numbers less than 1000,
which is a fact we must somehow utilize. Since there seems to be no easy way
to directly calculate the number of ”prime-looking” numbers, we can apply
complementary counting. We can split the numbers from 1 to 1000 into sev-
eral groups: {1}, {numbers divisible by 2 = S2 }, {numbers divisible by 3 = S3 },
{numbers divisible by 5 = S5 }, {primes not including 2, 3, 5}, {prime − looking}.
Hence, the number of prime-looking numbers is 1000 − (168 − 3) − 1 − |S2 ∪
S3 ∪ S5 | (note that 2, 3, 5 are primes).
We can calculate S2 ∪ S3 ∪ S5 using the Principle of Inclusion-Exclusion:
(the values of |S2 | . . . and their intersections can be found quite easily)
|S2 ∪S3 ∪S5 | = |S2 |+|S3 |+|S5 |−|S2 ∩S3 |−|S3 ∩S5 |−|S2 ∩S5 |+|S2 ∩S3 ∩S5 |
= 500 + 333 + 200 − 166 − 66 − 100 + 33 = 734

6 Problem 6
How many ways can you mark 8 squares of an 8 Ö8 chessboard so that no two
marked squares are in the same row or column, and none of the four corner
squares is marked? (Rotations and reflections are considered different.)

Answer: In the top row, you can mark any of the 6 squares that is not
a corner. In the bottom row, you can then mark any of the 5 squares that is
not a corner and not in the same column as the square just marked. Then, in
the second row, you have 6 choices for a square not in the same column as ei-
ther of the two squares already marked; then there are 5 choices remaining for
the third row, and so on down to 1 for the seventh row, in which you make the
last mark. Thus, altogether, there are 6.5.(6.5...1) = 30.6! = 30.720 = 21600
possible sets of squares.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy