Path: csiph.com!usenet.pasdenom.info!news.albasani.net!.POSTED!not-for-mail From: Jan Burse Newsgroups: comp.lang.java.programmer Subject: Re: Quick n-th Square of BigInteger Date: Sat, 09 Jun 2012 01:29:55 +0200 Organization: albasani.net Lines: 5 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-15; format=flowed Content-Transfer-Encoding: 7bit X-Trace: news.albasani.net F76byeJyt+NRKrL+zGJurGsqjyiXjYP0gzuS5uaKmW+J2CFhIkw6gYbMJAEbKK6KpMiucINz+oafIXXGpihOq+rNyzN5oaKneZrS8H/eLFG5miizGm9cLM3HHsD8yTxY NNTP-Posting-Date: Fri, 8 Jun 2012 23:29:50 +0000 (UTC) Injection-Info: news.albasani.net; logging-data="kBbQAudZXdBq9BBhCvZ2djinB3JhOMxgMjOLE3a+tnW8vhG720sDe9xxwELwCUbxBrfqSHvjRY1DT+xAr8pNw1i7MWKQsUMsb/QqdaJFyKf3ay0sXFudPOa0n6/Nub2Y"; mail-complaints-to="abuse@albasani.net" User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:13.0) Gecko/20120604 Firefox/13.0 SeaMonkey/2.10 In-Reply-To: Cancel-Lock: sha1:S+jfQltYJUoD+drK0I9PMctThyA= Xref: csiph.com comp.lang.java.programmer:15137 Jan Burse schrieb: > How do you factor the exponent if it is not > a constant you know in advance? Efficiently?