A hyperbola H with equation x y = n (where n ≤ 1 0 0 0 ) is rotated 4 5 ∘ to obtain the hyperbola H ′ . Let the positive difference between the number of lattice points on H and H ′ be D . Given that both H and H ′ have at least one lattice point, find the maximum possible value of D .
Details and Asumptions: A lattice point is a point that has integer x - and y -coordinates.
You may want to look at the list of Highly Composite Numbers .
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.
You forgot an important detail. If n is odd, then the equation x 2 − y 2 = 2 n has no solutions. (You can see this from your equation a b = n / 2 .)
For n = 9 4 5 , H has 32 lattice points, and H ′ has zero lattice points, so D = 3 2 . This is the maximum for n ≤ 1 0 0 0 .
Log in to reply
Aw darn, I originally had my answer as 32, then I changed it but forgot to change the wording of the problem. Sorry. It's fixed now.
Log in to reply
Wait what you had to fix the wording? @Calvin Lin Violation!
Log in to reply
@Finn Hulse – @Finn Hulse That is the intention of the report system, so that problem creators can quickly fix any potential issues, like missing/unclear conditions, by editing the problem suitably. This question has been updated in a suitably timely manner.
There is a huge difference between that and "I'm going to ignore all of the reports that I get and insist repeatedly that my answer is correct and everyone else is wrong". When people give you feedback, you should consider what they are saying and not be dismissive of it.
Log in to reply
@Calvin Lin – Aww I'm sorry dude. I'll try not to do that but you saw my comment on the other note right?
@Daniel Liu I think he's right. I got 32 as well. :O
I have updated this such that those who answered 32 previously have been marked correct.
I am still getting 32 :(
Log in to reply
H' has no lattice point for n like 945...updated question necessitates at least one lattice point. So n will be even.
Problem Loading...
Note Loading...
Set Loading...
We should first try to find an equation for the hyperbola H ′ before attempting anything else. But how do we rotate an object? The answer is, of course, polar coordinates!
We substitute x = r cos θ and y = r sin θ into H to get
( r cos θ ) ( r sin θ ) = n
To do a rotation of 4 5 ∘ , we plug in θ + 4 5 for θ :
( r cos ( θ + 4 5 ) ) ( r sin ( θ + 4 5 ) ) = n
Now we can use the angle sum formulas for sin and cos :
( r ( cos θ cos 4 5 − sin θ sin 4 5 ) ) ( r ( sin θ cos 4 5 + cos θ sin 4 5 ) ) = n
We can use the distributive property and substitute back r cos θ = x and r sin θ = y to get
( x cos 4 5 − y sin 4 5 ) ( y cos 4 5 + x sin 4 5 ) = n
We know that sin 4 5 = cos 4 5 = 2 1 :
( 2 1 ( x − y ) ) ( 2 1 ( x + y ) ) = n
Simplifying:
2 1 ( x + y ) ( x − y ) = n
Which gives us the final equation for our hyperbola H ′ as:
x 2 − y 2 = 2 n
Now we must count the number of lattice points of H and H ′ .
The number of lattice points of H (call this L ) is not hard to figure out: We have the equation x y = n ,so it is simply L = 2 × ( number of factors of n ) . We multiply the number of factors of n by 2 because x and y can both be negative or positive.
The number of lattice points of H ′ (call this L ′ ) is a little harder to figure out. We can first refactor the equation to ( x + y ) ( x − y ) = 2 n Note that since x , y are both integers, x + y , x − y must both be even or both be odd. Since 2 n is an even number, they must both be even. Thus, we must have that both x + y and x − y contribute a factor of 2 . Thus, we can substitute x + y = 2 a and x − y = 2 b to get the simplified equation a b = 2 n
We know how to solve this equation: it is simply L ′ = 2 × ( number of factors of 2 n ) just like the previous case. Now we just need to actually compute the value of each one.
Let n = 2 e 1 ⋅ 3 e 2 ⋅ 5 e 3 ⋯
We have that
L = 2 ( e 1 + 1 ) ( e 2 + 1 ) ( e 3 + 1 ) ⋯
Note that 2 n = 2 e 1 − 1 ⋅ 3 e 2 ⋅ 5 e 3 ⋯ .
Thus,
L ′ = 2 e 1 ( e 2 + 1 ) ( e 3 + 1 ) ⋯
and the difference between them is
D = L − L ′ = 2 ( e 2 + 1 ) ( e 3 + 1 ) ( e 4 + 1 ) ⋯
Thus, we want to maximize the value of 2 ( e 2 + 1 ) ( e 3 + 1 ) ( e 4 + 1 ) ⋯
such that 2 e 1 ⋅ 3 e 2 ⋅ 5 e 3 ⋯ ≤ 1 0 0 0
First, note that since e 1 does not affect D , we should let e 1 = 1 (we can't let e 1 = 0 or else 2 n is not an integer).
Thus, n = 2 ⋅ 3 e 2 ⋅ 5 e 3 ⋅ 7 e 4 ⋯
Guessing and checking is probably the best way to go from here. We want 3 e 2 ⋅ 5 e 3 ⋅ 7 e 4 ⋯ ≤ 5 0 0 ; there isn't that many possibilities for e 2 , e 3 , … . We find that e 2 = 2 , e 3 = 1 , and e 4 = 1 gives the highest value of D .
This means n = 2 × 3 2 × 5 × 7 = 6 3 0 .
Finally, D = 2 ( 3 ) ( 2 ) ( 2 ) = 2 4 and we are done.
Some interesting things to note from this solution:
D > 0 because 2 ( e 2 + 1 ) ( e 3 + 1 ) ( e 4 + 1 ) ⋯ can never be 0 .
D must be even (although in hindsight this is obvious because of the symmetries of the hyperbola)
The maximum D is at n = 6 3 0 , which isn't even close to the upper bound restriction n ≤ 1 0 0 0
Computing, we have that the number of lattice points on x y = 6 3 0 is 4 8 , while the number of lattice points on x 2 − y 2 = 1 2 6 0 is only 2 4 .