Define a function f:N→N, f(1)=p+1, f(n+1)=f(1)⋅f(2)⋯f(n)+p, where p is a prime number. Find all p such that there exists a natural number k such that f(k) is a perfect square. functioninductionalgebrapolynomialmodular arithmeticnumber theory proposednumber theory