Number Theory Problem (sums of consecutive squares)

Click For Summary

Homework Help Overview

The problem involves the exploration of sums of consecutive squares, specifically proving that the sum of m consecutive squares cannot be a square for m = 3, 4, 5, and 6, and finding an example of eleven consecutive squares whose sum is a square.

Discussion Character

  • Exploratory, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the use of formulas for the sum of squares and explore algebraic manipulations to prove the impossibility of certain sums being squares. There are considerations of modular arithmetic and the divisibility of expressions involved. Some participants suggest specific values for variables to test their hypotheses.

Discussion Status

There are various approaches being explored, with some participants providing algebraic insights and others questioning the correctness of calculations. Guidance has been offered regarding the factors involved and potential values for variables, but no consensus has been reached on a definitive method or solution.

Contextual Notes

Participants are working under the constraints of proving impossibilities for certain cases and finding specific examples, which may involve complex algebraic reasoning and assumptions about divisibility.

evansmiley
Messages
15
Reaction score
0

Homework Statement



The sum of two consecutive squares can be a square: for instance, 32 + 42 = 52

(a) Prove that the sum of m consecutive squares cannot be a square for
the cases m = 3; 4; 5; 6.
(b) Find an example of eleven consecutive squares whose sum is a square.

The Attempt at a Solution


The only thing i can think of using is the formula for the sum of square numbers e.g. for part one for the case where m = 3, it simplifies to
3n2 -6n + 5 = a2. I don't know how to prove this cannot be a square. (or e.g. in part b) -
(n)(n+1)(2n+1)/6 - (n-11)(n-10)(2n-21)/6 = a2 which simplifies to 11(n2 -10n + 385) = a2
This would suggest to me that a is divisible by 11, however I'm not sure how to generate a number such that it is equal to a square - I've thought of maybe trying to substitute a value for n which will allow me to factor the l.h.s. into a square, and then i'd be done, however I don't have a clue. Is this even the right direction to be going in? Or is there some easy way to solve this with modular arithmetic? Thanks in advance!
 
Physics news on Phys.org
This might help: The term in parenthesis must have a factor of 11. The 385 is already divisible by 11, so the n2-10n must be divisible by 11. The 385 divided by 11 is equal to 35. Therefore, n2-10n divided by 11, when added to 35 must be a perfect square. The factors of n2-10n are n and n-10. Therefore, n is either 11k, or 11k+10, where k is an integer. Find the value of k that works.
 
For the case considering m = 3, you got 3n^2 -6n + 5 = a^2.

So now, all integers can be represented as 3k, 3k+1, or 3k+2. Try checking what remainders the squares of these general numbers give, when divided by 3, and apply the same idea to your equation too.

Also, a good idea of choosing the numbers would be (n-1), (n), (n+1) since its easier to calculate :)
 
This refers to my post #2. The value of k that works is k=1, and n = 11. With n = 11, a = 6x11=66.
 
I checked your algebra in obtaining the equation 11(n2 -10n + 385) = a2, and got a different result: (66n2-661n+2310)/6 = a2
 

Similar threads

Replies
14
Views
5K
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 39 ·
2
Replies
39
Views
7K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 68 ·
3
Replies
68
Views
12K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
7
Views
4K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K