Scribd
Upload
17 views2 pages

Discrete Problems

Uploaded by

daksh.gread300809
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
17 views2 pages

Discrete Problems

Uploaded by

daksh.gread300809
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/ 2

Discrete Test April 8, 2023

Time limit: 50 minutes.


Instructions: This test contains 10 short answer questions. All answers must be expressed in
simplest form unless specified otherwise.
No calculators.

1. For all positive integers n > 1, let f (n) denote the largest odd proper divisor of n (a proper
divisor of n is a positive divisor of n except for n itself). Given that N = 2023 · 2320 , compute

f (N )
.
f (f (f (N )))

2. A 3 × 3 grid is to be painted with three colors (red, green, and blue) such that

(i) no two squares that share an edge are the same color and
(ii) no two corner squares on the same edge of the grid have the same color.

As an example, the upper-left and bottom-left squares cannot both be red, as that would violate
condition (ii). In how many ways can this be done? (Rotations and reflections are considered
distinct colorings.)

3. How many trailing zeros does the value

300 · 305 · 310 · · · 1090 · 1095 · 1100

end with?

4. Michelle is drawing segments in the plane. She begins from the origin facing up the y-axis and
draws a segment of length 1. Now, she rotates her direction by 120◦ , with equal probability
clockwise or counterclockwise, and draws another segment of length 1 beginning from the end of
the previous segment. She then continues this until she hits an already drawn segment. What
is the expected number of segments she has drawn when this happens?

5. Ryan chooses five subsets S1 , S2 , S3 , S4 , S5 of {1, 2, 3, 4, 5, 6, 7} such that |S1 | = 1, |S2 | = 2, |S3 | =
3, |S4 | = 4, and |S5 | = 5. Moreover, for all 1 ≤ i < j ≤ 5, either Si ∩ Sj = Si or Si ∩ Sj = ∅ (in
other words, the intersection of Si and Sj is either Si or the empty set). In how many ways can
Ryan select the sets?

6. We say that an integer x ∈ {1, · · · , 102} is square-ish if there exists some integer n such that
x ≡ n2 + n (mod 103). Compute the product of all square-ish integers modulo 103.

7. Let S be the number of bijective functions f : {0, 1, . . . , 288} → {0, 1, . . . , 288} such that f ((m +
n) mod 17) is divisible by 17 if and only if f (m) + f (n) is divisible by 17. Compute the largest
positive integer n such that 2n divides S.

8. Define the Fibonacci numbers via F0 = 0, F1 = 1, and Fn = Fn−1 + Fn−2 .


Olivia flips two fair coins at the same time, repeatedly, until she has flipped a tails on both, not
necessarily on the same throw. She records the number of pairs of flips c until this happens (not
including the last pair, so if on the first flip both coins turned up tails c would be 0). What is
the expected value of Fc ?
Discrete Test April 8, 2023

9. Suppose a and b are positive integers with a curious property: (a3 − 3ab + 21 )n + (b3 + 12 )n is an
integer for at least 3, but at most finitely many different choices of positive integers n. What is
the least possible value of a + b?

10. Colin has a peculiar 12-sided dice: it is made up of two regular hexagonal pyramids. Colin wants
to paint each face one of three colors so that no two adjacent faces on the same pyramid have
the same color. How many ways can he do this? Two paintings are considered identical if there
is a way to rotate or flip the dice to go from one to the other. Faces are adjacent if they share
an edge.

You might also like