2018-09-03 重点归纳
AMC12是针对高中学生的数学测验,该竞赛开始于2000年,分A赛和B赛,于每年的2月初和2月中举行,学生可任选参加一项即可。其主要目的在于激发学生对数学的兴趣,参予AMC12的学生应该不难发现测验的问题都很具挑战性,但测验的题型都不会超过学生的学习范围。这项测验希望每个考生能从竞赛中享受数学。那么接下来跟随小编来看一下AMC12的官方真题以及官方解答吧:
How many ordered triples of positive integers satisfy and ?
We prime factorize and . The prime factorizations are , and , respectively. Let , and . We know thatand since isn't a multiple of 5. Since we know that . We also know that since that . So now some equations have become useless to us...let's take them out.are the only two important ones left. We do casework on each now. If then or . Similarly if then . Thus our answer is .
It is well known that if the and can be written as , then the highest power of all prime numbers must divide into either and/or . Or else a lower is the .
Start from : so or or both. But because and . So .
can be in both cases of but NOT because and .
So there are six sets of and we will list all possible values of based on those.
because must source all powers of . . because of restrictions.
By different sourcing of powers of and ,
is "enabled" by sourcing the power of . is uncovered by sourcing all powers of . And is uncovered by and both at full power capacity.
Counting the cases,
As said in previous solutions, start by factoring and . The prime factorizations are as follows:To organize and their respective LCMs in a simpler way, we can draw a triangle as follows such that are the vertices and the LCMs are on the edges.Now we can split this triangle into three separate ones for each of the three different prime factors .Analyzing for powers of , it is quite obvious that must have as one of its factors since neither can have a power of exceeding . Turning towards the vertices , we know at least one of them must have as its factors. Therefore, we have ways for the powers of for since the only ones that satisfy the previous conditions are for ordered pairs . Powers of .Using the same logic as we did for powers of , it becomes quite easy to note that must have as one of its factors. Moving onto , we can use the same logic to find the only ordered pairs that will work are . Uh oh, where da diagram? The final and last case is the powers of .This is actually quite a simple case since we know must have as part of its factorization while cannot have a factor of in their prime factorization.
Multiplying all the possible arrangements for prime factors , we get the answer:.
Three numbers in the interval are chosen independently and at random. What is the probability that the chosen numbers are the side lengths of a triangle with positive area?
WLOG assume is the largest. Scale the triangle to or Then the solution is (Insert graph with square of side length 1 and the line that cuts it in half)
WLOG, let the largest of the three numbers drawn be . Then the other two numbers are drawn uniformly and independently from the interval . The probability that their sum is greater than is
When , consider two cases:
1) , then
2), then
is the same. Thus the answer is .
The probability of this occurring is the volume of the corresponding region within a cube, where each point corresponds to a choice of values for each of and . The region where, WLOG, side is too long, , is a pyramid with a base of area and height , so its volume is . Accounting for the corresponding cases in and multiplies our answer by , so we have excluded a total volume of from the space of possible probabilities. Subtracting this from leaves us with a final answer of .
The probability of this occurring is the volume of the corresponding region within a cube, where each point corresponds to a choice of values for each of and . We take a horizontal cross section of the cube, essentially picking a value for z. The area where the triangle inequality will not hold is when , which has area or when or , which have an area of Integrating this expression from 0 to 1 in the form
WLOG assume that is the largest number and hence the largest side. Then . We can set up a square that is by in the plane. We are wanting all the points within this square that satisfy . This happens to be a line dividing the square into 2 equal regions. Thus the answer is .
[][] diagram for this problem goes here (z by z square)
The triangle inequality simplifies to considering only one case: . Consider the complement (the same statement, except with a less than or equal to). Assume (WLOG) is the largest, so on average (now equal to becomes a degenerate case with probability , so we no longer need to consider it). We now want , so imagine choosing at once rather than independently. But we know that is between and . The complement is thus: . But keep in mind that we choose each and randomly and independently, so if there are ways to choose together, there are ways to choose them separately, and therefore the complement actually doubles to match each case (a good example of this is to restrict b and c to integers such that if , then we only count this once, but in reality: we have two cases , and ; similar reasoning also generalizes to non-integral values). The complement is then actually . Therefore, our desired probability is given by
以上就是小编对AMC12数学竞赛试题及答案的介绍,希望对你有所帮助,更多学习资料请持续关注AMC数学竞赛网!
上一篇: AMC 10 |运动的相似三角形
下一篇: AMC考试都适合什么年龄段的学生参加?