pete-8.c is one of the nine entries an anonymous "Pete" submitted to Bignum Bakeoff. It was a failed attempt at improving upon Pete's largest entry, pete-7.c, and it produces a much smaller number than pete-7.c because the f(n) function Pete defines in this program has a bug which causes f(n), no matter what n equals, to equal the square of a previously defined number. It is almost identical to it successor, pete-9.c. The output of pete-8.c can be precisely expressed as \(z^{16\cdot17^6}(999)\), where \(z(n) = 9\cdot 2^n\).
| Attributes | Values |
|---|
| rdfs:label
| |
| rdfs:comment
| - pete-8.c is one of the nine entries an anonymous "Pete" submitted to Bignum Bakeoff. It was a failed attempt at improving upon Pete's largest entry, pete-7.c, and it produces a much smaller number than pete-7.c because the f(n) function Pete defines in this program has a bug which causes f(n), no matter what n equals, to equal the square of a previously defined number. It is almost identical to it successor, pete-9.c. The output of pete-8.c can be precisely expressed as \(z^{16\cdot17^6}(999)\), where \(z(n) = 9\cdot 2^n\).
|
| dcterms:subject
| |
| dbkwik:googology/p...iPageUsesTemplate
| |
| abstract
| - pete-8.c is one of the nine entries an anonymous "Pete" submitted to Bignum Bakeoff. It was a failed attempt at improving upon Pete's largest entry, pete-7.c, and it produces a much smaller number than pete-7.c because the f(n) function Pete defines in this program has a bug which causes f(n), no matter what n equals, to equal the square of a previously defined number. It is almost identical to it successor, pete-9.c. The output of pete-8.c can be precisely expressed as \(z^{16\cdot17^6}(999)\), where \(z(n) = 9\cdot 2^n\).
|