It seems that it is very hard problem.
So for now I abandon.
(given) Area ABCD = Area CDEF - Area OEF = Area OCD - Area OEF - Area OEF = Area OCD - 2 Area OEF = (y^2)(a/2) - 2(x^2)(a/2)
(derived) Area ABCD = Area OAB - Area OCD = (r^2)(a/2) - (y^2)(a/2)
Hence
(y^2)(a/2) - 2(x^2)(a/2) = (r^2)(a/2) - (y^2)(a/2)
2(y^2 - x^2) = r^2
y^2 - x^2 = (r^2)/2
If x and y are integers, then the difference of squares is an integer, so r^2/2 is an integer, say n.
EDIT:
(r^2)/2 = (r/sqrt(2))^2
Hence
(r/sqrt(2))^2 + x^2 = y^2 and hence (r/sqrt(2),x,y) would be a Pythagorean triplet.
that's all I have so far, but I hope that helps a little. my intuition says it's impossible, so I would continue down this line of reasoning to find a contradiction.
Thank you very much.
You gave me little hope.
If we can not find x and y we could at least bound it.
Here is my idea :
The area CDEF is always equal to area ABCD + area OEF.
We have to find DF such as DF = OF+DB
The value of computed DF then will give us an upper bound for y-x
Am I right?
Another idea comes to my mind.
We could find :
- an upper bound (or lower?) to y-x by assuming that the area OEF goes to zero
- and lower bound (or upper?) to y-x by assuming that the area ABCD goes to zero.
So lower bound <(y-x)< upper bound.
Is it easy to compute?
I do like that idea of boundedness and considering the difference to find either a contradiction or a bound.
Suppose for some positive integer M.
then
then and
and since x and y are integers must divide both and
Recall that if (ab) divides c, then a divides c, so 4 must divide both and
edit://
so for some integer k and for some integer m.
If k = m then M = 0. If m < k then , a contradiction.
If k < m
so now I would investigate the case of k<m, but I might just be complicating things or made a mistake. interesting problem though. I also considered looking at the problem when a = 360 degrees.