Potential Assistance in Finding Very Large Prime Numbers Using a Vector Checking System: Prime Number Vector Check System – PVECS

This report will attempt to show a potentially time-saving method for finding new very large prime numbers using a combination “vectors with grid points” system (2D). This method, PVECS, may possibly save time for searchers trying to find large prime numbers by making it unnecessary to conduct a vast array of multiplication operations in order to determine primality of any particular number. The PVECS method may or may not ultimately be of any use; the final determination will be made in finding out the computer capacity and time necessary to carry out this new method compared to using traditional methods. The resources of this author are limited and no such timing tests have been carried out. To put this text out in this form is the best way to gather comments on the usefulness of the method while still protecting the origin rights.