pete-7.c is the largest of the nine entries an anonymous "Pete" submitted to Bignum Bakeoff. It placed third in the competition, behind marxen.c and loader.c. pete-7.c uses a linear array notation defined by the following rules: * \(f_x(0, 0, \ldots, 0, 0) = x\) * \(f_x(a_1, a_2, a_3, \ldots, a_{n - 1}, a_n + 1) = f_y(a_1, a_2, a_3, \ldots, a_{n - 1}, 0)\) where \(y = f_x(a_1, a_2, a_3, \ldots, a_{n - 1}, a_n)^2\) * \(f_x(a_1, a_2, a_3, \ldots, a_n + 1, 0, 0, \ldots, 0, 0) = f_x(a_1, a_2, a_3, \ldots, a_n, x, x, \ldots, x, x)\)