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:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
Problem:
Prove that the sequence 1,11,111,... contains no perfect squares other than 1.
Solution 1:
Notice that every term after the first term is congruent to 11≡3(mod4). But no square is congruent to 3(mod4), so no term after the first term is a perfect square.
Solution 2:
Observe that
111...11=9999...99=910n−1
for some n∈Z.(n>1)
Assume that
910n−1=k2.
Then
10n−1=9k2=(3k)2
so
10n=(3k)2+1.
But since n>1, by Mihailescu's Theorem, we get a contradiction.
So there are no perfect squares in the sequence except $1$.
Problem 1: Prove that 37 is an irrational number.
Conventional solution:
Prove by Rational Root Theorem. Suppose otherwise, then let x=37 for rational x, equivalently, we have x3−7=0. By rational root theorem, we have ±1,±7 as possible rational solution, however, by trial and error, we can see that none of these values satisfy the equation, which is absurd. Thus, it must be irrational.
Overkill solution:
Prove by Fermat's Last Theorem. Suppose otherwise, then let 37=qp for coprime positive integers p,q. Then 7=q3p3⇒7q3=p3, or 8q3=p3+q3⇒(2q)3=p3+q3 which contradicts Fermat's Last Theorem.
I don't really use the wikis. I did see this somewhere on Brilliant though. Much before the wikis. Maybe it was one of Sreejato's questions. I'm not sure TBH.
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
Problem:
Prove that the sequence 1,11,111,... contains no perfect squares other than 1.
Solution 1:
Notice that every term after the first term is congruent to 11≡3(mod4). But no square is congruent to 3(mod4), so no term after the first term is a perfect square.
Solution 2:
Observe that
111...11=9999...99=910n−1
for some n∈Z.(n>1)
Assume that
910n−1=k2.
Then
10n−1=9k2=(3k)2
so
10n=(3k)2+1.
But since n>1, by Mihailescu's Theorem, we get a contradiction.
So there are no perfect squares in the sequence except $1$.
Problem 1: Prove that 37 is an irrational number.
Conventional solution:
Prove by Rational Root Theorem. Suppose otherwise, then let x=37 for rational x, equivalently, we have x3−7=0. By rational root theorem, we have ±1,±7 as possible rational solution, however, by trial and error, we can see that none of these values satisfy the equation, which is absurd. Thus, it must be irrational.
Overkill solution:
Prove by Fermat's Last Theorem. Suppose otherwise, then let 37=qp for coprime positive integers p,q. Then 7=q3p3⇒7q3=p3, or 8q3=p3+q3⇒(2q)3=p3+q3 which contradicts Fermat's Last Theorem.
Log in to reply
Kind of similar, so adding this as a comment.
* Problem 2: * Prove that n2 is an irrational number for n>2.
* Overkill solution: *
Proof by Fermat's last theorem. Suppose otherwise, then let n2=qp⟹2=qnpn, or 2qn=pn⟹qn+qn=pn, which contradicts Fermat's last theorem.
Log in to reply
Hey, did you stumble upon this Wiki by accident?
Log in to reply
I don't really use the wikis. I did see this somewhere on Brilliant though. Much before the wikis. Maybe it was one of Sreejato's questions. I'm not sure TBH.
Sorry for copying your proof.