Let be the number of ordered pairs of integers with and such that the polynomial can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when is divided by .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Take the link to "Counting is Hard" on AOPS ...but honestly, this is too easy(this was 1 on AIME 2018..so you can get the idea..)