Two different sums!

If m = 2 m m = n = 2 n n 2 \large\displaystyle\sum_{m=2}^{m}m = \displaystyle \sum_{n=2}^{n}n^2 Then find the minimum value of m + n m+n .


The answer is 15.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Naren Bhandari
Feb 6, 2018

1 + 2 + + M = 1 2 + 2 2 + + N 2 M ( M + 1 ) 2 = N ( N + 1 ) ( 2 N + 1 ) 6 3 M 2 + 3 M N ( N + 1 ) ( 2 N + 1 ) = 0 M = 3 + 3 ( 8 N 3 + 12 N 2 + 4 N + 3 ) 6 \begin{aligned} & 1+2+\cdots + M = 1^2+2^2+\cdots + N^2 \\& \frac{M(M+1)}{2} = \frac{N(N+1)(2N+1)}{6} \\& 3M^2 +3M -N(N+1)(2N+1) = 0 \\ & M = \frac{-3 + \sqrt{3 (8N^3+12N^2 +4N+3)}}{6} \end{aligned} Now noting the discriminant of above equation D = 8 N 3 + 12 N 2 + 4 N + 3 = 8 ( N + 1 2 ) 3 2 ( N + 1 2 ) + 3 = X 3 X + 3 c c c c c c let x = 2 ( N + 1 2 ) \begin{aligned} & D = 8N^3+ 12N^2 +4N +3 \\& = 8\left(N+\frac{1}{2}\right)^3- 2\left(N+\frac{1}{2}\right)+3 \\ & = X^3 -X +3 \phantom{cccccc} \text{let x} = 2\left(N+\frac{1}{2}\right)\end{aligned} It is vivid that discriminant D D in the above equation will be perfect square iff D = 3 Y 2 X 3 X + 3 = 3 Y 2 ( a ) \begin{aligned} & D = 3Y^2 \\ & X^3 -X+3 = 3Y^2 \cdots(a)\end{aligned} The solution of equations a a has been provided by Saburô Uchiyama and one can Google it as Solution of a Diophantine equation by sabur o ˆ Uchiyama \text{ Solution of a Diophantine equation by saburô Uchiyama}

So the solution for M , N M,N can be interred as ( 10 , 5 ) (10,5) , ( 13 , 6 ) (13,6) , ( 645 , 85 ) (645,85)

Aswin Ramesh
Jan 26, 2018

The actual answer to the original(unedited) question was 2 , where both m=n=1 . But assuming both m and n greater than 3 , we will get (10,5)

How should I read your indices? Technically if m=1 you sum 1 from 1 to 2, but since m = 1, you can't sum m = 2? Same for n?

Peter van der Linden - 3 years, 4 months ago

Log in to reply

well, the thing is , the question has been edited. If memory serves, i believe the original question was 1+2+3...+m= 1^2 + 2^2 + 3^2 + ......n^2

Aswin Ramesh - 3 years, 4 months ago

Log in to reply

Aah though it was supposed to be something like that. Then indice m=2 should be changed to I for example and sum over I to m. Would make more sensne

Peter van der Linden - 3 years, 4 months ago

Have look at solution once for more info that I have posted ?

Naren Bhandari - 3 years, 4 months ago

Log in to reply

yes i did look at your solution, i agree with it

Aswin Ramesh - 3 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...