Discuss the following “proof” of the (false) theorem:
If n is any positive integer and S is a set containing exactly n real numbers, then all the numbers in S are equal:
PROOF BY INDUCTION:
If , the result is evident.
Step 2: By the induction hypothesis the result is true when ; we must prove that it is correct when . Let S be any set containing exactly real numbers and denote these real numbers by . If we omit from this list, we obtain exactly k numbers ; by induction hypothesis these numbers are all equal:
If we omit from the list of numbers in S, we again obtain exactly k numbers ; by the induction hypothesis these numbers are all equal:
It follows easily that all numbers in S are equal.
Comments, observations are welcome 🙂
We know the following facts very well:
But, you can quickly verify that:
I call it — simply stunning beauty of elementary algebra of factorizations and expansions
Continuing this series of slightly vexing questions, we present below:
1. Prove the inequality , where all the variables are positive numbers.
2. A sequence of numbers: Find a sequence of numbers , , whose elements are positive and such that and for . Show that there is only one such sequence.
3. Points in a plane: Consider several points lying in a plane. We connect each point to the nearest point by a straight line. Since we assume all distances to be different, there is no doubt as to which point is the nearest one. Prove that the resulting figure does not containing any closed polygons or intersecting segments.
4. Examination of an angle: Let , be positive numbers. We choose in a plane a ray OX, and we lay off it on a segment . Then, we draw a segment perpendicular to and next a segment perpendicular to . We continue in this way up to . The right angles are directed in such a way that their left arms pass through O. We can consider the ray OX to rotate around O from the initial point through points , (the final position being ). In doing so, it sweeps out a certain angle. Prove that for given numbers , this angle is smallest when the numbers , that is, decrease; and the angle is largest when these numbers increase.
5. Area of a triangle: Prove, without the help of trigonometry, that in a triangle with one angle the area S of the triangle is given by the formula and if , then .
More later, cheers, hope you all enjoy. Partial attempts also deserve some credit.
Actually, this is a famous problem. But, I feel it is important to attempt on one’s own, proofs of famous questions within the scope of RMO and INMO mathematics. And, then compare one’s approach or whole proof with the one suggested by the author or teacher of RMO/INMO.
How farthest from the edge of a table can a deck of playing cards be stably overhung if the cards are stacked on top of one another? And, how many of them will be overhanging completely away from the edge of the table?
I will post it when I publish the solution lest it might affect your attempt at solving this enticing mathematics question !
Please do not try and get the solution from the internet.
If a, b, c are three rational numbers, then prove that
is always the square of a rational number.
Solution to be posted soon…
Mengoli posed the following series to be evaluated:
Some great mathematicians, including Leibnitz, John Bernoulli and D’Alembert, failed to compute this infinite series. Euler established himself as the best mathematician of Europe (in fact, one of the greatest mathematicians in history) by evaluating this series initially, by a not-so-rigorous method. Later on, he gave alternative and more rigorous ways of getting the same result.
Can you show that the series converges and gets an upper limit? Then, try to evaluate the series.
Solution will be posted soon.
Prove by mathematical induction, the following:
1) for all .
2) Establish the Bernoulli inequality: If , then for all natural numbers greater than or equal to 1.
3) For all with prove the following by mathematical induction:
Solutions will be put up tomorrow!
Olympiads — Homi Bhabha Centre for Science Education: