Factorisable quadratics
Excerpt: This problem encourages students to think about the structure of factorisable quadratics and how the coefficients of such quadratics are related to each other. It also offers practice in factorisation and multiplying out pairs of brackets.
Problem
- The quadratic factorises as . In both the original quadratic and the factorised form, all of the coefficients are integers. The quadratic similarly factorises with all of the coefficients being integers. How many quadratics of the following forms factorise with integer coefficients? Here, is allowed to be any integer (positive, negative or zero). For example, in (a), could be , since .
- This time, it is the constant which is allowed to vary. How many quadratics of the following forms factorise with integer coefficients? Here, is allowed to be any positive integer.
- What are the answers to question 2 if is only allowed to be a negative integer?
Generalising
- Can you generalise your answers to the above questions?
- Generalising question 1, if is a fixed integer, how many quadratics of the form factorise with integer coefficients? Here, is allowed to be any integer.
- Further generalising question 1, if and are fixed integers, with positive, how many quadratics of the form factorise with integer coefficients? Again, is allowed to be any integer.
- How can we generalise questions 2 and 3?
Suggestion
- What happens when you multiply out a pair of brackets? Alternatively, if we knew the value of , how would we go about attempting to factorise the quadratic? How might this help us to work out which values of allow us to factorise the quadratic?
If you need a reminder of how to factorise quadratics where the term has a coefficient other than , you may wish to look at the Quadratic grids resource.
Solution
-
- We attempt to factorise the quadratic by finding two integers which multiply to and add to . This is because if our quadratic factorises as , then expanding the brackets gives so we need and . We therefore need to find two integers which multiply to , and there are four such pairs: and and and and and Therefore there are four possible values of . (Why do we not also need to consider and the other way round, and and the other way round, and so on?)
- This is very similar; this time we are looking for pairs of numbers which multiply to , and there are eight of these: and ; and ; and ; and . Thus there are eight possible values of .
- There are four pairs of numbers which multiply to : and (this means the pair and and the pair and ); and . Thus there are four possible values of .
- Now there are five pairs of numbers which multiply to : and ; and ; and . Thus there are five possible values of . Note that the final pair gives , and the quadratic which results is . This is an example of the difference of two squares.
- Thinking about how we factorise this expression (see Quadratic grids for more information on this), we realise that we are looking for two numbers which multiply to and add to . There are six pairs of numbers which multiply to , and each pair has a different sum: and ; and ; and . Therefore there are six possible values for . Another way of approaching this is to note that the quadratic will factorise as with and . Therefore we could have and , and , or , or , or , . This gives solutions. (Why do we not need to consider , ? And why do we need both , and , , for example?) But our other approach gave solutions, so what’s going on here? And which is correct?
- This time we seek pairs of numbers which add to and multiply to . There are lots of these: and ; and ; and ; and ; and ; and ; and ; and , so there are pairs and so possible values for .
- This time, it is the constant which is allowed to vary: How many quadratics of the following forms factorise with integer coefficients, where is a positive integer.
- We want two integers which add to and multiply to . Since has to be positive, the integers must either be both positive or both negative. But as they have to add to , they must therefore both be positive. There are therefore only possible pairs: and (so ); and (so ); and (so ).
- This time, the pair of integers have to multiply to and add to , so they must both be negative, giving the possible pairs and ; and ; and ; and ; and , so there are possibilities for .
- We now need two integers which add to and multiply to , so they must both be positive. Of the pairs which add to (being and ; and ), only gives a multiple of , so there is only one possible value for .
- This time, the integers add to and multiply to ; no pairs which add to multiply to give a positive multiple of , so there are no possible values for .
-
- Now we require two integers which add to and multiply to the negative integer . There are infinitely many such pairs: and ; and ; and ; …; in general and for any positive integer . So there are infinitely many possible values for .
- The same happens here: and ; and , and so on, so again there are infinitely many possible values for .
- This time, we require two numbers which add to and multiply to , a negative multiple of . We could have and ; and ; and ; in general, and (where ); or we could have and ; and ; and ; in general, and (where ). Therefore there are infinitely many possible values for .
- Here, we need two integers which add to and multiply to a negative multiple of . and ; and ; and ; … will do (in general and ), so there are infinitely many possible values for . (There is also another families of solutions, namely and ; and ; …)
-
- If we write , we find that we need , and every different pair of numbers , gives a different value of . (Swapping and doesn’t give a different value of , though.) So the number of different possible values of is the number of pairs and where and where we ignore the order of and . (Note that and/or are allowed to be negative.) A further challenge is to find some sort of formula for the number of such pairs; we will not pursue that here.
- As before, we think about how we factorise this expression (see Quadratic grids for more information on this). We see that we are looking for two numbers which multiply to and add to . Each possible pair of numbers which multiplies to will give a different sum, and so the number of possible quadratics is the number of pairs of numbers which multiply to . As in (a), it would be nice to have some sort of formula for this number.
- We can generalise question 2 in the case that by asking the following: If is a fixed integer, how many quadratics of the form factorise with integer coefficients? Here, is allowed to be any positive integer. Here is one approach to answering this: If we again write , we find that we need , and every different pair of numbers , gives a different value of . (Swapping and doesn’t give a different value of , though.) In addition, since has to be positive, we require and to either both be positive or both be negative. We’ll look at the case where is positive. Then our pair , can be , , or , , or …, or , . So there are pairs. But the order doesn’t matter, and , gives the same value of as , , so we’ve counted each answer twice. So there are different pairs, and so this many possible values of . Is this correct, though? What happens if is odd? And what if is even? We’ll leave the case where is negative for you to think about. If we try generalising question 2 in the case that is not necessarily , we can make our life a little simpler by assuming that is positive. Why are we allowed to do this? Consider and . They have almost the same factorisations, if any, since the second expression is just times the first one, so we can write Then if we can factorise , we get a factorisation of . So if is negative in a quadratic, we can just take out a factor of and answer the resulting question, with the “ positive” and “ negative” questions swapping. So our generalised question will be: If and are fixed integers, with positive, how many quadratics of the form factorise with integer coefficients? Here, is allowed to be any positive integer. This time, as in (b), we require two numbers which add to and multiply to . Since and are positive, is also positive, and so the two numbers which add to must both be positive or both be negative. Since can be any positive number, is any multiple of , and so we are looking for two numbers of the same sign which add to and multiply to give a multiple of . There doesn’t seem to be an obvious way of finding the exact number of such pairs, but we can at least say that there can only be finitely many of them, since they still have to add to . Now let’s generalise question 3. First the case : If is a fixed integer, how many quadratics of the form factorise with integer coefficients? Here, is allowed to be any negative integer. Again, we write , and we need , with every different pair of numbers , giving a different value of . (Swapping and doesn’t give a different value of , though.) This time, since is negative, the two numbers which add to must have different signs, and there are infinitely many possibilities. If is positive, we can take , , or , , and so on (in general, , , where is a positive integer). If is negative, the argument is similar: we can take , , or , , and so on (in general , , where is a positive integer). So there are infinitely many possibilities for . And finally, question 3 in the case that is positive: If and are fixed integers, with positive, how many quadratics of the form factorise with integer coefficients? Here, is allowed to be any negative integer. As before in the generalisation of question 2, we require two numbers which add to and multiply to . But this time, since is positive and is negative, is negative. Since is arbitrary (we can choose it), is any negative multiple of . So we could take the two numbers to be and for any positive integer where . For all large enough , this will be the case. (How large does have to be?) The product of the two numbers is , which is clearly a negative multiple of , so we can take . Therefore each such gives a possible value for , and so there are infinitely many possible values of in this case. We may well not have found all possible values of using this method. But we have shown that there are infinitely many of them. Finding a rule for all possible values of seems as though it will be a lot harder in general, so we will stop here.