|
Not Ranked
:
+0 / -0
0 score
I think a good first step is to confirm that the algorithm appears to work
Post a list of the largest consecutive numbers you’ve generated with the algorithm, as many as you can within reason, perhaps 100 or 1000 numbers. Those of us who are good a high-speed arithmetic (using computers, of course) can check those numbers for primality, using whatever method he have handy. If any obvious composite numbers are discovered, you’ll know there’s a problem, and be able to investigate.
There’s no need to describe your algorithm with this approach, and checkers can simply assume you’re honest about using an unknown algorithm – that is, that you’re not using a known prime number generator or getting them from a published list generated by a known method, and bogusly claiming to be using something else.
It’s a waste of your effort to work on getting an IP lawyer or publishing in a journal if the algorithm fails upon simple examination, so simple examination is a worthwhile first step.
----------------
Moderator: Computers and Technology; Medical Science; Science Projects and Homework; Philosophy of Science; Physics and Mathematics; Environmental Studies  |
