Algebra · real student question

The function f is defined by f(x) = ax² + bx + c, where a, b and c are constants. The equation f(x) = 0 has solutions x = 1 and x = −7. If a is an integer greater than 1, then a + b ≥ n for every such f. What is the greatest possible value of n?

Question

The function ff is defined by f(x)=ax2+bx+cf(x)=ax^{2}+bx+c, where aa, bb and cc are constants. The equation f(x)=0f(x)=0 has solutions x=1x=1 and x=7x=-7. If aa is an integer greater than 11, then a+bna+b\ge n for every such function ff. What is the greatest possible value of the constant nn?

Step-by-step solution

  1. Turn the roots into a factored form. A quadratic with roots 11 and 7-7 must be a constant multiple of (x1)(x+7)(x-1)(x+7), and that constant is the leading coefficient:

    f(x)=a(x1)(x+7).f(x)=a(x-1)(x+7).

    This is the key move: knowing both roots leaves exactly one free parameter, aa, instead of three.

  2. Expand to read off bb.

    f(x)=a(x2+6x7)=ax2+6ax7a,f(x)=a(x^{2}+6x-7)=ax^{2}+6ax-7a,

    so b=6ab=6a and c=7ac=-7a. Note bb is not free — it is locked to aa.

  3. Express the quantity being bounded.

    a+b=a+6a=7a.a+b=a+6a=7a.

    The question is therefore about how small 7a7a can be.

  4. Minimise over the allowed values of aa. The constraint "aa is an integer greater than 11" means a{2,3,4,}a\in\{2,3,4,\dots\}, so the smallest is a=2a=2, giving a+b=14a+b=14. For every larger integer aa the value 7a7a is bigger, so

    a+b14for every such f.a+b\ge 14\quad\text{for every such }f.

  5. Identify the greatest valid nn. Any n14n\le 14 makes the statement "a+bna+b\ge n for every such ff" true, but n=15n=15 fails at a=2a=2, where a+b=14<15a+b=14<15. So the greatest possible value is n=14n=14. Check: a=2a=2 gives f(x)=2x2+12x14f(x)=2x^{2}+12x-14, whose roots are indeed 11 and 7-7, with a+b=2+12=14a+b=2+12=14.

Answer

n=14n=14

Need to solve a different problem like this? Open the solver →