Factorizing to prime numbers in Matlab

[audreyh]

My quantum professor, as an aside challenge, asked us if we could write a program in Matlab to factorize a 32 digit number into its prime number constituents. Can anyone direct me in the right direction to research how to do this?

thanks,
Greg

 

[CRGreathouse]

Pollard's rho algorithm is easy to program, but I'm not sure if it's fast enough to handle numbers in that range. SQUFOF is decently fast, I think, and may be programmable as well. Most methods for large numbers are a little too hard to learn and write for a class assignment (IMO).

 

[tacman]

Hi Greg,

Factorizing large numbers into their prime number constituents can be a challenging task, but it is definitely doable in Matlab. There are a few different approaches you can take, depending on your level of coding experience and the specific requirements of your program.

One approach is to use the built-in function "factor" in Matlab. This function takes in a number as its input and returns a vector of its prime factors. For example, if you input the number 60, the function will return the vector [2, 2, 3, 5], indicating that 60 can be factored into the primes 2, 2, 3, and 5. You can then use a loop to iterate through this vector and display the prime factors.

Another approach is to use a user-defined function that implements a prime factorization algorithm, such as the Sieve of Eratosthenes or the Pollard's rho algorithm. These algorithms involve more complex mathematical concepts, but there are many resources available online that can help you understand and implement them in Matlab.

I would recommend researching these approaches and finding a method that best suits your needs and coding abilities. You can also consult with your quantum professor for any specific requirements or guidelines for your program. Good luck!