Tag Info

New answers tagged

0

At the moment, you have 2 questions with the ruby-on-rails tag. I doubt that this can in any way be "too often". You answered one yourself, which can be a sign that your research wasn't sufficient. But then again, this is 1 out of 2 questions. How can you jump to any conclusions from that? After all, answering your own questions is encouraged behaviour. ...


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 ...


-2

For one thing, make it easier on yourself. Although this could perhaps be viewed as promotional spam, it's truly not meant that way: If using Google's Chrome Browser to view ietf.org RFCs, I can recommend installing the RFCRestyle Chrome Extension for no other reason than to make the work of reading them easier on the eyes and neck. In all seriousness, I ...


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 ...


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 ...



Top 50 recent answers are included