答案解析请参考文末
Sandwiches at Joe's Fast Food cost each and sodas cost each. How many dollars will it cost to purchase 5 sandwiches and 8 sodas?
Define . What is ?
The ratio of Mary's age to Alice's age is . Alice is years old. How many years old is Mary?
A digital watch displays hours and minutes with AM and PM. What is the largest possible sum of the digits in the display?
Doug and Dave shared a pizza with 8 equally-sized slices. Doug wanted a plain pizza, but Dave wanted anchovies on half of the pizza. The cost of a plain pizza was 8 dollars, and there was an additional cost of 2 dollars for putting anchovies on one half. Dave ate all of the slices of anchovy pizza and one plain slice. Doug ate the remainder. Each then paid for what he had eaten. How many more dollars did Dave pay than Doug?
What non-zero real value for satisfies ?
The rectangle is cut into two congruent hexagons, as shown, in such a way that the two hexagons can be repositioned without overlap to form a square. What is ?
A parabola with equation passes through the points and . What is ?
How many sets of two or more consecutive positive integers have a sum of 15?
For how many real values of is an integer?
Which of the following describes the graph of the equation ?
Rolly wishes to secure his dog with an 8-foot rope to a square shed that is 16 feet on each side. His preliminary drawings are shown.
Which of these arrangements give the dog the greater area to roam, and by how many square feet?
A player pays to play a game. A die is rolled. If the number on the die is odd, the game is lost. If the number on the die is even, the die is rolled again. In this case the player wins if the second number matches the first and loses otherwise. How much should the player win if the game is fair? (In a fair game the probability of winning times the amount won is what the player should pay.)
A number of linked rings, each 1 cm thick, are hanging on a peg. The top ring has an outside diameter of 20 cm. The outside diameter of each of the other rings is 1 cm less than that of the ring above it. The bottom ring has an outside diameter of 3 cm. What is the distance, in cm, from the top of the top ring to the bottom of the bottom ring?
Odell and Kershaw run for 30 minutes on a circular track. Odell runs clockwise at 250 m/min and uses the inner lane with a radius of 50 meters. Kershaw runs counterclockwise at 300 m/min and uses the outer lane with a radius of 60 meters, starting on the same radial line as Odell. How many times after the start do they pass each other?
A circle of radius 1 is tangent to a circle of radius 2. The sides of are tangent to the circles as shown, and the sides and are congruent. What is the area of ?
A license plate in a certain state consists of 4 digits, not necessarily distinct, and 2 letters, also not necessarily distinct. These six characters may appear in any order, except that the two letters must appear next to each other. How many distinct license plates are possible?
How many non-similar triangles have angles whose degree measures are distinct positive integers in arithmetic progression?
Six distinct positive integers are randomly chosen between 1 and 2006, inclusive. What is the probability that some pair of these integers has a difference that is a multiple of 5?
How many four-digit positive integers have at least one digit that is a 2 or a 3?
Two farmers agree that pigs are worth $300 and that goats are worth $210. When one farmer owes the other money, he pays the debt in pigs or goats, with "change" received in the form of goats or pigs as necessary. (For example, a $390 debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way?
Circles with centers and have radii and , respectively. A common internal tangent intersects the circles at and , respectively. Lines and intersect at , and . What is ?
Centers of adjacent faces of a unit cube are joined to form a regular octahedron. What is the volume of this octahedron?
A bug starts at one vertex of a cube and moves along the edges of the cube according to the following rule. At each vertex the bug will choose to travel along one of the three edges emanating from that vertex. Each edge has equal probability of being chosen, and all choices are independent. What is the probability that after seven moves the bug will have visited every vertex exactly once?
Substitute the points and into the given equation for .
Then we get a system of two equations:
Subtracting the first equation from the second we have:
Then using in the first equation:
is the answer.
Alternatively, notice that since the equation is that of a conic parabola, the vertex is likely . Thus, the form of the equation of the parabola is . Expanding this out, we find that .
The points given have the same -value, so the vertex lies on the line .
The -coordinate of the vertex is also equal to , so set this equal to and solve for , given that :
Now the equation is of the form . Now plug in the point and solve for :
Substituting y into the two equations, we get:
Which can be written as:
4, 2, are the solutions to the quadratic. Thus:
If the number of integers in the list is even, then the average will have a . The only possibility is , from which we get:
Thus, the correct answer is 3, answer choice .
The inside diameters of the rings are the positive integers from 1 to 18. The total distance needed is the sum of these values plus 2 for the top of the first ring and the bottom of the last ring. Using the formula for the sum of an arithmetic series, the answer is .
Alternatively, the sum of the consecutive integers from 3 to 20 is . However, the 17 intersections between the rings must be subtracted, and we also get .
Then , and . Hence, .
By symmetry, quadrilateral is a square, so its area is
The problem can be restated as an equation of the form , where is the number of pigs, is the number of goats, and is the positive debt. The problem asks us to find the lowest x possible. and must be integers, which makes the equation a Diophantine equation. Bezout’s Identity tells us that the smallest for the Diophantine equation to have solutions is when is the greatest common divisor of and . Therefore, the answer is , which is ,
Alternatively, note that is divisible by 30 no matter what and are, so our answer must be divisible by 30. In addition, three goats minus two pigs gives us exactly. Since our theoretical best can be achieved, it must really be the best, and the answer is . debt that can be resolved.
Let us simplify this problem. Dividing by , we get a pig to be: , and a goat to be . It becomes evident that if you exchange pigs for goats, we get the smallest positive difference - , since we can't made a non-integer with a linear combination of integers. Since we originally divided by , we need to multiply again, thus getting the answer:
terms without cancellation. For any term in the second expansion to be negative, the parity of the exponents of and must be opposite. Now we find a pattern:
if the exponent of is 1, the exponent of can be all even integers up to 2004, so there are 1003 terms.
if the exponent of is 3, the exponent of can go up to 2002, so there are 1002 terms.
if the exponent of is 2005, then can only be 0, so there is 1 term.
If we add them up, we get terms. However, we can switch the exponents of and and these terms will still have a negative sign. So there are a total of negative terms.
By subtracting this number from 2015028, we obtain or as our answer.
Alternatively, we can use a generating function to solve this problem. The goal is to find the generating function for the number of unique terms in the simplified expression (in terms of ). In other words, we want to find where the coefficient of equals the number of unique terms in .
First, we note that all unique terms in the expression have the form, , where and is some constant. Therefore, the generating function for the MAXIMUM number of unique terms possible in the simplified expression of is
Secondly, we note that a certain number of terms of the form, , do not appear in the simplified version of our expression because those terms cancel. Specifically, we observe that terms cancel when because every unique term is of the form:for all possible .
Since the generating function for the maximum number of unique terms is already known, it is logical that we want to find the generating function for the number of terms that cancel, also in terms of . With some thought, we see that this desired generating function is the following:
Now, we want to subtract the latter from the former in order to get the generating function for the number of unique terms in , our initial goal:which equals
The coefficient of of the above expression equals
Evaluating the expression, we get , as expected.
Define such that . Then the expression in the problem becomes: .
Expanding this using binomial theorem gives , where (we may omit the coefficients, as we are seeking for the number of terms, not the terms themselves).
Simplifying gives: . Note that two terms that come out of different powers of cannot combine and simplify, as their exponent of will differ. Therefore, we simply add the number of terms produced from each addend. By the Binomial Theorem, will have terms, so the answer is .
Using stars and bars we know that has or different terms. Now we need to find out how many of these terms are canceled out by . We know that for any term(let's say ) where of the expansion of is only going to cancel out with the corresponding term if only is odd and is even or is even and is odd. Now let's do some casework to see how many terms fit this criteria:
Case 1: is even
Now we know that is even and . Thus is also even or both and are odd or both and are even. This case clearly fails the above criteria and there are 0 possible solutions.
Case 2: is odd
Now we know that is odd and . Thus is odd and is odd and is even or is even and is odd. All terms that have being odd work.
We now need to figure out how many of the terms have as a odd number. We know that can be equal to any number between 0 and 2006. There are 1003 odd numbers between this range and 2007 total numbers. Thus of the terms will cancel out and of the terms will work. Thus there are terms. This number comes out to be (Author: David Camacho)
This question can be solved fairly directly by casework and pattern-finding. We give a somewhat more general attack, based on the solution to the following problem:
How many ways are there to choose elements from an ordered element set without choosing two consecutive members?
You want to choose numbers out of with no consecutive numbers. For each configuration, we can subtract from the -th element in your subset. This converts your configuration into a configuration with elements where the largest possible element is , with no restriction on consecutive numbers. Since this process is easily reversible, we have a bijection. Without consideration of the second condition, we have:
Now we examine the second condition. It simply states that no element in our original configuration (and hence also the modified configuration, since we don't move the smallest element) can be less than , which translates to subtracting from the "top" of each binomial coefficient. Now we have, after we cancel all the terms where ,
Another way of visualizing the solution above would be to use 's and 's. Denote as the numbers we have chosen and as other numbers. Taking an example, assuming we are picking two numbers, we imagine the shape . This notation forces a number between the two chosen numbers, which blocks the two numbers we picked from being consecutive. Now we consider the orientations with this shape. We have remaining numbers.
We need to find the number of ways to place the remaining 's. We can find this by utilizing stars and bars, with the following marker being placed to represent groups: *| - *|*. Now, we have to place numbers within groups, which is . The same concept can be used for the remaining numbers. The rest of the solution continues as above.
Solution by: Everyoneintexas
We have the same setup as in the previous solution.
Note that if , the answer will be 0. Otherwise, the elements we choose define boxes (which divide the nonconsecutive numbers) into which we can drop the remaining elements, with the caveat that each of the middle boxes must have at least one element (since the numbers are nonconsecutive). This is equivalent to dropping elements into boxes, where each box is allowed to be empty. And this is equivalent to arranging objects, of which are dividers, which we can do in ways.
Now, looking at our original question, we see that the thing we want to calculate is just
以上解析方式仅供参考
学术活动报名扫码了解!免费领取历年真题!
翰林课程体验,退费流程快速投诉邮箱: yuxi@linstitute.net 沪ICP备2023009024号-1