Given the following quadratic equations:
- $4n^2 + 128n - 131$
- $4n^2 + 16n - 11$
- $4n^2 + 24n - 3$
Is it possible to determine how many values of n will generate a perfect square? Or better yet, is it possible to determine which values of n will generate a perfect square?
You can complete the square. For the third example, $4n^2+24n-3=(2n+6)^2-39.$ As $(n+1)^2-n^2=2n+1$, this cannot be a perfect square for any $2n+6$ greater than $20$, leaving only $7$ possibilities.
We can do better. You want $(2n+6)^2-39=p^2.$ This means $39=(2n+6-p)(2n+6+p)$. There will be one solution for each way to factor $39$ into two numbers. Because of the $2n,$ you need the sum of the numbers to be even, which will be true for odd numbers like $39$ and will be the case for your other three examples.