2018-08-27 重点归纳
AMC10数学竞赛是美国高中数学竞赛中的一项,是针对高中一年级及初中三年级学生的数学测试,该竞赛开始于2000年,分A赛和B赛,于每年的2月初和2月中举行,学生可任选参加一项即可。不管是对高校申请还是今后在数学领域的发展都极其有利!那么接下来跟随小编来看一下AMC10数学竞赛真题以及官方解答吧:
Chloé chooses a real number uniformly at random from the interval . Independently, Laurent chooses a real number uniformly at random from the interval . What is the probability that Laurent's number is greater than Chloé's number?
Denote "winning" to mean "picking a greater number". There is a chance that Laurent chooses a number in the interval . In this case, Chloé cannot possibly win, since the maximum number she can pick is . Otherwise, if Laurent picks a number in the interval , with probability , then the two people are symmetric, and each has a chance of winning. Then, the total probability is
We can use geometric probability to solve this. Suppose a point lies in the -plane. Let be Chloe's number and be Laurent's number. Then obviously we want , which basically gives us a region above a line. We know that Chloe's number is in the interval and Laurent's number is in the interval , so we can create a rectangle in the plane, whose length is and whose width is . Drawing it out, we see that it is easier to find the probability that Chloe's number is greater than Laurent's number and subtract this probability from . The probability that Chloe's number is larger than Laurent's number is simply the area of the region under the line , which is . Instead of bashing this out we know that the rectangle has area . So the probability that Laurent has a smaller number is . Simplifying the expression yields and so .
Scale down by to get that Chloe picks from and Laurent picks from . There are an infinite number of cases for the number that Chloe picks, but they are all centered around the average of . Therefore, Laurent has a range of to to pick from, on average, which is a length of out of a total length of . Therefore, the probability is
There are 10 horses, named Horse , Horse , . . . , Horse . They get their names from how many minutes it takes them to run one lap around a circular race track: Horse runs one lap in exactly minutes. At time all the horses are together at the starting point on the track. The horses start running in the same direction, and they keep running around the circular track at their constant speeds. The least time , in minutes, at which all horses will again simultaneously be at the starting point is . Let be the least time, in minutes, such that at least 5 of the horses are again at the starting point. What is the sum of the digits of
If we have horses, , then any number that is a multiple of the all those numbers is a time when all horses will meet at the starting point. The least of these numbers is the LCM. To minimize the LCM, we need the smallest primes, and we need to repeat them a lot. By inspection, we find that . Finally, .
We are trying to find the smallest number that has one-digit divisors. Therefore we try to find the LCM for smaller digits, such as ,, , or . We quickly consider since it is the smallest number that is the LCM of , , and . Since has single-digit divisors, namely , , , , and , our answer is
以上就是小编对AMC10数学竞赛真题以及解析的介绍,希望对你有所帮助,更多学习资料请持续关注AMC数学竞赛网!
AMC竞赛10A 01-02 AMC竞赛10A 03-04 AMC竞赛10A 05-06 AMC竞赛10A 07-08 AMC竞赛10A 09-10
AMC真题10A 11-12 AMC真题10A 13-14 AMC真题10A 15-16 AMC真题10A 17-18 AMC真题10A 19-20
下一篇: AMC考试都适合什么年龄段的学生参加?