An infinite table whose rows and columns are numbered with positive integers, is given. For a sequence of functions
f1(x),f2(x),… let us place the number fi(j) into the cell (i,j) of the table (for all i,j∈N).
A sequence f1(x),f2(x),… is said to be {\it nice}, if all the numbers in the table are positive integers, and each positive integer appears exactly once. Determine if there exists a nice sequence of functions f1(x),f2(x),…, such that each fi(x) is a polynomial of degree 101 with integer coefficients and its leading coefficient equals to 1. algebrafunctionsfunctional equation