返回题库

PUMaC 2008 · 团队赛 · 第 11 题

PUMaC 2008 — Team Round — Problem 11

专题
Discrete Math / 离散数学
难度
L3
来源
PUMaC

题目详情

Team B √ √ √ 6

  1. (2 points) Calculate 6 + 6 + 6 + . . . + . 6 1+ 1+ ...
  2. (2 points) Find log 3 ∗ log 4 ∗ log 5 ∗ . . . ∗ log 63 ∗ log 64. 2 3 4 62 63
  3. (3 points) What is the smallest positive integer value of x for which x ≡ 4 (mod 9) and x ≡ 7 (mod 8)?
  4. (3 points) What is the difference between the median and the mean of the following data set: 12, 41, 44, 48, 47, 53, 60, 62, 56, 32, 23, 25, 31?
  5. (4 points) Quadrilateral ABCD has both an inscribed and a circumscribed circle and sidelengths BC = 4, CD = 5, DA = 6. Find the area of ABCD .
  6. (4 points) The seven dwarves are at work on day when they find a large pile of diamonds. They want to split the diamonds evenly among them, but find that they would need to take away one diamond to split into seven equal piles. They are still arguing about this when they get home, so Snow White sends them to bed without supper. In the middle of the night, Sneezy wakes up and decides that he should get the extra diamond. So he puts one diamond aside, splits the remaining ones in to seven equal piles, and takes his pile along with the extra diamond. Then, he runs off with the diamonds. His sneeze wakes up Grumpy, who, thinking along the same lines, removes one diamond, divides the remainder into seven equal piles, and runs off. Finally, Sleepy, for the first time in his life, wakes up before sunrise and performs the same operation. When the remaining four dwarves arise, they find that the remaining diamonds can be split into 5 equal piles. Doc suggests that Snow White should get a share, so they have no problem splitting the remaining diamonds. Happy, Dopey, Bashful, Doc, and Snow White live happily ever after. What’s the smallest possible number of diamonds that the dwarves could have started out with?
  7. (5 points) The graphs of the following equations divide the xy plane into some number of regions. 2 4 + ( x + 2) y = x 2 2 ( x + 2) + y =16 Find the area of the second smallest region. 2 3 3
  8. (5 points) Suppose that the roots of the quadratic x + ax + b are α and β . Then α and β are 2 the roots of some quadratic x + cx + d. Find c in terms of a and b . 1

Team B 9. (7 points) Alex Lishkov is trying to guess sequence of 2009 random ternary digits (0, 1, or 2). After he guesses each digit, he finds out whether he was right or not. If he guesses incorrectly, and k was the correct answer, then an oracle tells him what the next k digits will be. Being Bulgarian, Lishkov plays to maximize the expected number of digits guessed correctly. Let P be the probability that n k Lishkov guesses the n th digit correctly. Find P . Write your answer in the form x + y Re( ρ ), 2009 where x and y are rational, ρ is complex, and k is a positive integer. 10. (7 points) Consider the sequence s = (1 , 2008). Define new sequences s inductively by inserting 0 i the sum of each pair of adjacent terms in s between them—for instance, s = (1 , 2009 , 2008). i − 1 1 For some n , s has exactly one term that appears twice. Find this repeated term. n 2

解析
  1. Let a and b be the two complex roots of the polynomial 2 x + 2 x + 1. Find the smallest degree monic polynomial with integer coefficients with a/b as a root. 6 5 4 3 2 ( ANS: x + 3 x + 10 x + 15 x + 10 x + 3 x + 1. The basic idea is that, if you let the roots be a , b , ( ) ( ) ( ) ( ) ( ) ( ) a a b b c c and c , then you expand out x − x − x − x − x − x − . You get a holy mess b c a c a b that can be reduced to a polynomial in symmetric polynomials and powers of x . CB: IAF) √ √ √