[Value = 7 points]
How many ordered four-tuples of integers (a,b,c,d) are there such that:
(i) 0 < a < b < c < d < 500
(ii) a + d = b + c
(iii) bc - ad = 93
Tuesday, May 31, 2011
Monday, May 30, 2011
Summer Problem Solving Marathon Question #2
[Value = 3 points]
Each side of triangle ABC is length 12. D is the foot of the perpendicular dropped from A on BC, and E is the midpoint of AD. What is the length of BE?
Each side of triangle ABC is length 12. D is the foot of the perpendicular dropped from A on BC, and E is the midpoint of AD. What is the length of BE?
Labels:
Question
Summer Problem Solving Marathon Solution #1
Let x and y be the two numbers. Then we are told x + y = 10, and xy = 20. We want to find 1⁄x + 1⁄y.
Converting both fractions to the common denominator xy, we get y⁄xy + x⁄xy, or (x+y)⁄xy.
Substituting our starting values for x + y and xy, we have 10⁄20, or 1⁄2.
[Put any questions, objections, or alternative solutions in the comments.]
Converting both fractions to the common denominator xy, we get y⁄xy + x⁄xy, or (x+y)⁄xy.
Substituting our starting values for x + y and xy, we have 10⁄20, or 1⁄2.
[Put any questions, objections, or alternative solutions in the comments.]
Friday, May 27, 2011
Summer Problem Solving Marathon Question #1
[Value = 2 points]
The sum of two numbers is ten, and their product is twenty. What is the sum of their reciprocals?
The sum of two numbers is ten, and their product is twenty. What is the sum of their reciprocals?
Labels:
Question
Monday, November 29, 2010
Splitting Points
From Five Hundred Mathematical Challenges:
Prove that if an even number of points are placed in a plane, it is always possible to draw a line such that half of the points are on one side of the line, and half the points are on the other side.
Prove that if an even number of points are placed in a plane, it is always possible to draw a line such that half of the points are on one side of the line, and half the points are on the other side.
Friday, November 19, 2010
Dealing Cards
Mildly adapted from the 1895 Eötvös competition:
You have a deck of n cards, to be dealt to two players. The players do not have to receive the same number of cards. How many ways are there to do the dealing?
You have a deck of n cards, to be dealt to two players. The players do not have to receive the same number of cards. How many ways are there to do the dealing?
Wednesday, November 17, 2010
Some More Number Theory
From the 1901 Eötvös Contest:
Let n be a positive integer. Prove that 1n + 2n + 3n + 4n is divisible by 5 if and only if n is not divisible by 4.
Let n be a positive integer. Prove that 1n + 2n + 3n + 4n is divisible by 5 if and only if n is not divisible by 4.
Subscribe to:
Posts (Atom)