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
Base case: When n=1, (2−1)1=2−2−1. m=2 satisfies the equation. P(1) is true.
Inductive step: Assume P(k) is true, where k∈N. Then we must prove that P(k+1) is true as well. Let l be a positive integer satisfying the following equation.
[It only remains to prove that 3l+22l2−2l−1 is a positive integer, which I shall prove later.]
Since the inductive hypothesis is true for k+1, it is true for all integers n≥1.
Thus we have proved that for every n, (2−1)n can be written in the form of m−m−1, where m is a positive integer. □
So basically it remains to prove that
sqrt (2m(m-1)) is an integer, sorry for the l changed to m, but in my post, small/lowercase L could be thought as capital/uppercase i
Sorry for Pranshu Gaba, but I'll take the last part. (changed L to m)
sqrt (m) - sqrt (m-1) = [sqrt (2) - 1]^k. By Newton's binomial theorem, then one of the sqrt (m) and sqrt (m-1) is in form xsqrt(2) for a positive integer x while the other one is an integer, so obviously, this comes sqrt(m(m-1)) is in form ysqrt(2) for a positive integer y, thus, sqrt(2m(m-1)) is an integer. Proof done. What else? Thanks so much for Pranshu Gaba to largely simplify the problem into a lesser form.
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
Base case: When n=1, (2−1)1=2−2−1. m=2 satisfies the equation. P(1) is true.
Inductive step: Assume P(k) is true, where k∈N. Then we must prove that P(k+1) is true as well. Let l be a positive integer satisfying the following equation.
(2−1)k=l−l−1
(2−1)k+1=(l−l−1)(2−1)=(2l+l−1)−(2(l−1)+l)
Since both the terms are positive, we can square them and then sqaure root them.
(2−1)k+1=2l+l−1+2(2l)(l−1)−2(l−1)+l+2(2(l−1))(l)=3l+22l2−2l−1−(3l+22l2−2l−1)−1
[It only remains to prove that 3l+22l2−2l−1 is a positive integer, which I shall prove later.]
Since the inductive hypothesis is true for k+1, it is true for all integers n≥1. Thus we have proved that for every n, (2−1)n can be written in the form of m−m−1, where m is a positive integer. □
Log in to reply
So basically it remains to prove that sqrt (2m(m-1)) is an integer, sorry for the l changed to m, but in my post, small/lowercase L could be thought as capital/uppercase i
Log in to reply
Sorry for Pranshu Gaba, but I'll take the last part. (changed L to m) sqrt (m) - sqrt (m-1) = [sqrt (2) - 1]^k. By Newton's binomial theorem, then one of the sqrt (m) and sqrt (m-1) is in form xsqrt(2) for a positive integer x while the other one is an integer, so obviously, this comes sqrt(m(m-1)) is in form ysqrt(2) for a positive integer y, thus, sqrt(2m(m-1)) is an integer. Proof done. What else? Thanks so much for Pranshu Gaba to largely simplify the problem into a lesser form.
Can we generalize it into sqrt(m+1) - sqrt(m) for every m, element of R+, instead of only for m = 1?