CEMC Banner

Problem of the Week
Problem E and Solution
The Sign Switch

Problem

Let \(n\) be a positive integer. How many values of \(n\) satisfy the following inequality? \[(n-1)(n-3)(n-5)\cdots(n-2025)(n-2027) \le 0\] Note: The product on the left side of the inequality consists of \(1014\) factors of the form \(n-d\), where the value of \(d\) starts at \(1\) and increases by \(2\) for each subsequent factor.

Solution

We will consider two cases. First, when the product on the left side equals zero, and then, when the product on the left side is less than zero.

Case 1: \((n-1)(n-3)(n-5)\cdots(n-2025)(n-2027) = 0\)

The product of factors on the left side equals zero when any one of the factors is equal to zero. This happens when \(n=1, 3, 5,\ldots, 2025, \text{ or } 2027\). These are all the odd integers between \(1\) and \(2027\), inclusive. The number of these integers is equal to \(\dfrac{2027+1}{2}=1014\).

Case 2: \((n-1)(n-3)(n-5)\cdots(n-2025)(n-2027) < 0\)

The product of factors on the left side is less than zero when none of the factors are equal to zero and an odd number of the factors are negative. Note that for every integer \(n\), the following is true. \[n-1>n-3>n-5>\cdots>n-2025>n-2027\] Now we notice the following.

This pattern continues, giving a negative product of factors when \(n=2, 6, 10, 14, \ldots, 2022, 2026\). Notice that these form an arithmetic sequence beginning at \(2\) and increasing by \(4\) each time. Since \((2026-2) \div 4 = 506\), there are \(506+1=507\) such values.

When \(n>2027\), all the factors will be positive, and thus their product will also be positive.

Therefore, in total there are \(1014+507=1521\) values of \(n\) that satisfy the inequality.