Tag Info

Hot answers tagged

8

No, it is not an impossible problem. There is a finite number of prime-numbers smaller than a given natural number, which means there is a finite number of ways they can be multiplied with while still being equal or less than the number. You can simply try them all until you found the correct solution. There are several algorithms for integer factorization ...


6

An easy way to tell if you posted too early is to look at the votes your questions are getting. If you're posting well researched, clear, easy to reproduce questions that are getting a lot of positive votes, then you're doing it right. If you're being lazy & asking the Intertubes to do your thinking for you, I can safely guarantee you'll get a lot of ...


3

Finding a factorization of a (usually large) number (often some bignum in practice) is an intractable problem : there is no known efficient (polynomial time) algorithm for that. But it is of course a decidable problem: you can try to divide that number N by every positive integer number I whose square I2 is not larger than N, and there is a finite (but often ...



Only top voted, non community-wiki answers of a minimum length are eligible