Number of integer solutions to x^2 + y^2 <= n? [simple proof]

  • Context: Graduate 
  • Thread starter Thread starter nickadams
  • Start date Start date
  • Tags Tags
    Integer Proof
Click For Summary

Discussion Overview

The discussion revolves around the proof of the number of integer solutions to the inequality \(x^2 + y^2 \leq n\) using Gelfand's method of coordinates. Participants explore the relationship between the areas of circles and squares, and the mathematical steps involved in deriving an inequality related to the area.

Discussion Character

  • Homework-related
  • Mathematical reasoning
  • Technical explanation

Main Points Raised

  • One participant describes their attempt to prove that a figure \(A_n\) lies entirely within a larger circle and contains a smaller circle, using geometric reasoning involving triangles and the distance formula.
  • Another participant provides a detailed algebraic expansion of inequalities relating the areas of the circles and the number of squares, leading to the conclusion that \(|N - \pi n| < 2\pi(\sqrt{2n} + 1)\).
  • A participant expresses confusion about a specific algebraic manipulation in the proof, questioning how one inequality was transformed into another.
  • Further clarification is provided regarding the reasoning behind changing the bounds of the inequalities, emphasizing the principle of symmetric intervals in inequalities.

Areas of Agreement / Disagreement

Participants generally agree on the algebraic steps involved in deriving the inequalities, but there is some confusion regarding specific transformations and the reasoning behind them. The discussion remains partially unresolved as participants seek clarification on these points.

Contextual Notes

The discussion includes assumptions about the geometric properties of the figures involved and the validity of the algebraic manipulations. Some steps in the proof may depend on specific interpretations of the inequalities and their bounds.

nickadams
Messages
182
Reaction score
0

Homework Statement


I am stuck on a step from a simple proof in Gelfand's method of coordinates.
Here is a link to the part I am confused on. Pg. 44-45...
http://books.google.com/books?id=In...ether with an estimate of its error:"&f=false

It starts in the middle of page 44 and ends right below the part I have highlighted on page 45.

Homework Equations


pi*r^2 is area of a circle.
2*pi*r is the circumference of a circle.
diagonal of a 1 unit^2 square is √(2) units
distance formula is (x1-x2)^2 + (y1-y2)2 = d^2

The Attempt at a Solution


when it asked to prove that "the figure An lies entirely within the circle Kn'' and contains the circle kn' entirely within itself," I came up with an attempt by making a triangle ABC with A at (0,0), B at (Bx,0) and C at (0,Cy) and saying AB + AC < BC

next, using the distance formula, I changed AB to Bx2, AC to Cy2 , and BC to Bx2 + Cy2... That would mean that Bx2 + Cy2 < Bx2 + Cy2 which is clearly impossible! Does that qualify as a proof?

So since Kn'' has a radius that is √(2) bigger than Kn, then if the upper right vertex of a unit square is within the circumference of Kn, then it must also be within the circumference of Kn''. Because in order for it to extend beyond the circumference of Kn'' while still remaining in the circumference of Kn, then it would have to take up a distance larger than √(2) which is not possible for a 1 unit square. Same goes for Kn' not being completely within An because that would mean that one part of a unit square was inside the circumference of Kn' while the upper right hand corner of the same square was out of Kn... Not possible unless it had a straight line distance within the unit square that was longer than √(2).
OOOkay. Now that we have that part out of the way (hopefully it's right), the part I'm confused on is how they got from all the lead up steps to their final conclusion of:

|N-pi*n| < 2*pi(√(2n) + 1)

... I think they are trying to quantify the difference between the unit squares in An and the actual area of circle Kn. So they set minimum and maximum boundaries (Kn' and Kn'' respectively) that can help out. Kn' tells us the smallest circular boundary where An will stay within and Kn'' gives us the largest circle that will still be completely filled by An.

But I'm stuck on how they got the right side of the above inequality... All help will be appreciated; sorry for the long post! :redface:
 
Last edited:
Mathematics news on Phys.org
Hi, Nick,
I have not read in detail your proof, but if you're already convinced than the figure A_n (made of N squares) is entirely contained inside the larger circle, and entirely contains the smaller circle, then it should be clear to you the inequality in the book (just before your highlighting) that expresses the relationship between the areas of these three figures:\pi(\sqrt n - \sqrt 2)^2 &lt; N &lt; \pi(\sqrt n + \sqrt 2)^2
Starting from there, expand the squares to obtain\pi(n - 2\sqrt {2n} + 2) &lt; N &lt; \pi(n + 2\sqrt {2n} + 2)
and now distribute the \pi along the parentheses,\pi n - 2\pi\sqrt {2n} + 2\pi &lt; N &lt; \pi n + 2\pi\sqrt {2n} + 2\pi
subtract \pi n all through,-2\pi\sqrt {2n} + 2\pi &lt; N - \pi n &lt; 2\pi\sqrt {2n} + 2\pi
factor out the common 2\pi,-2\pi(\sqrt {2n} - 1) &lt; N - \pi n &lt; 2\pi(\sqrt {2n} + 1)
and now, as \sqrt {2n} + 1 is a larger positive quantity than \sqrt {2n} - 1 whenever n &gt; 0, you might have just as well said-2\pi(\sqrt {2n} + 1) &lt; N - \pi n &lt; 2\pi(\sqrt {2n} + 1)
which is equivalent to|N - \pi n| &lt; 2\pi(\sqrt {2n} + 1)
So, as you see, it's just some algebra, an almost mechanical "operations on symbols", that take you from one inequality to the other.

Hope this helps!
 
Oh wow thanks Dodo!

But I got stuck on this part of your response...

Dodo said:
-2\pi(\sqrt {2n} - 1) &lt; N - \pi n &lt; 2\pi(\sqrt {2n} + 1) and now, as \sqrt {2n} + 1 is a larger positive quantity than \sqrt {2n} - 1 whenever n &gt; 0, you might have just as well said-2\pi(\sqrt {2n} + 1) &lt; N - \pi n &lt; 2\pi(\sqrt {2n} + 1)
which is equivalent to|N - \pi n| &lt; 2\pi(\sqrt {2n} + 1)
How were you able to change -2\pi(\sqrt {2n} - 1) to -2\pi(\sqrt {2n} + 1) ?

Thanks again
 
nickadams said:
How were you able to change -2\pi(\sqrt {2n} - 1) to -2\pi(\sqrt {2n} + 1) ?

-2\pi\sqrt {2n} - 2\pi &lt; -2\pi\sqrt {2n} + 2\pi

and so

-2\pi(\sqrt {2n} + 1) &lt; -2\pi(\sqrt {2n} - 1)

and you still know -2\pi(\sqrt {2n} + 1) &lt; N - \pi n
 
Hi, Nick,
Wizlem gave you the details, above. The general idea is that, for example, if you know that a number is between -5 and 6, you can also say that it is between -6 and 6... because the latter interval is larger and includes the former. Then, having chosen a symmetric interval, we can now say that our number is no greater than 6 in absolute value. The principle in your case is the same.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 40 ·
2
Replies
40
Views
5K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
4
Views
10K
  • · Replies 20 ·
Replies
20
Views
10K
  • · Replies 39 ·
2
Replies
39
Views
28K
  • · Replies 23 ·
Replies
23
Views
6K