Abstract
This paper is presented an algorithm for testing primality of a large number in faster way and low storage space. Today the almost techniques which are used for testing the primality of the large number are struggling to reduce the cost of both processing time and storage space. Therefore, an intensive research by mathematicians and computers scientists is going in this field. The suggested algorithm is based on using of solutions of the quadratic equation (QE). The technique is aiming to find any two distinct numbers which are representing the obtained two roots of the QE. If these two roots are exist, in this case the given integer is not prime and the algorithm can identify the two roots in efficient cost of time and storage. The algorithm has appeared that it is working well by producing fantastic results. From these results, new ideas and thoughts have been listed for further analysis and discussion for testing of the primality of numbers