User:XEEJY

''' = New Method For Finding Prime & Composite Numbers = []

Authors
Zobia Jabeen https://ncbae.academia.edu/ZobiaJabeen?from_navbar=true Adnan Khan https://independent.academia.edu/AdnanKhan562 Asif Iqbal Ali https://ncbae.academia.edu/AsifIqbal

Abstract
The idea behind this paper is to create a method for finding Prime Numbers, as all Prime numbers are odd numbers (except for number 2) so finding a formula to generate all odd composite numbers was important. This paper introduced the method for finding Prime & Composite number between any two numbers, by first finding all odd composite number between any two numbers using formula & given recursive relation then obviously all remaining odd numbers are prime

Acknowledgments:
'The author acknowledges with thanks the support received through my family “Riazet Ali Khan, Bibi Nazir begum, Dr. Amir Amanat, Ghazala Jabeen” Who encourage me for developing a different idea and highly thankful to my professors for their support. "Asif Iqbal Ali, Dr. Adnan Khan, Dr. Muhammad Kalim, Dr. Stephen Sadiq, Dr. Mehmood Alam and Dr. Gulfam Shahzadi

Conclusion:
By comparison with other methods, it is concluded that in any other method we need a lot of calculations to find prime numbers. But in this method, we need a small no. of calculations. If Z is large Z=1000 Then the square root of Z =32 Under 32, there are 11 primes, so P is set of 11 members. Just 11 basic calculations will be needed and all other numbers can be calculated by recursive relation and if Z is too large about 1 lac Suppose Z=100000 Then the square root of Z=316 So, under 316, there will be about 100 primes so for finding composite and prime between 1 lac there just need 100 basic calculations and some other preliminary calculation by using recursive relation. We can develop an algorithm for computing these calculations. This will make it easy to find within minutes.