Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/12/84; site aero.ARPA
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!vax135!cornell!uw-beaver!tektronix!hplabs!sdcrdcf!trwrb!trwrba!aero!sinclair
From: sinclair@aero.ARPA (William S. Sinclair)
Newsgroups: net.math
Subject: Re: REPEATED ROOTS
Message-ID: <447@aero.ARPA>
Date: Thu, 19-Sep-85 15:54:52 EDT
Article-I.D.: aero.447
Posted: Thu Sep 19 15:54:52 1985
Date-Received: Mon, 23-Sep-85 00:42:28 EDT
References: <3122@garfield.UUCP>
Reply-To: sinclair@aero.UUCP (William S. Sinclair)
Distribution: net
Organization: The Aerospace Corp., El Segundo, CA
Lines: 14
Summary: 

Dear Robert:
 
What you really have is the recursion formula:

x(n+1)=2+sqrt(x(n))

If you assume x(n+1)=x(n)  [the limit case] then

x=2+sqrt(x)

Which gives x=4 or 1. THe second value assumes that you use the negative root.

                                     Bill Sinclair  213/647-1753


Brought to you by Super Global Mega Corp .com