MathDB
2018 BmMT Individual Tiebreaker Round - Berkley mini Math Tournament

Source:

November 4, 2023
bmmtalgebranumber theorycombinatorics

Problem Statement

p1. A bus leaves San Mateo with nn fairies on board. When it stops in San Francisco, each fairy gets off, but for each fairy that gets off, nn fairies get on. Next it stops in Oakland where 66 times as many fairies get off as there were in San Mateo. Finally the bus arrives at Berkeley, where the remaining 391391 fairies get off. How many fairies were on the bus in San Mateo?
p2. Let aa and bb be two real solutions to the equation x2+8x209=0x^2 + 8x - 209 = 0. Find aba+b\frac{ab}{a+b} . Express your answer as a decimal or a fraction in lowest terms.
p3. Let aa, bb, and cc be positive integers such that the least common multiple of aa and bb is 2525 and the least common multiple of bb and cc is 2727. Find abcabc.
p4. It takes Justin 1515 minutes to finish the Speed Test alone, and it takes James 3030 minutes to finish the Speed Test alone. If Justin works alone on the Speed Test for 33 minutes, then how many minutes will it take Justin and James to finish the rest of the test working together? Assume each problem on the Speed Test takes the same amount of time.
p5. Angela has 128128 coins. 127127 of them have the same weight, but the one remaining coin is heavier than the others. Angela has a balance that she can use to compare the weight of two collections of coins against each other (that is, the balance will not tell Angela the weight of a collection of coins, but it will say which of two collections is heavier). What is the minumum number of weighings Angela must perform to guarantee she can determine which coin is heavier?

PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.