Sum of arctangents equals to pi/4, part 2

Geometry Level 5

arctan ( 1 a ) + arctan ( 1 b ) + arctan ( 1 c ) + arctan ( 1 d ) = π 4 \arctan\left(\frac{1}{a}\right)+\arctan\left(\frac{1}{b}\right)+\arctan\left(\frac{1}{c}\right)+\arctan\left(\frac{1}{d}\right)=\frac{\pi}{4}

Let a , b , c , d a,b,c, d be positive integers where 1 < a b c d 1 < a \le b\le c \le d such that the equation above is fulfilled. What is the largest possible value of d d ?


The answer is 183.

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.

1 solution

Chan Lye Lee
Nov 3, 2015

In order the get the largest value of d d , the values of a a and b b must be as smallest as possible. Since arctan 1 2 + arctan 1 3 = π 4 \arctan \frac{1}{2}+\arctan\frac{1}{3}=\frac{\pi}{4} , then the smallest values of ( a , b ) = ( 2 , 4 ) (a,b)=(2,4) . (The readers may check that ( a , b ) = ( 3 , 3 ) (a,b)=(3,3) could not gives the desired value d d .)

Now arctan ( 1 2 ) + arctan ( 1 4 ) + arctan ( 1 c ) + arctan ( 1 d ) = π 4 \displaystyle \arctan\left(\frac{1}{2}\right)+\arctan\left(\frac{1}{4}\right)+\arctan\left(\frac{1}{c}\right)+\arctan\left(\frac{1}{d}\right)=\frac{\pi}{4} gives c d 1 = 13 ( c + d ) cd-1=13(c+d) , which means that d = 13 c + 1 c 13 = 13 + 170 c 13 d=\frac{13c+1}{c-13}=13+\frac{170}{c-13} . This implies that the largest value of d d is 13 + 170 = 183 13+170=183 , which occurs when c = 14 c=14 .

Remarks : I wonder if there is any efficient way to solve the general case k = 1 n arctan 1 a k = π 4 \sum_{k=1}^{n}\arctan\frac{1}{a_k}=\frac{\pi}{4} for positive integers a k a_k and a i a j a_i\le a_j for all i j i \le j .

I disagree with the logic of "In order to get the largest value of d, the value of a must be as small as possible". It is not immediately clear why we cannot increase a and b, in order to reduce c, which allows us to increase d.

This is similar to Egyptian fractions, where the greedy algorithm doesn't always guarantee us the solution with the shortest length, or largest denominator.

Calvin Lin Staff - 5 years, 7 months ago

Log in to reply

I agree with your disagreement. Will try to find the better method...

Chan Lye Lee - 5 years, 7 months ago

Sorry for such a strange question, but what font are you using to write these solutions?

John Zhu - 5 years, 7 months ago

Log in to reply

You may refer to this .

Chan Lye Lee - 5 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...