Does anyone know how to solve this problem? Computer Science: Theory of Computation

4. In class, we considered the function P.1) (* ++1) + as a method to provide a "serial number for each ordered pair (i,j) in N * N. Give a procedure to compute the inverse function. This should take a number k > 0 as input, and find the unique i, j> 0 for which P(i, j) = k. 4. In class, we considered the function P.1) (* ++1) + as a method to provide a "serial number for each ordered pair (i,j) in N * N. Give a procedure to compute the inverse function. This should take a number k > 0 as input, and find the unique i, j> 0 for which P(i, j) = k