inline int meetsCriteria(const number x, const number y) { return isPentagonal(x+y) && isPentagonal(diff(x,y)); }
int main(){ uint64_t i = 0, j = 1, num1 = 0, num2 = 0, num3 = 0; int found = 0; //printf("%d", isPentagonal(22)); while(!found){ i++; num1 = i * (3*i - 1)/2; for(j=1; j<i; j++){ num2 = j * (3*j - 1)/2; num3 = num1 + num2; num2 = num1 - num2; //printf("%" PRIu64 " ""%" PRIu64 " ""\n", num3, num2); if(num2 < 0){ num2 *= -1; } if(isPentagonal(num3) && isPentagonal(num2)){ printf("ans = ""%" PRIu64 "\n", num2); found = 1; break; } } } return 0; }
std::string Problem044::get_answer() { int x = 1; while (true) { int pnx = pentagonalNumber(x); for (int y = x - 1; y > 0; --y) { int pny = pentagonalNumber(y); if (isPentagonal(pnx + pny) && isPentagonal(pnx - pny)) { return std::to_string(pnx - pny); } } ++x; } }
int main() { unsigned long long i, j, D, pi, pj; for(i=1; i<3000; i++) { pi = i*(3*i-1)/2; for(j=1; j<i; j++) { pj = j*(3*j-1)/2; if(isPentagonal(pi+pj) && isPentagonal(pi-pj)) D = pi - pj; } } printf("\033[1mResultat : %lld\033[0m\n", D); return 0; }
int64_t Problem45::solve() { int start = HEXAGONAL_START; while(++start) { if(isPentagonal(getHexagonal(start))) break; } return getHexagonal(start); }
int main() { unsigned long long n=144; while(!isPentagonal(n*(2*n-1))) { n++; printf("%lld\n",n*(2*n-1)); } printf("\033[1mResultat : %lld @ %lld\033[0m\n", n, n*(2*n-1)); return 0; }
int main(void) { int i, j, k, l; int pl, pj, pk; int p; int D; l = 3; pl = getP(l); for(;;) { for (k = 1; k < l; ++k) { pk = getP(pk); //p = (pl > pk) ? pl - pk : pk - pl; D = abs(pl - pk); if (isPentagonal(D)) { if (isPentagonal(pl + pk)) { printf("%d\n", D); } } } ++l; pl = getP(l); } //stop: //printf("pl = %d, pj = %d, pk = %d\n", pl, pj, pk); return 0; }
int main() { long n = 144, hexNum = 0; do { hexNum = n * (2 * n - 1); if(isTriangular(hexNum) && isPentagonal(hexNum)) { std::cout << hexNum << std::endl; break; } n++; } while(true); return 0; }