How well can we summarise proofs?
Come up with proofs for the following statements in ten words or less. Who can make the most rigorous, accurate proof in just ten words?
\(1\). Among \(51\) integers from \(1\) to \(100 \) inclusive, there exists two summing to \(101\).
. is a multiple of where is a positive integer.
. The point in equilateral triangle such that is minimised is the center of .
All operations, except for brackets, are words.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
1) There are 50 pairs with sum 101. PHP.
2) 8n−5n≡2n−2n=0(mod3)
Log in to reply
Isn't it supposed to be 8n−5n in the very first step...??
Log in to reply
Yes, typoed it.
Proofs:
1) Gauss' pairing trick paired with pigeonhole principle.
2) = GP with ends 5n−1,8n−1, ratio 1.6, summed thrice.
3) By construction of Fermat point, O=X(13).
Comments:
1) Alliteration 'p's yay! No I really did not want to refer to any language stuff.
2) It is trivial to see that all terms of the GP are integers, and ends refer to initial and final terms. I would have preferred 3∑k=0n−18n−1−k5k but I am not sure how many words would that be.
3) Sorry for the overkill :P But anyway I could have mentioned an equilateral triangle is acute for clarity.
By the way, nice choice of problems!
8n−5n=8n−(8−3)n=3A
2.8^n-5^=(8-5)k
Q.2 It has one factor(8-5) = 3 means it is divisible by 3 Q.3 O is crcumcentre
Log in to reply
Maximum is at the fermat point, not at the circumcentre, although it is true in this case since it is equilateral.
There can be 49 pairs summing to 101
2) If N>=0, 8^N - 5^N = 0 (mod 3)