Is there a function that gives the frequency with which twin primes less than a particular number, N (assuming N is not a part of a twin prime) occur? I've tried with a program but I did not notice any pattern........
:
int pc(long double n) \\pc:prime check
{
long double i=2, f=0;
for(;i<=n/2;i++)
{
if(fmod(n,i)==0){f=1;break;}
else;
}
if(f)return 0;
else return 1;
}
int sc(int n) \\sc:square check
{
if(fmod(sqrt(n),1)==0)return 1;
else return 0;
}
void main()
{
long double i=1,n=1000;
cout<<"n\t\t6n-1\t\t6n+1\t\tRem.";
for(;i<=n;i++)
{
cout<<"\n"<
: