Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
152 views1 page

USA Mathematical Talent Search Solutions To Problem 5/1/19

The document is a solution to a math problem proposing that the only value of c such that an < 0 for all n ≥ 1 is c = -1/2. It proves this by: 1) Showing that if c = -1/2, then an = -1/2 for all n, satisfying the condition. 2) Assuming c ≠ -1/2 and deriving a recursion formula that leads to a contradiction, showing no other values of c are possible. 3) Concluding that the only solution is c = -1/2.

Uploaded by

สฮาบูดีน สาและ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
152 views1 page

USA Mathematical Talent Search Solutions To Problem 5/1/19

The document is a solution to a math problem proposing that the only value of c such that an < 0 for all n ≥ 1 is c = -1/2. It proves this by: 1) Showing that if c = -1/2, then an = -1/2 for all n, satisfying the condition. 2) Assuming c ≠ -1/2 and deriving a recursion formula that leads to a contradiction, showing no other values of c are possible. 3) Concluding that the only solution is c = -1/2.

Uploaded by

สฮาบูดีน สาและ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

USA Mathematical Talent Search

Solutions to Problem 5/1/19


www.usamts.org

5/1/19. Let c be a real number. The sequence a1 , a2 , a3 , . . . is defined by a1 = c and


an = 2a2n1 1 for all n 2. Find all values of c such that an < 0 for all n 1.

Credit This problem was proposed by Naoki Sato.

Comments It is not difficult to show that the value c = 12 works. If c 6= 12 , then the
terms of the sequence must diverge from 12 , to the point where they become positive. The
following solution uses a rigorous bounding argument. Solutions edited by Naoki Sato.

Solution 1 by: Sam Elder (12/CO)


Create PDF with GO2PDF for free, if you wish to remove this line, click here to buy Virtual PDF Printer

The only value is c = 21 .


If an = 12 , then an+1 = 2a2n 1 = 2( 21 )2 1 = 12 , so if c = 12 , then an = 12 < 0 for
all n 1 and the result is achieved.
Assume c 6= 21 , and define the sequence bn = 2an + 1. Assume that an < 0 for all n, so
bn < 1 for all n. A recursion for the bn is derived from that for the an :
 2
bn 1 bn1 1
=2 1
2 2
bn 1 = (bn1 1)2 2
bn = bn1 (bn1 2)
bn = bn2 (2 bn2 )(2 bn1 )

for all n > 2. If bn = 0, then bn1 = 0 or bn1 = 2. However, by assumption, bn < 1 for all
n, and b1 = 2a1 + 1 = 2c + 1 6= 0, so bn 6= 0 for all n.
If bn < 0, then bn+1 = bn (bn 2) > 0. Likewise, if bn > 0, then bn+1 < 0 since bn < 1 and
so bn 2 < 1 < 0. Hence, the terms bn alternate in sign, so for all n, one of bn1 and bn2
is negative. The other is less than 1, so
bn
= (2 bn2 )(2 bn1 ) > (2 0)(2 1) = 2.
bn2

Let m = 1 if b1 is positive, and m = 2 if b2 is positive, so bm is positive. Take l sufficiedntly


large so that bm > 2l . Then

bm+2l > 2bm+2(l1) > 22 bm+2(l2) > > 2l1 bm+2 > 2l bm > 1,

a contradiction. So c = 12 is the only solution.

You might also like