MathGroup Archive 2007

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Re: How do quickest


Comparision 3 procedures Length[a] < 11:

Daniel Huber        4.487 Second
Daniel Lichtblau   13.219 Second Second
Myself             58.744 Second

BEST WISHES
ARTUR

Dnia 25-01-2007 o 13:55:38 dh <dh at metrohm.ch> napisa³(a):

> a = {3}; For[k = 1 + a[[Length[
>
>>      a]]], Length[a] < 13, While[! IntegerQ[Sqrt[(k)^2 + Sum[(a[[t]])^2,
>
>> {t, 1,
>
>>     Length[a]}]]], k++]; AppendTo[a, k]]; a



  • Prev by Date: can't InstallJava[] on Linux-x86-64 to Import an xls file
  • Next by Date: Re: pdf
  • Previous by thread: Re: How do quickest
  • Next by thread: Re: Zeroes of Zeta function