Path: csiph.com!usenet.pasdenom.info!gegeweb.org!eternal-september.org!feeder.eternal-september.org!mx04.eternal-september.org!.POSTED!not-for-mail From: Joshua Cranmer Newsgroups: comp.lang.java.programmer Subject: Re: Troll Parade Closing, Award Ceremony Date: Sun, 10 Jun 2012 08:25:23 -0400 Organization: A noiseless patient Spider Lines: 29 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Sun, 10 Jun 2012 12:25:34 +0000 (UTC) Injection-Info: mx04.eternal-september.org; posting-host="Sp0r/0JgkuZU3ls2e+PxTA"; logging-data="18005"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18UHgFN4SPrbfnDb7g71jV9Gn4tJhJZV90=" User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:13.0) Gecko/20120604 Thunderbird/13.0 In-Reply-To: Cancel-Lock: sha1:yqSDQQsCOaM7rMEuzHKKsfukyWw= Xref: csiph.com comp.lang.java.programmer:15166 On 6/10/2012 6:31 AM, Jan Burse wrote: > Jan Burse schrieb: >> Dear All, >> >> What is your favorite algorithm to compute the n-th Square of >> a BigInteger, i.e. >> >> Given: x, n >> Compute: y = max { z | z^n =< x } >> >> Bye > > I guess it is time to close the troll parade. The > appearance of trolls was in the following order: > > 1. markspace <-@.> > 2. Lew > 3. Leif Roar Moldskred > 4. Joshua Cranmer You forgot: 0. Jan Burse [Sorry, you made it way too easy]. -- Beware of bugs in the above code; I have only proved it correct, not tried it. -- Donald E. Knuth