RECETASNUMERICAS.BLOGSPOT.COM

numericalrecipes.blogspot.com

Numerical Recipes: Prime Numbers 1. The Wrong Way

http://numericalrecipes.blogspot.com/2009/03/prime-numbers_04.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Thursday, March 5, 2009. Prime Numbers 1. The Wrong Way. Is a natural number larger than 1 which is only divisible by 1 and itself. Simple, isn't it? From time import time. Def primeList1(n, verbose = True) :. For j in range(2,n 1) :. For k in range(2,j) :. Print "Calculated primes to",n,"in",time()-t,"sec.". Well, if a number is divisibl...

numericalrecipes.blogspot.com

Numerical Recipes: The Cooley-Tukey FFT Algorithm

http://numericalrecipes.blogspot.com/2009/04/cooley-turkey-fft-algorithm.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Thursday, April 16, 2009. The Cooley-Tukey FFT Algorithm. I'm currently a little fed up with number theory. So its time to change topics completely. Specially since the post on basic integer factorization. Completes what I believe is a sufficient toolkit to tackle a very cool subject: the fast Fourier transform (FFT). T = time.clock().

numericalrecipes.blogspot.com

Numerical Recipes: Naive Integer Factorization

http://numericalrecipes.blogspot.com/2009/04/naive-integer-factorization.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Thursday, April 9, 2009. After three posts ( 1. On calculating prime numbers, it is probably worth putting that knowledge to a more useful task. As we will see in a near future, integer factorization. The point is, we will consider factorization a synonym of prime decomposition, be it formally correct or not. To something around 2 n.

numericalrecipes.blogspot.com

Numerical Recipes: Prime Numbers 3. Wheel Factorization

http://numericalrecipes.blogspot.com/2009/03/prime-numbers-3-wheel-factorization.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Tuesday, March 24, 2009. Prime Numbers 3. Wheel Factorization. In an earlier post. I described the sieve of Eratosthenes. All numbers into two groups: those of the form 2·n, and those of the form 2·n 1, and then discard the former, since no prime of that form exists, and keep the latter only. This line of thinking is much mo...We begin by...

numericalrecipes.blogspot.com

Numerical Recipes: Modular Multiplicative Inverse

http://numericalrecipes.blogspot.com/2009/03/modular-multiplicative-inverse.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Friday, March 20, 2009. Now that we are all proficient with modular exponentiation. Thanks to my previous post. It is time to tackle a more complicated issue, still in the realm of modular arithmetic. Mod m) that fulfills that equation is the whole object of this post. Def modInv1(a,m) :. For x in range(1,m) :. If a*x%m = 1 :. Do notice t...

numericalrecipes.blogspot.com

Numerical Recipes: Modular Exponentiation

http://numericalrecipes.blogspot.com/2009/03/modular-exponentiation.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Friday, March 20, 2009. I have a post cooking on wheel factorization. What we are after is determining a. Mod m), or to put it in plain English, the remainder of a to the power of b, divided by m. Doesn't seem much, does it? We could just go ahead and write:. Def modExp1(a, b, m) :. Computes a to the power b, modulo m, directly. The only ...

numericalrecipes.blogspot.com

Numerical Recipes: Go West Young Man!

http://numericalrecipes.blogspot.com/2009/04/go-west-young-man.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Thursday, April 30, 2009. Go West Young Man! You can find the new blog here. And suscribe to the RSS feed here. For starters I have redone the much improvable first post of the series on the FFT, which I have split in two, one on the DFT. The other starting discussion on the FFT. Plus an unconnected post on computing the GCD. Subscribe to...

numericalrecipes.blogspot.com

Numerical Recipes: April 2009

http://numericalrecipes.blogspot.com/2009_04_01_archive.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Thursday, April 30, 2009. Go West Young Man! You can find the new blog here. And suscribe to the RSS feed here. For starters I have redone the much improvable first post of the series on the FFT, which I have split in two, one on the DFT. The other starting discussion on the FFT. Plus an unconnected post on computing the GCD. To the many ...

numericalrecipes.blogspot.com

Numerical Recipes: March 2009

http://numericalrecipes.blogspot.com/2009_03_01_archive.html

Come the (computer) revolution, all persons found guilty of such criminal behavior will be summarily executed, and their programs won’t be! From Numerical Recipes in C. Tuesday, March 24, 2009. Prime Numbers 3. Wheel Factorization. In an earlier post. I described the sieve of Eratosthenes. All numbers into two groups: those of the form 2·n, and those of the form 2·n 1, and then discard the former, since no prime of that form exists, and keep the latter only. This line of thinking is much mo...We begin by...