int Project::truncatable_primes() { Project proj; int i=0,p[50],k=0; cout << "Calculating ......... \n\n\n"; for(i=1;i<5;i++) { p[k]=prime[i]; proj.Con(p,k+1); } cout << "\a\a\aThe sum of the only eleven primes that are both truncatable from left to right and right to left is: " << z <<endl; return 0; }
void Project::Con(int p[],int m) { Project proj; int i=0,n=0,flag=0; for(i=0;i<6;i++) { if(i==1) { continue; } p[m]=prime[i]; if(proj.trun(p,m+1,1)==1) { if(proj.trun(p,m+1,2)==1) { n++; } proj.Con(p,m+1); } } }