Of course! I´d look into it...
Not exactly. Its possible to compute square of 2 (269916694664582966990754893514409**2 + 108309988975954046249057727301124**2) , but why it´s not possible to compute higher (such as 4)? It works for 2, so it must also work with 4.
thanks, but this isn´t exactly I´m looking for. I mean this:
546516546654461986448
how can I quickly compute which power gives me 5XXXXXXXXXXXXXXXXXXXX? X-random value, but that doesn´t matter - I want to give the length.
Yes, I am programmer (not a good one). I already found what I was looked for.
Thanks for clarification.
Aha, integer factorization.
So 1676962425600 is 2^8 * 3^2 * 5^2 * 7 * 11^2 * 37 * 929
>If they were all prime and you were told how many there were then you could
so I have 2,3,5,7,11,37,929. How can I determine correct exponents?
Thanks.
Guest,
So you say, that you´ve used factorization algorithm to express large integer into small values. That´s great. I´ve tried with ECM algorithm (online implementation) and the results was generated in less than 0.3 second. That´s very good! Thanks a lot!!!! And what about large randomly generated numbers?
Thank you so much!! It´s impressive!! and what about TOTALLY random numbers?
Factorization is exactly what I looked for... But what about this HUGE number? 5441 084843 431591 615659 571291 428668 923255 549962 214089 160997 541170 290830 516266 773395 936827 128499 431593 969046 448477 687463 427177 903244 520307 433540 723695 388709 656001
Thanks a lot.
MathKing