Rosetta Code

AKS test for primes: Difference between revisions

Page Discussion

AKS test for primes (view source)

Revision as of 13:36, 12 April 2019

117 bytes added ,  5 years ago
→‎{{header|C++}}: Style
Line 448:
}
 
bool checkPrimeisPrime(unsigned long n)
{
if (n > pasTriMax)
Line 477:
}
ifswitch (n == 0)
cout << "(x-1)^0 = 1" << endl;▼
else if (n == 1)
cout << "(x-1)^1 = x-1" << endl;▼
else
{
pascalTriangle(n);case 0:
cout << "(x-1)^"0 <<= n1" << " = "endl;
cout << "x^" << nbreak;
boolcase bVz = true;1:
int nDiv2 cout << "(x-1)^1 = nx-1" /<< 2endl;
break;
for (unsigned long j = n - 1; j > nDiv2; j--, bVz = !bVz)▼
default:
cout << vz[bVz] << pasTri[n - j] << "*x^" << j;▼
pascalTriangle(n);
for (unsigned long j = nDiv2; j > 1; j--, bVz = !bVz)▼
cout << vz[bVz]"(x-1)^" << pasTri[j]n << "*x^" <<= j";
cout << vz[bVz] << pasTri[1]cout << "*x^" << n;
bool bVz = !bVztrue;
cout << vz[bVz] << pasTri[0] << endl; int nDiv2 = n / 2;
▲ for (unsigned long j = n - 1; j > nDiv2; j--, bVz = !bVz)
▲ cout << vz[bVz] << pasTri[n - j] << "*x^" << j;
▲ for (unsigned long j = nDiv2; j > 1; j--, bVz = !bVz)
cout << vz[bVz] << pasTri[j] << "*x^" << j;
▲ cout << "(x-1)^1vz[bVz] =<< x-pasTri[1"] << endl"*x";
bVz = !bVz;
▲ cout << "(x-1)^0vz[bVz] =<< 1"pasTri[0] << endl;
break;
}
}
Line 503 ⟶ 507:
expandPoly(n);
for (unsigned long n = 2; n <= pasTriMax; n++)
if (checkPrimeisPrime(n))
cout << setw(3) << n;
cout << endl;
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/239996"