N=a²+b²-c², show that it's true for any integer n,a,b,c

  • Context: Undergrad 
  • Thread starter Thread starter Born2Perform
  • Start date Start date
  • Tags Tags
    Integer
Click For Summary

Discussion Overview

The discussion revolves around the equation n = a² + b² - c² and whether it holds true for any integer n, with a, b, and c also being integers. Participants explore various cases and conditions under which the equation might be valid, including specific integer values and the nature of odd and even integers.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • The original poster (OP) seeks guidance on how to approach the problem, suggesting a potential trick to solve it.
  • One participant points out that for n = 0 and a = b = c = 1, the equation does not hold, indicating that there may be more complexity to the problem.
  • Another participant interprets the problem as needing to show that any integer n can be expressed as a² + b² - c² for integer values of a, b, and c.
  • A different participant suggests that by setting a = 0, one can construct odd integers using the difference of two squares, b² - c², and notes that many even integers can also be formed this way.
  • Another participant provides specific formulations for even and odd integers, suggesting that n can be expressed in terms of k, where k is an integer.
  • There is a clarification that zero is indeed an even number, and its treatment as a separate case is discussed.
  • One participant mentions that zero can be expressed in multiple ways, including as a difference of squares, and discusses the conditions under which integers can be expressed as a difference of two squares based on their factors.

Areas of Agreement / Disagreement

Participants express differing views on the interpretation of the problem and the validity of the equation for specific cases. There is no consensus on a definitive solution or approach, and multiple competing perspectives on the conditions under which the equation holds are present.

Contextual Notes

Some participants note the importance of distinguishing between odd and even integers and the implications of treating zero as a separate case. There are unresolved mathematical steps and assumptions regarding the generality of the equation.

Born2Perform
Messages
80
Reaction score
0
n=a²+b²-c², show that it's true for any integer n,a,b,c

its an exercise of the math olympiad of my city... i know i should have posted at least a bit of my work, but i think there is a trick to solve this category of problems that i dnt know...where should i start?
 
Mathematics news on Phys.org
Certainly there is more to the problem. For example, pick n = 0 and a = b = c = 1. Then the equation is not true.
 
e(ho0n3 said:
Certainly there is more to the problem. For example, pick n = 0 and a = b = c = 1. Then the equation is not true.
i think it was meant as "pick an integer n, now show it can always been written as a²+b²-c², where a,b,c are integers also" i just adapted the text becasue had problems with the translation
 
The following works for me. First let a=0 and consider what integers you can construct with just the difference of two sqaures [tex]b^2 - c^2[/tex]. By considering the expansion you should easily be able to show that any odd number can be composed from the difference of the two squares alone.

Actually lots of even numbers can be made from the difference of the two sqaures as well, though not all. For example it's also easy to show that all integers that are a multiple of 4 can also be contructed, though you don't even need that result here. Once you've establish that b^2-c^2 can make any odd number then just leave a=0 for odd numbers and set a=1 to make all the evens.
 
Last edited:
n must be even or odd or 0.
The case of n=0 is trivial, a=b=c=0

n is even: n=2k, k=1,2,...
2k= 1^2 + k^2 - (k-1)^2

n is odd: n=2k-1, k=1,2,...
(2k-1)= 0^2 + k^2 - (k-1)^2
 
Last edited:
n must be even or odd or 0
Actually zero is an even number.
 
uart said:
Actually zero is an even number.

Yes, you are right. But, here as the case of n=0 gives rise to a trivial solution of all 0's (a=b=c=0), I separately mentioned the case notwithstanding it was a repetition.
As a matter of fact, the values of 'k' I mentioned, should be k=...-2,-1,0,1,2,...
 
Last edited:
Yeah it was ok to treat zero as a separate case here, though not totally required. Many of the numbers have multiple ways of being expressed. For example zero could just as easily have been expressed as [tex]0 = 1^2 + 0^2 - 1^2[/tex], which is again just one plus an odd number and not a special case.

The result that I was hoping that the OP would come to by himself (by looking at the expansion of the difference of the two sqaures) was that any integer that can be expressed as a product of two factors can be expressed as a difference of two squares provided that those two factors differ by an even number. This of course means that any number that can be factored as odd times odd or even times even can be expressed as a difference of two squares. That in turn implies that all odd numbers and every second even number can be expressed in this way.
 

Similar threads

Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
30K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 105 ·
4
Replies
105
Views
11K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K