MathDB
Counting is hard

Source: 2018 AIME I #1

March 7, 2018
AMCAIMEAIME I2018 AIME I

Problem Statement

Let SS be the number of ordered pairs of integers (a,b)(a,b) with 1≤a≤1001 \leq a \leq 100 and b≥0b \geq 0 such that the polynomial x2+ax+bx^2+ax+b can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when SS is divided by 10001000.
Back to ProblemsView on AoPS