Simple Concept Tough Problem-4
“The only way to learn mathematics is to do mathematics !” – Paul Halmos.
Yes, definitely ! The more we do mathematics, the more we lean mathematics. So, here we are with the fourth problem in SCTP series. This problem appeared in PRMO 2017 paper.
If an integer , a natural number and a prime number satisfy , then find the largest possible value of .
We can solve this problem using the concepts of middle term factorization of quadratic polynomial, prime factorization of numbers and a commonly used property of divisibility. Let’s have a look at the following video :