Welcome to the simulation of Shor's algorithm. There are four restrictions for Shor's algorithm: 1) The number to be factored must be >= 15. 2) The number to be factored must be odd. 3) The number must not be prime. 4) The number must not be a prime power. There are efficient classical methods of factoring any of the above numbers, or determining that they are prime. Input the number you wish to factor. 15 Found x to be 14. Found q to be 256. Made register 1 with register size = 9 Created register 2 of size 4 Begin Discrete Fourier Transformation! Making progress in Fourier transform, 38.8235% done! Making progress in Fourier transform, 78.0392% done! Measured, 0 this trial a failure! Begin Discrete Fourier Transformation! Making progress in Fourier transform, 38.8235% done! Making progress in Fourier transform, 78.0392% done! Measured, 0 this trial a failure! Begin Discrete Fourier Transformation! Making progress in Fourier transform, 38.8235% done! Making progress in Fourier transform, 78.0392% done! measured 128, approximation for 0.5 is 1 / 2 possible period is 2 14^1 + 1 mod 15 = 0, 14^1 - 1 mod 15 = 13 Found trivial factors 1 and 15. Trying again. Begin Discrete Fourier Transformation! Making progress in Fourier transform, 38.8235% done! Making progress in Fourier transform, 78.0392% done! Measured, 0 this trial a failure! Begin Discrete Fourier Transformation! Making progress in Fourier transform, 38.8235% done! Making progress in Fourier transform, 78.0392% done! measured 128, approximation for 0.5 is 1 / 2 possible period is 2 14^1 + 1 mod 15 = 0, 14^1 - 1 mod 15 = 13 Found trivial factors 1 and 15. Trying again. There have been five failures, giving up.