Well after you complete the second part and get the answer you were guaranteed a job at google, if you solved this equation. Since you already have f one to f four you would have to find f five, keep in mind dont disregard the e, e is composed of 5 million digits. Next you would apply the string of e to 100,000 decimal places. Then you would make a code in c or c++ which would look something like this if u make in c.
#include <stdio.h>
/*
The first prime numbers, easy enough, let's just enter them
here directly, why not
*/
int prime[] = {
0,1,2,3,5,7,11,13,17,19,23,29,
31,37,41,43,47,53,59,61,67,71,
73,79,83,89,97,101,103,107,109,113,
127,131,137,139,149,151,157,163,167,173,
179,181,191,193,197,199,211,223,227,229,
9999 /* just to detect when we're done */
};
/*
Again, put here the output of the first program,
with 2000 digits from e or so, or whatever way you'd
like to do this....
*/
char *e= "....";
main() {
double z;
int zi,s,i;
for(i=1;prime[i]<999;i++) {
s = prime[i];
/* Again, do this thing below any way you want it */
zi = (e[s]-'0') + (e[s+1]-'0') + (e[s+2]-'0') + (e[s+3]-'0')+
(e[s+4]-'0') + (e[s+5]-'0') + (e[s+6]-'0') + (e[s+7]-'0')+
(e[s+8]-'0') + (e[s+9]-'0');
if(zi==49) {
/* And again, you can get fancy here to get the output
of the 10 digit sequences, but this will do */
printf("Value %d (%d) = %c%c%c%c%c%c%c%c%c%c\n",
i,s,
e[s], e[s+1],e[s+2],e[s+3],e[s+4],
e[s+5],e[s+6],e[s+7],e[s+8],e[s+9]);
}
}
}
The only pattern that matters is that all 4 numbers are a string of 10-digit numbers adding up to 49 which is easy to get at. After that you would get a password in order to log in to the linux.org using bobsyouruncle as a user name and a answer that you came up with as your password to get in.
