amateurishness.
Thanks
On Wed, Dec 30, 2015 at 1:36 PM, Steven D'Aprano <st...@pearwood.info>
wrote:
> On Wed, Dec 30, 2015 at 12:00:02AM +0700, Satya Luzy wrote:
> > Hello,
> > I am currently working on a program to find the prime factor of n, in
> which
> > n is a bi
Dear everyone, thank you for all of your support.
To Alan :
It is true that my code still need some improvement on the efficiency part,
and thanks for pointing out which part that needs to be improved. Speaking
of the nested loops, with my ability, I don't think I could simplify it, as
the nested
Hello,
I am currently working on a program to find the prime factor of n, in which
n is a big integer. Using the Continued Fraction factorization method (I
will provide the source code below, please don't mind the variables). It
works perfectly when factorizing below 10 digits numbers. In my code
I'm currently making a cryptanalysis program that involves up to 150
integer digits.
The number will be used for multiplication and exponentiation purpose.
So, do I need to use something like a big integer class? or does that even
exist?
Thank you,
Python learner
Is there a way to extend the numbers so that there is no more L?
Thanks :)
On Tue, Dec 22, 2015 at 8:29 PM, Alan Gauld <alan.ga...@btinternet.com>
wrote:
> On 22/12/15 10:05, Satya Luzy wrote:
> > I'm currently making a cryptanalysis program that involves up to 150
>
