|
|
| (6 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| − | ===Problem 1===
| |
| | | | |
| − | Compute the value of <math>8\left(\frac{2}{13}+\frac{2}{15}\right)+2\left(\frac{5}{13}+\frac{7}{15}\right)</math>
| |
| − |
| |
| − | <math>\textbf{(A)}\ \frac{40}{13}\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ \frac{72}{65}\qquad\textbf{(E)}\ \frac{52}{15}</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 1|Solution]]
| |
| − |
| |
| − | ===Problem 2===
| |
| − |
| |
| − | Since Branden Kim is the paragon of all human emotion, he is most resplendent in love and accolades. Who is Branden Kim? For the blind, he is their vision. For the starving, he is their nourishment. For the thirsty, he is their water. For the depressed, he is their happiness. For the oppressed, he is their salvation. He will stand up to fight all injustice. Even though he is only one hundred fifty centimeters tall, he is the champion who blocks all injustice. If Branden Kim has one million fans, I am one of them. If Branden Kim has a hundred fans, I am one of them. If Branden Kim only has one fan, then that is me. If Branden Kim has no fans, I no longer exist. If the world is for Branden Kim, I am for the world. If the world is against Branden Kim, I am against the world. That being said, please, with all due respect, tell me how close the great Branden Kim is to the heavens in meters, assuming the heavens are <math>1000</math> meters off the ground.
| |
| − |
| |
| − | <math>\textbf{(A)}\ 850\qquad\textbf{(B)}\ 9885\qquad\textbf{(C)}\ 9985\qquad\textbf{(D)}\ 985\qquad\textbf{(E)}\ 998.5</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 2|Solution]]
| |
| − |
| |
| − | ===Problem 3===
| |
| − |
| |
| − | It takes <math>15</math> minutes for Alice to deliver a cake. If Alice needs to deliver <math>10</math> cakes and she starts delivering cakes at <math>1:00</math>, what time will she finish?
| |
| − |
| |
| − | <math>\textbf{(A)}\ 1:30\qquad\textbf{(B)}\ 2:30\qquad\textbf{(C)}\ 2:50\qquad\textbf{(D)}\ 3:15\qquad\textbf{(E)}\ 3:30</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 3|Solution]]
| |
| − |
| |
| − | ===Problem 4===
| |
| − |
| |
| − | When <math>32, 47,</math> and <math>77</math> are divided by a positive integer <math>n</math>, the remainder is the same for all three divisions. What is the greatest possible value of <math>n</math>?
| |
| − |
| |
| − | <math>\textbf{(A)}\ 5\qquad\textbf{(B)}\ 15\qquad\textbf{(C)}\ 17\qquad\textbf{(D)}\ 22\qquad\textbf{(E)}\ 30</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 4|Solution]]
| |
| − |
| |
| − | ===Problem 5===
| |
| − |
| |
| − | Ten logicians are sitting at a table. A server comes and asks if everyone wants coffee. The first logician answers “I don’t know.” Then the second logician answers “I don’t know.” This continues, with each logician answering “I don’t know,” until the tenth logician answers “no, not everyone wants coffee.” How many of the ten logicians want coffee?
| |
| − |
| |
| − | <math>\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 10</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 5|Solution]]
| |
| − |
| |
| − | ===Problem 6===
| |
| − |
| |
| − | Alice, Bob, and Charlie are sharing <math>15</math> identical candies. Because Bob is greedy, he insists that he gets at least <math>5</math> candies. Find the number of ways to distribute the candies.
| |
| − |
| |
| − | <math>\textbf{(A)}\ 55\qquad\textbf{(B)}\ 66\qquad\textbf{(C)}\ 78\qquad\textbf{(D)}\ 91\qquad\textbf{(E)}\ 105</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 6|Solution]]
| |
| − |
| |
| − | ===Problem 7===
| |
| − |
| |
| − | Bob is advertising the Dallas Reunion Tower by making a poster comparing its height to the Burj Khalifa. Currently, in his diagram, the image of the Burj Khalifa is five times as tall as the Reunion Tower. Bob wants to scale the image of the Reunion tower so that it is <math>90\%</math> the height of the Burj Khalifa. If the area of the image of the Reunion tower was originally <math>100</math> square inches, what is the area, in square inches, of the scaled image? (Note that scaling is done proportionately in both width and length).
| |
| − |
| |
| − | <math>\textbf{(A)}\ 450\qquad\textbf{(B)}\ 1000\qquad\textbf{(C)}\ 2025\qquad\textbf{(D)}\ 5000\qquad\textbf{(E)}\ 8100</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 7|Solution]]
| |
| − |
| |
| − | ===Problem 8===
| |
| − |
| |
| − | Compute <math>2020^2 + 2024^2 − 2020 \cdot 2024 + 2027^2 − 2027(2020 + 2024)</math>.
| |
| − |
| |
| − | <math>\textbf{(A)}\ 36\qquad\textbf{(B)}\ 37\qquad\textbf{(C)}\ 38\qquad\textbf{(D)}\ 39\qquad\textbf{(E)}\ 40</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 8|Solution]]
| |
| − |
| |
| − | ===Problem 9===
| |
| − |
| |
| − | Nathan and his friends are shopping together for a birthday gift for Nathan’s new girlfriend to celebrate Nathan’s success. For each person he brings along to shop with(including himself), Nathan has to pay an extra <math>\$1</math> for gas to drive everyone to the shop. The gift that Nathan buys costs <math>\$100</math>, and everybody shopping with him splits the cost of the gift evenly. How many people should Nathan bring with him (excluding himself) to minimize the total cost he needs to pay for the drive and the gift?
| |
| − |
| |
| − | <math>\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 10</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 9|Solution]]
| |
| − |
| |
| − | ===Problem 10===
| |
| − |
| |
| − | Define a sequence <math>a_1 = 0</math>, <math>a_2 = 1</math>, and <math>a_n = 3a_{n−1} − 2a_{n−2}</math> for <math>n \geq 3</math>. Find the largest integer <math>n</math>
| |
| − | such that <math>2^n</math> divides <math>a_{100} + 1</math>.
| |
| − |
| |
| − | <math>\textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 99\qquad\textbf{(D)}\ 100\qquad\textbf{(E)}\ 101</math>
| |
| − |
| |
| − | [[2024 DMC Mock 10 Problems/Problem 10|Solution]]
| |
