Given $a_{1},a_{2},...,a_{n}$ satisfies, $a_{1}^2+a_{2}^2+...+a_{m}^2=a_{m+1}^2+a_{m+2}^2+...+a_{n}^2$ find one such solution. Here, $a_{1},a_{2},...,a_{n}$ are positive integers and are distinct

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

What is $m$? What is $n$? Must $a_i$ be an integer? Can it be zero? If it is then I can always make a trillion solutions just by saying $a_i$ = 0 for all $i$ ranging from 1 to $n$.

Even if the numbers must be integers and positive, by letting $n$ divisible by 2, I can make infinitely many solutions. (How, I'll leave you to it.)

So, the takeaway? Restrictions!

P/S: Good ideas though, maybe you can capitalize on it by forcing $a_i$ to be all different; that way you can make a pretty fun problem.

Yeah. yes ai is an integer. No, the question is not to find the number of solutions, but one such solution. m,n can be any positive integers you want. I just want a general solution.

Assume now that you agree with me that there exists infinitely many Pythagorean quadruples. Since we have both infinite triples and quadruples, I guess we can find different numbers to just throw in.

For $n<3$, obviously no.

For $n=3$ and $n=4$, sure, why not?

$n=5$ is the tricky part. Back to the drawing table for now. (Hint: $m=4$, and you're using $3$ triples.)

Update: After doing extra research, I can see that there might exist infinitely many answers for $n=5$, but the general formula is unknown to me. However, here is just a solution to $n=5$ to satisfy my curiosity: $195^2+104^2+36^2+48^2=229^2$.

Update 2: Let's call this triple $x^2+y^2=z^2$ for the sake of clarity. Now, you can see there are infinitely many solutions so that $x$ is a multiple of 5. Needless to say, $x$ can be partitioned to $2$ other squares. (The reason, I'll leave you to finding out.) What about $y$? This is a more difficult question, and I haven't had yet an idea to answer. However, you can brute force them to find a solution. And based on my knowledge, there should exist infinitely many solutions (hopefully).

For $n>5$, you can just add in triples and quadruples until you get the necessary value of $n$. Voilà.

@Mohammed Imran
–
Well, as I have mentioned above, it's almost impossible to point out a "general formula" here (considering the lack of definitive $n$), but those are the clues to at least show that there are infinitely many answers.

Also, can I know why you find it tough? To me this is completely undestandable, actually.

Hmm... I do not know, but for me I am heading towards finding all possible solutions, hence the added difficulty.

However, I still don't regard my method as too difficult. I would love to listen on how there's one general formula that actually holds true for all $n$.

Find a suitable $x$ such that $a_{1}^2+a_{2}^2=x^2$ then the problem reduces to $x^2+a_{3}^2+...+a_{m}^2=a_{m+1}^2+...+a_{n}^2$ then find a suitable $y$ such that $a_{m+1}^2+a_{m+2}^2=y^2$. So, doing this process repeatedly on both the L.H.S and the R.H.S until you reach a point where your equation will be of the form: $a^2+a_{m}^2=a_{n}^2$. Now, you know $a_{1},...,a_{m-1},a_{m+1},...,a_{n}$ because we have been substituting suitable values. So, we will have an equation like this: $a^2+a_{m}^2=a_{n}^2$. Now, we can easily solve this using pythagorean triples formula, because we know $a$. Hence we have found a suitable solution.

Huh, that's actually a good idea. The only thing I can see here is that you haven't proved that it's always suitable to find $x$ all the time, thus we can't be completely sure about having infinite solutions.

So, here's my question: How can you prove that there are infinitely many solutions?

The idea of the formula is still insufficient. While there are infinitely many Pythagorean numbers, there are not infinitely many triples for a certain number. This is the dead end here.

Example: Find one 5-tuple $(a,b,c,d,e)$ such that, $a^2+b^2+c^2=d^2+e^2$

Solution: Find a suitable $x$ such that $a^2+b^2=x^2$. One such solution is $a=3, b=4, x=5$. So, the problem reduces to $5^2+c^2=d^2+e^2$. Let $e=13$ then we have $c^2-d^2=144$. So, $(c+d)(c-d)=144$ which implies that $c=37, d=3$. So, one solution set is $(a,b,c,d,e)=(3,4,37,35,13)$

@Mohammed Imran
–
If you do it the way I do, there would be zero problems.

The problem with your method is that you can't ensure that you will be able to find a suitable $x$, and if you can prove that you can always find a suitable $x$ then your proof will be complete.

We want one solution to the equation: $a_{1}^2+a_{2}^2+...+a_{m}^2=a_{m+1}^2+...+a_{n}^2$.

Now, choose a suitable $x$ such that $(a_{1},a_{2},x)$ forms a Pythagorean triple. Now, the problem reduces to finding one solution to $x^2+a_{3}^2+..+a_{m}^2=a_{m+1}^2+...+a_{n}^2$. Now, choose a suitable $x_{1}$ such that $(x,a_{3},x_{1})$ forms a Pythagorean triple. Keep doing this process on both sides until we land on an equation of the form $a^2+a_{m}^2=b^2+a_{n}^2$. Now, since we have been substituting values for $a_{1},a_{2},..,a_{m-1}$, we know the values of $a,b$. So, we can rewrite the equation as $a^2-b^2=a_{n}^2-a_{m}^2$ and solve the equation by "Simon's Factorisation". So, we have found a solution set.

I think I might have just found a way to ensure you can always find a suitable $x$.

Start with an arbitrary $x$ larger than $100$. We need to find a suitable $x_1$, as stated above. Now, do either of these steps:

a/ If $x^2$ is odd, partition it into two numbers, $1$ and itself, then use the equation $x^2=(x_1-a_3)(x_1+a_3)$ to attribute $1$ to $x_1-a_3$ and $x^2$ to $x_1+a_3$. Obviously, $x_1$ and $a_3$ are both larger than $x$.

b/ If $x^2$ is even, divide by $4$ until the number is odd. Then do as above. Again, obviously, $x_1$ and $a_3$ are both larger than $x$ (why, I will let you find out).

As the numbers increase over time, there can't be any repetition in numbers between variables. Thus, we can always find a suitable $x$ satisfying the equation.

@Mohammed Imran
–
This is not trivial at all. Especially this statement: "As the numbers increase over time, there can't be any repetition in numbers between variables." You can't ensure that repetition is impossible. Hence the non-triviality.

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_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in`\(`

...`\)`

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

Sort by:

TopNewestUhh, this is a pretty vague question I believe.

What is $m$? What is $n$? Must $a_i$ be an integer? Can it be zero? If it is then I can always make a trillion solutions just by saying $a_i$ = 0 for all $i$ ranging from 1 to $n$.

Even if the numbers must be integers and positive, by letting $n$ divisible by 2, I can make infinitely many solutions. (How, I'll leave you to it.)

So, the takeaway? Restrictions!

P/S: Good ideas though, maybe you can capitalize on it by forcing $a_i$ to be all different; that way you can make a pretty fun problem.

Log in to reply

Yeah. yes ai is an integer. No, the question is not to find the number of solutions, but one such solution. m,n can be any positive integers you want. I just want a general solution.

Log in to reply

Even then your question is still too vague.

If $2|n$ then $m=\frac{n}{2}$ and $a_i=a_{(m+i)}$.

If $n=2k+1$ (with $k>1$) then $m=k+2$, $a_i=1$ with $i$ ranging from $1$ to $n-1$ and $a_n=4$.

If $n=3$... I don't think I need to introduce to you Pythagorean triples, no?

Even as a bonus, if $n=b^2+c^2$ then $m=b^2$ and $a_i=c$ with $i$ ranging from $1$ to $m$ and $a_j=b$ with $j$ ranging from $m+1$ to $n$.

As long as $n$ is larger than 1... The sky is endless.

Log in to reply

Sorry. All numbers are distinct

Log in to reply

There we go. That should be enough constraints for now. Now we're getting to the fun part.

I guess you can agree with me that there exists infinitely many Pythagorean triples.

Now, what about Pythagorean quadruples? Read it carefully; your answer lies in it.

Assume now that you agree with me that there exists infinitely many Pythagorean quadruples. Since we have both infinite triples and quadruples, I guess we can find different numbers to just throw in.

For $n<3$, obviously no.

For $n=3$ and $n=4$, sure, why not?

$n=5$ is the tricky part. Back to the drawing table for now. (Hint: $m=4$, and you're using $3$ triples.)

Update: After doing extra research, I can see that there

mightexist infinitely many answers for $n=5$, but the general formula is unknown to me. However, here is just a solution to $n=5$ to satisfy my curiosity: $195^2+104^2+36^2+48^2=229^2$.Update 2: Let's call this triple $x^2+y^2=z^2$ for the sake of clarity. Now, you can see there are infinitely many solutions so that $x$ is a multiple of 5. Needless to say, $x$ can be partitioned to $2$ other squares. (The reason, I'll leave you to finding out.) What about $y$? This is a more difficult question, and I haven't had yet an idea to answer. However, you can brute force them to find a solution. And based on my knowledge, there

shouldexist infinitely many solutions (hopefully).For $n>5$, you can just add in triples and quadruples until you get the necessary value of $n$. Voilà.

Log in to reply

Uhh that is a very tough method

Log in to reply

$n$), but those are the clues to at least show that there are infinitely many answers.

Well, as I have mentioned above, it's almost impossible to point out a "general formula" here (considering the lack of definitiveAlso, can I know why you find it tough? To me this is completely undestandable, actually.

Log in to reply

But there is a very easy method!!!

Log in to reply

Hmm... I do not know, but for me I am heading towards finding all possible solutions, hence the added difficulty.

However, I still don't regard my method as too difficult. I would love to listen on how there's one general formula that actually holds true for all $n$.

Log in to reply

There is no general formula, there are infinite solutions. So, maybe I should tell my method now!!!

Log in to reply

Yes, I am more than willing to listen.

Log in to reply

ok sure!!!

Log in to reply

Find a suitable $x$ such that $a_{1}^2+a_{2}^2=x^2$ then the problem reduces to $x^2+a_{3}^2+...+a_{m}^2=a_{m+1}^2+...+a_{n}^2$ then find a suitable $y$ such that $a_{m+1}^2+a_{m+2}^2=y^2$. So, doing this process repeatedly on both the L.H.S and the R.H.S until you reach a point where your equation will be of the form: $a^2+a_{m}^2=a_{n}^2$. Now, you know $a_{1},...,a_{m-1},a_{m+1},...,a_{n}$ because we have been substituting suitable values. So, we will have an equation like this: $a^2+a_{m}^2=a_{n}^2$. Now, we can easily solve this using pythagorean triples formula, because we know $a$. Hence we have found a suitable solution.

Log in to reply

Such that what?

Log in to reply

Such that $a_{1}^2+a_{2}^2=x^2$

Log in to reply

Huh, that's actually a good idea. The only thing I can see here is that you haven't proved that it's always suitable to find $x$ all the time, thus we can't be completely sure about having infinite solutions.

So, here's my question: How can you prove that there are infinitely many solutions?

Log in to reply

Just us pythagorean triplet formula

Log in to reply

The idea of the formula is still insufficient. While there are infinitely many Pythagorean numbers, there are not

infinitelymany triples for a certain number. This is the dead end here.Log in to reply

No I am sorry for partially giving a solution

Log in to reply

Again, your solution does not even

guaranteethere would be a solution for $m$ in any $n$, for the reasons already said above.Log in to reply

Log in to reply

Log in to reply

Also, I am quite busy now

Log in to reply

But I'll definitely post the proper solution for you after a while

Log in to reply

Log in to reply

Log in to reply

Good bye!!!

Log in to reply

You posted a problem related to this right?

Log in to reply

Yes I did. I figure that your idea is good, so I decided to post it and attribute you to it.

Log in to reply

Thank you very much!!!

Log in to reply

That is just awesome!!!

Log in to reply

You do have brilliant thinking skills on brilliant!!!

Log in to reply

Thank you.

Log in to reply

Welcome!!!

Log in to reply

maybye I will eplain you with an eample. Ok?!

Log in to reply

Yeah sure

Log in to reply

Example: Find one 5-tuple $(a,b,c,d,e)$ such that, $a^2+b^2+c^2=d^2+e^2$

Solution: Find a suitable $x$ such that $a^2+b^2=x^2$. One such solution is $a=3, b=4, x=5$. So, the problem reduces to $5^2+c^2=d^2+e^2$. Let $e=13$ then we have $c^2-d^2=144$. So, $(c+d)(c-d)=144$ which implies that $c=37, d=3$. So, one solution set is $(a,b,c,d,e)=(3,4,37,35,13)$

Log in to reply

Well, try $n=10$. Or $n=100$. How can you ensure there would be a solution?

Generalize it and you'll see some problems.

Log in to reply

No. There are infinite pythagorean triples and quadruples. So, there will not be any problems

Log in to reply

The problem with your method is that you can't ensure that you

will be ableto find a suitable $x$, and if you can prove that you canalwaysfind a suitable $x$ then your proof will be complete.Log in to reply

Log in to reply

Your method should be easier if there isn't a small problem, which I will restate again: how do you find a suitable $x$? Is it

alwayspossible?Focus on solving that problem, then your proof will be complete.

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

I am not able to explain my ideas through typing. Is there any other way to do?

Log in to reply

Log in to reply

Log in to reply

Please let me know

Log in to reply

I am sorry I made a mistake when writing the general solution. This solution is only properly correct

Log in to reply

I was in a hurry to post that solution. So a small error occured.

Log in to reply

@Mohammed Imran I will decide to move to this comment for the sake of clarity.

Again, I have still not understood how you would choose the suitable $x$. State your ideas here, if you have any.

Log in to reply

What do you mean new comment?

Log in to reply

State your ideas in a new comment here.

Log in to reply

Log in to reply

We want one solution to the equation: $a_{1}^2+a_{2}^2+...+a_{m}^2=a_{m+1}^2+...+a_{n}^2$.

Now, choose a suitable $x$ such that $(a_{1},a_{2},x)$ forms a Pythagorean triple. Now, the problem reduces to finding one solution to $x^2+a_{3}^2+..+a_{m}^2=a_{m+1}^2+...+a_{n}^2$. Now, choose a suitable $x_{1}$ such that $(x,a_{3},x_{1})$ forms a Pythagorean triple. Keep doing this process on both sides until we land on an equation of the form $a^2+a_{m}^2=b^2+a_{n}^2$. Now, since we have been substituting values for $a_{1},a_{2},..,a_{m-1}$, we know the values of $a,b$. So, we can rewrite the equation as $a^2-b^2=a_{n}^2-a_{m}^2$ and solve the equation by "Simon's Factorisation". So, we have found a solution set.

Log in to reply

I think I might have just found a way to ensure you can always find a suitable $x$.

Start with an arbitrary $x$ larger than $100$. We need to find a suitable $x_1$, as stated above. Now, do either of these steps:

a/ If $x^2$ is odd, partition it into two numbers, $1$ and itself, then use the equation $x^2=(x_1-a_3)(x_1+a_3)$ to attribute $1$ to $x_1-a_3$ and $x^2$ to $x_1+a_3$. Obviously, $x_1$ and $a_3$ are both larger than $x$.

b/ If $x^2$ is even, divide by $4$ until the number is odd. Then do as above. Again, obviously, $x_1$ and $a_3$ are both larger than $x$ (why, I will let you find out).

As the numbers increase over time, there can't be any repetition in numbers between variables. Thus, we can always find a suitable $x$ satisfying the equation.

Q.E.D :)

@Mohammed Imran There you go, got it done.

Note: You will still need to complete the details of this prove, but I can guarantee you that this is right.

Log in to reply

Yeah, that is what I was telling you that you can find suitable x

Log in to reply

This is not trivial after all; you will still need to state the dynamics of your answer.

But yes, now that your answer is complete, you can proudly show it out to everyone.

Log in to reply

Log in to reply

nottrivial at all. Especially this statement: "As the numbers increase over time, there can't be any repetition in numbers between variables." You can't ensure that repetition is impossible. Hence the non-triviality.Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Thank you very much

Log in to reply

Do you want to check my other notes out???

Log in to reply

Steven Jim, do you have any comments??

Log in to reply

Steven Jim, if you are interested for general divisibility criteria of odd numbers, please have a look at my note: "A Question But Not A Doubt 2"

Log in to reply