Proof involving the sum of squared integers

  • Thread starter Entropee
  • Start date
  • #1
Entropee
Gold Member
133
0

Homework Statement



Theorem: the numbers in the set {99, 999, 9999, ... } cannot be written as two squared integers, but at least one can be expressed as the sum of 3 squared integers.


Homework Equations



Well there are a lot of examples but lets go with 32 + 32 + 92 = 99

We may have to use Euclid's division algorithm as well.


The Attempt at a Solution



If we call the first part P and the second part Q then we can assume [itex]\neg[/itex]P [itex]\vee[/itex] [itex]\neg[/itex]Q, and try to show a contradiction here.

Homework Statement





Homework Equations





The Attempt at a Solution

 

Answers and Replies

  • #2
35,437
11,856
If we call the first part P and the second part Q then we can assume [itex]\neg[/itex]P [itex]\vee[/itex] [itex]\neg[/itex]Q, and try to show a contradiction here.
What is P, what is Q?

I would consider remainders here.
 
  • #3
Entropee
Gold Member
133
0
Sorry I'm on an ipad and was being lazy haha. Let p stand for "the numbers in that set cannot be written as two squared integers" and Q stand for "at least one number in the set can be represented as three integers squared." How should remainders be used here?
 
  • #4
35,437
11,856
Just show both of them separately, there is no need to start with logical statements. You found an example how at least one of those numbers can be written as sum of three squares. Fine, this part is done. Now you have to show that none of those numbers is the sum of two squares.

How should remainders be used here?
As always. Test if an equality can hold mod some number - if not, it cannot be true at all.
 

Related Threads on Proof involving the sum of squared integers

  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
2
Views
3K
Replies
11
Views
3K
  • Last Post
Replies
4
Views
1K
Replies
4
Views
1K
  • Last Post
Replies
2
Views
943
Replies
5
Views
4K
Replies
3
Views
650
  • Last Post
Replies
14
Views
1K
Top