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
With n being a positive integer we would need to have both n−1 and n+1 as perfect squares. But since there is no pair of perfect squares that differ by 2 we know that at least one of n−1 or n+1 will be irrational. Since both of these roots are non-negative, this implies that the sum will always be irrational.
A follow-up question could be: are there any real numbers x≥1 such that x−1+x+1 is rational?
On my first attempt, I've reduced the problem to the question of whether or not there are positive integers a,b and c such that a4−3b4=c2. Haven't found any solutions yet, so I'm seeing if I can prove that there in fact can't be any solutions.
@Calvin Lin Yes, that is the more interesting question. I think that there is a rational solution linked to every primitive Pythagorean triple (a,b,c),a<b<c, such that (at least) one of a,b is a perfect square, and, (letting, say, b be the perfect square), that both (c−b) and (c+b) are perfect squares as well. For example, with b=4,c=5 we have
45−1+45+1=21+23=2.
Another example is the primitive triple (36,77,85). In this case we would have
3685−1+3685+1=67+611=3.
I suppose that for any Pythagorean triple there will be one of the legs b such that both c−b and c+b are perfect squares, so what we require is that this leg b is also a perfect square.
Looking through a list of primitives, other ones that would work are:
(16,63,65), giving a sum of 4;
(17,144,145), giving a sum of 23;
(36,323,325), giving a sum of 6;
(100,621,629), giving a sum of 5.
Now that we know that such rational solutions exist, the next question is to determine how many there are, and if the resulting sums are integers or half-integers. I suspect that since there are an infinite number of primitive triples there will be an infinite number of rational solutions; I'll work on this later.
EDIT: O.k., with c=m2−n2 and b=2mn, where m,n are positive integers with m>n, we have
bc−1+bc+1=n2m.
Then if m=2h2 and n=k2 for positive integers h,k we end up with a sum of k2h.
So it would appear that there are an infinite number of rational solutions. An unexpected result ......
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
With n being a positive integer we would need to have both n−1 and n+1 as perfect squares. But since there is no pair of perfect squares that differ by 2 we know that at least one of n−1 or n+1 will be irrational. Since both of these roots are non-negative, this implies that the sum will always be irrational.
A follow-up question could be: are there any real numbers x≥1 such that x−1+x+1 is rational?
On my first attempt, I've reduced the problem to the question of whether or not there are positive integers a,b and c such that a4−3b4=c2. Haven't found any solutions yet, so I'm seeing if I can prove that there in fact can't be any solutions.
Log in to reply
Since x−1+x+2 is a continuous graph with image of [2,∞), hence there are many real values of x which yield a rational value.
A slightly more interesting question is if there are rational solutions. My suspicion is no.
Log in to reply
@Calvin Lin Yes, that is the more interesting question. I think that there is a rational solution linked to every primitive Pythagorean triple (a,b,c),a<b<c, such that (at least) one of a,b is a perfect square, and, (letting, say, b be the perfect square), that both (c−b) and (c+b) are perfect squares as well. For example, with b=4,c=5 we have
45−1+45+1=21+23=2.
Another example is the primitive triple (36,77,85). In this case we would have
3685−1+3685+1=67+611=3.
I suppose that for any Pythagorean triple there will be one of the legs b such that both c−b and c+b are perfect squares, so what we require is that this leg b is also a perfect square.
Looking through a list of primitives, other ones that would work are:
(16,63,65), giving a sum of 4;
(17,144,145), giving a sum of 23;
(36,323,325), giving a sum of 6;
(100,621,629), giving a sum of 5.
Now that we know that such rational solutions exist, the next question is to determine how many there are, and if the resulting sums are integers or half-integers. I suspect that since there are an infinite number of primitive triples there will be an infinite number of rational solutions; I'll work on this later.
EDIT: O.k., with c=m2−n2 and b=2mn, where m,n are positive integers with m>n, we have
bc−1+bc+1=n2m.
Then if m=2h2 and n=k2 for positive integers h,k we end up with a sum of k2h.
So it would appear that there are an infinite number of rational solutions. An unexpected result ......
It's never rational...
no integer satisfy n. The difference between the square of 2 consecutive integers must be atleast 3.
There is no such integer
Squaring it gives 2n+2n2−1 which means that n2−1 is a perfect square. Hence n=1, but it does not work as 2 is irrational. Thus no solutions.