smslca
Member level 1
Is that a Formula???
I think I have worked out a formula for Prime Numbers. I said, "I think," because
1. I dont know , Is that formula already there at present.
2. I dont know , does what I found is really should be called as a Formula.
I made the 2nd point because, In these Type of formulas, For ex take " prime numbers "There must be solution for every given natural number(N).
--Actually this Equation generates all Primes, But with some non-primes for a given N.
So what I actually mean is There misses some N values in the series.
--There are two simple equations to generate Primes along with non-Primes.
**--I have created/discovered/worked out equations for the values of N with non-primes.
That mean If N satisfies the equation it is the non-prime N.
-- There are total of 40 equations to eliminate the non-primes. In which only 4 or 6
equations are used for each N.
**--I mainly doubt it as a formula because, there are just two same variables in all 40
equations, since each equation is unique and different from other, no two equations
can be equated to solve for variables.
So, We have to guess one variable, and for larger N value, guessing will become more
difficult.
As I said for each N we have to use 4 or 6 eqns , as per my caluculations, for each eqn
requires N/30 guessings. If we have luck in the first equation, it ends with N/30, But if it
goes to last 6 th eqn we have to do, 6*n/30=N/5 guessings.
** You must know that Here N does not represent the conventional 1,2,3,4,.... series
N, because in that N is normal numbers and prime Numbers ex. N=2 is a prime Number.
But In my equation, N=2 creates a prime.
What I want to say is that N/30 is different from conventional N/30 and is far more
less value than conventional.
-- The guessing values has a pattern We must follow to get the value. It is not selected
at random.
achievements with this equation.
--------------------------------
-- I have created a C program by using those equations without eliminating the non-primes. So by using logics we could
generate the whole list of primes.
** The "Time" it took is the important part of eqn:
In my Windows XP, Intel pentium 4, 2.66Ghz, 960MB ram system,
To generate first billion Primes, It took, approximately (not accurate)
1. >22.5 hrs for conventional method
/* To generate Prime numbers by conventional method */
#include <stdio.h>
main()
{
int n,i=1,j,c;
printf("Enter Number Of Terms");
printf("Prime Numbers Are Follwing");
scanf("%d",&n);
while(i<=n)
{
c=0;
for(j=1;j<=i;j++)
{
if(i%j==0)
c++;
}
if(c==2)
printf("%d ",i);
i++;
}
getch();
}
2. 7-9hrs or greater about extra 3-4 hrs for the fastest method I found.
/******************************
* THIS IS THE EASIEST
* METHOD OF GENERATING
* PRIME NUMBERS USING C
* MADE BY: githambo@gmail.com
*******************************/
#include<stdio.h>
#include<math.h>
int main()
{
int i,j,h,n;
printf("Start:\a\n");
scanf("%d",&n);
printf("End?\n\a");
scanf("%d",&h);
for(i=n;i<h;i++)
{
for(j=2;j<i;j++)
{
if(i%j==0)
break;
}
if(i==j)
printf("%d\t",j);
}
getch();
}
3. By my method, it took 2-3 hrs.
-- *** These eqns can even find the factors for the product of prime numbers.
It took less than 00:00:00.25secs(hr:min:sec.msec form) to factorize the value of
2,147,483,641 , I took it because 2,147,483,647 is the last value I can give to that
program using C or to my computer.
-- I dint write a program by eliminating non-primes because, there is a problem due to guess
of values to the variables.
If any one just finds any pattern and get another equation with the same variables finding
factors for a large ie of any large product of primes will be done in less than a second.
There must be some pattern lurking in the process I done.
Upto Now I didnot reveal the equation, because,
I read somewhere, If U find a formula for primes U will be popular.
"**If what I have worked out is a formula**",(when judged by others) Then I wll get fame .
I like to be famous and popular, if there is my name just near to the formula I will be so
happy. Also my sister's name who helped me.
In the Internet in Wikipedia I read about "Peer review", I cant understand it clearly because I dont know English perfectly.
So what is the Peer Review, and where are the places, I can submit my work to be judged, as formula or as piece of waste.
I also read that we can get patent for a computer program involving mathematical formula, and which can be useful for many other purposes. So If it is a formula discovered only by me can I get patent for the C program I created.
Please Read the whole matter carefully and answer to my questions written "In the first" and "At the last".
I think I have worked out a formula for Prime Numbers. I said, "I think," because
1. I dont know , Is that formula already there at present.
2. I dont know , does what I found is really should be called as a Formula.
I made the 2nd point because, In these Type of formulas, For ex take " prime numbers "There must be solution for every given natural number(N).
--Actually this Equation generates all Primes, But with some non-primes for a given N.
So what I actually mean is There misses some N values in the series.
--There are two simple equations to generate Primes along with non-Primes.
**--I have created/discovered/worked out equations for the values of N with non-primes.
That mean If N satisfies the equation it is the non-prime N.
-- There are total of 40 equations to eliminate the non-primes. In which only 4 or 6
equations are used for each N.
**--I mainly doubt it as a formula because, there are just two same variables in all 40
equations, since each equation is unique and different from other, no two equations
can be equated to solve for variables.
So, We have to guess one variable, and for larger N value, guessing will become more
difficult.
As I said for each N we have to use 4 or 6 eqns , as per my caluculations, for each eqn
requires N/30 guessings. If we have luck in the first equation, it ends with N/30, But if it
goes to last 6 th eqn we have to do, 6*n/30=N/5 guessings.
** You must know that Here N does not represent the conventional 1,2,3,4,.... series
N, because in that N is normal numbers and prime Numbers ex. N=2 is a prime Number.
But In my equation, N=2 creates a prime.
What I want to say is that N/30 is different from conventional N/30 and is far more
less value than conventional.
-- The guessing values has a pattern We must follow to get the value. It is not selected
at random.
achievements with this equation.
--------------------------------
-- I have created a C program by using those equations without eliminating the non-primes. So by using logics we could
generate the whole list of primes.
** The "Time" it took is the important part of eqn:
In my Windows XP, Intel pentium 4, 2.66Ghz, 960MB ram system,
To generate first billion Primes, It took, approximately (not accurate)
1. >22.5 hrs for conventional method
/* To generate Prime numbers by conventional method */
#include <stdio.h>
main()
{
int n,i=1,j,c;
printf("Enter Number Of Terms");
printf("Prime Numbers Are Follwing");
scanf("%d",&n);
while(i<=n)
{
c=0;
for(j=1;j<=i;j++)
{
if(i%j==0)
c++;
}
if(c==2)
printf("%d ",i);
i++;
}
getch();
}
2. 7-9hrs or greater about extra 3-4 hrs for the fastest method I found.
/******************************
* THIS IS THE EASIEST
* METHOD OF GENERATING
* PRIME NUMBERS USING C
* MADE BY: githambo@gmail.com
*******************************/
#include<stdio.h>
#include<math.h>
int main()
{
int i,j,h,n;
printf("Start:\a\n");
scanf("%d",&n);
printf("End?\n\a");
scanf("%d",&h);
for(i=n;i<h;i++)
{
for(j=2;j<i;j++)
{
if(i%j==0)
break;
}
if(i==j)
printf("%d\t",j);
}
getch();
}
3. By my method, it took 2-3 hrs.
-- *** These eqns can even find the factors for the product of prime numbers.
It took less than 00:00:00.25secs(hr:min:sec.msec form) to factorize the value of
2,147,483,641 , I took it because 2,147,483,647 is the last value I can give to that
program using C or to my computer.
-- I dint write a program by eliminating non-primes because, there is a problem due to guess
of values to the variables.
If any one just finds any pattern and get another equation with the same variables finding
factors for a large ie of any large product of primes will be done in less than a second.
There must be some pattern lurking in the process I done.
Upto Now I didnot reveal the equation, because,
I read somewhere, If U find a formula for primes U will be popular.
"**If what I have worked out is a formula**",(when judged by others) Then I wll get fame .
I like to be famous and popular, if there is my name just near to the formula I will be so
happy. Also my sister's name who helped me.
In the Internet in Wikipedia I read about "Peer review", I cant understand it clearly because I dont know English perfectly.
So what is the Peer Review, and where are the places, I can submit my work to be judged, as formula or as piece of waste.
I also read that we can get patent for a computer program involving mathematical formula, and which can be useful for many other purposes. So If it is a formula discovered only by me can I get patent for the C program I created.
Please Read the whole matter carefully and answer to my questions written "In the first" and "At the last".
