Next Article in Journal
Navigating the Water–Energy Nexus: A Mathematical Approach
Previous Article in Journal
Demon Registration for 2D Empirical Wavelet Transforms
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalizing the Classical Remainder Theorem: A Reflection-Based Methodological Strategy

by
Salvador Cruz Rambaud
Department of Economics and Business, University of Almería, La Cañada de San Urbano, s/n, 04120 Almería, Spain
Foundations 2024, 4(4), 704-712; https://doi.org/10.3390/foundations4040044
Submission received: 2 October 2024 / Revised: 5 November 2024 / Accepted: 29 November 2024 / Published: 6 December 2024
(This article belongs to the Section Mathematical Sciences)

Abstract

:
The framework of this paper is the presentation of a case study in which university students are required to extend a particular problem of division of polynomials in one variable over the field of real numbers (as generalizing action) clearly influenced by prior strategies (as reflection generalization). Specifically, the objective of this paper is to present a methodology for generalizing the classical Remainder Theorem to the case in which the divisor is a product of binomials ( x a 1 ) n 1 ( x a 2 ) n 2 ( x a k ) n k , where a 1 , a 2 , , a k R and n 1 , n 2 , , n k N . A first approach to this issue is the Taylor expansion of the dividend P ( x ) at a point a, which clearly shows the quotient and the remainder of the division of P ( x ) by ( x a ) k , where the degree of P ( x ) , say n, must be greater than or equal to k. The methodology used in this paper is the proof by induction which allows to obtain recurrence relations different from those obtained by other scholars dealing with the generalization of the classical Remainder Theorem.

1. Introduction

In a classical paper, ref. [1] points out generalization as a powerful tool that permeates the whole science. Specifically, he states that generalization “has helped to extend the frontier of mathematical knowledge in every direction” and, moreover, to the creation of new branches. In the same line, ref. [2] states that “generalization is a critical component of mathematical activity and has garnered increased attention in school mathematics at all levels” and in all areas of mathematics. Moreover, she claims that researchers have highlighted several social and pedagogical influences on generalizing activities by students. According to [3], generalizing is increasingly recognized as the essence of thinking in algebra because it is an act of abstraction. Additionally, when generalizing in problem situations, “students learn to suppress detail and hide the irrelevant features of a situation while paying attention to ideas, qualities, and properties”.
Dumitrascu [4] states that activity theory framework provides basic principles which allows to consider generalization as “an activity that is socially and historically developed through tools and artifacts mediations, internalization of social knowledge, and that is transformed through learning and development”.
Ellis [5] presents several types of generalizations which students have constructed when reasoning in mathematics. Her taxonomy distinguishes between generalizing actions (relating, searching, and extending) and reflection generalizations (identifications or statements, definitions, and the influence of prior ideas or strategies). This paper presents a case study in which university students are required to extend a particular problem of division of polynomials in one variable over the field of real numbers (as generalizing action) clearly influenced by prior strategies (as reflection generalization); that is to say, the presentation of a particular problem which can be more effectively approached in a more general form [6,7,8]. This contribution is similar to [9], with the difference that our case study is presented with the aim that university students can see what is expected from them.
Specifically, the objective of this paper is to generalize the classical Remainder Theorem to the case in which the divisor is a product of binomials ( x a 1 ) n 1 ( x a 2 ) n 2 ( x a k ) n k , where a 1 , a 2 , , a k R and n 1 , n 2 , , n k N . In this way, ref. [10] proposed a generalization for polynomials over commutative coefficient rings which allows calculating the remainder without using the long division method (see also [11]).
The simplest case of this topic is the classical Remainder Theorem, according to which the remainder of the division of a polynomial P ( x ) by the binomial x a is the numerical value of P ( x ) for x = a ; that is to say, P ( a ) . A second approach to this issue is the Taylor expansion of the dividend P ( x ) at a point a which clearly exhibits the quotient and the remainder of the division of P ( x ) by ( x a ) k , where the degree of P ( x ) , say n, must be greater than or equal to k. In effect, the Taylor expansion of P ( x ) at point x = a is:
P ( x ) = P ( n ) ( a ) n ! ( x a ) n + + P ( k ) ( a ) k ! ( x a ) k + + P ( a ) 1 ! ( x a ) + P ( a ) ,
where P ( k ) ( a ) denotes the numerical value of the k-th derivative of P ( x ) at point x = a . Obviously, Equation (1) can be written as
P ( x ) = P ( n ) ( a ) n ! ( x a ) n k + + P ( k ) ( a ) k ! ( x a ) k + + P ( a ) 1 ! ( x a ) + P ( a ) ,
which clearly exhibits that the quotient Q ( x ) of this division is
Q ( x ) : = P ( n ) ( a ) n ! ( x a ) n k + + P ( k ) ( a ) k !
and the remainder R ( x ) is
R ( x ) : = P ( k 1 ) ( a ) ( k 1 ) ! ( x a ) k 1 + + P ( a ) 1 ! ( x a ) + P ( a ) .
Wanicharpichat [12] analyzed the general case in which the divisor is a product of binomials of the form ( x a 1 ) n 1 ( x a 2 ) n 2 ( x a k ) n k , where a 1 , a 2 , , a k R and n 1 , n 2 , , n k N , obtaining a solution for the remainder of the division which involves the successive derivatives of the dividend. The main contribution of the solution presented in this paper is that it does not use the derivatives but a solution derived by recurrence.
On the other hand, ref. [13] presented a generalization of the factor theorem for a given polynomial in the variable x by which, under certain conditions, there exists a factor of the form x n b , for a positive integer n and complex b. These scholars also show the way quadratic factors could be obtained. Finally, ref. [14] proposed a computational methodology which, using vector algebra, generalizes the remainder theorem to divisions for polynomials of any degree over any integral domain.
This paper is organized as follows. After this introduction, Section 2 solves successive generalizations of the classical Remainder Theorem until arriving to a general formula where the divisor is of the form ( x a 1 ) n 1 ( x a 2 ) n 2 ( x a k ) n k , where a 1 , a 2 , , a k R and n 1 , n 2 , , n k N . Finally, Section 3 summarizes and concludes.

2. Generalizing the Classical Remainder Theorem

The content of this section will be developed progressively according to the following subsections.

2.1. Case of a Quadratic Divisor

Let P ( x ) be a polynomial of degree n 2 . Assume that P ( x ) has to be divided by the product of binomials ( x a ) ( x b ) . By first dividing P ( x ) by ( x a ) , one has
P ( x ) = C ( x ) ( x a ) + R ,
where C ( x ) is the quotient and R is the remainder of the division. As obviously C ( x ) is a polynomial of degree n 1 1 , it can be divided by ( x b ) , leading to
C ( x ) = D ( x ) ( x b ) + S ,
where D ( x ) is the quotient and S is the remainder of the new division. By substituting (6) in (5), one has
P ( x ) = D ( x ) ( x a ) ( x b ) + S ( x a ) + R .
Therefore, the remainder of the division P ( x ) : [ ( x a ) ( x b ) ] is
R : = S ( x a ) + R .
By the classical Remainder Theorem,
R = P ( a )
and
S = C ( b ) .
As P ( b ) = C ( b ) ( b a ) + R , taking into account (9) and (10), one has
P ( b ) = S ( b a ) + P ( a ) ,
from where:
S = P ( b ) P ( a ) b a .
If P ( x ) = a n x n + a n 1 x n 1 + + a 0 , a practical arrangement can be used as represented in Figure 1, where calculations have been performed according to Horner’s scheme.
In Section 2.3, we are going to generalize Equation (12) to the case of a cubic divisor. For this purpose, we will write Equation (12) in the following form:
S = P ( a ) a b + P ( b ) b a .
Thus, the remainder of the division P ( x ) : [ ( x a ) ( x b ) ] remains as
R = P ( a ) a b + P ( b ) b a ( x a ) + P ( a ) .
Taking into account that the former remainder is the same as the remainder of the division P ( x ) : [ ( x b ) ( x a ) ] , then Formula (14) can be also written as
R = P ( b ) b a + P ( a ) a b ( x b ) + P ( b ) .
Example 1.
To calculate the remainder of the division of the polynomial P ( x ) = 3 x 3 7 x 2 + 5 x 1 by Q ( x ) = x 2 5 x + 6 , take into account that
  • x 2 5 x + 6 = ( x 2 ) ( x 3 ) .
  • P ( 2 ) = 24 28 + 10 1 = 5 .
  • P ( 3 ) = 81 63 + 15 1 = 32 .
Then,
1.
By considering Formula (14),
R = 5 1 + 32 1 ( x 2 ) + 5 = 27 ( x 2 ) + 5 = 27 x 49 .
2.
By considering Formula (15),
R = 32 1 + 5 1 ( x 3 ) + 32 = 27 ( x 3 ) + 32 = 27 x 49 .

2.2. Particular Case

In the case in which a = b , Formula (12) is indeterminate. So, we can take
S = lim b a P ( b ) P ( a ) b a = P ( a ) .
Then,
R = P ( a ) ( x a ) + P ( a ) .
Example 2.
To calculate the remainder of the division of the polynomial P ( x ) = 3 x 3 7 x 2 + 5 x 1 by Q ( x ) = x 2 4 x + 4 , take into account that
  • x 2 4 x + 4 = ( x 2 ) 2 .
  • P ( 2 ) = 5 .
  • P ( x ) = 9 x 2 14 x + 5 .
  • P ( 2 ) = 36 28 + 5 = 13 .
Then, by considering Formula (19),
R = 13 ( x 2 ) + 5 = 13 x 21 .

2.3. Case of a Cubic Divisor

Let P ( x ) be a polynomial of degree n 3 . Assume that P ( x ) has to be divided by ( x a ) ( x b ) ( x c ) . By first dividing P ( x ) by ( x a ) , one has
P ( x ) = C ( x ) ( x a ) + R ,
where C ( x ) is the quotient and R is the remainder of the division. As C ( x ) is obviously a polynomial of degree n 1 2 , it can be divided by ( x b ) , leading to
C ( x ) = D ( x ) ( x b ) + S ,
where D ( x ) is the quotient and S is the remainder of the new division. Once again, as obviously D ( x ) is a polynomial of degree n 2 1 , it can be divided by ( x c ) , leading to
D ( x ) = E ( x ) ( x c ) + T ,
where E ( x ) is the quotient and T is the remainder of the third division. By substituting successively (22) and (23) in (21), one has
P ( x ) = E ( x ) ( x a ) ( x b ) ( x c ) + T ( x a ) ( x b ) + S ( x a ) + R .
Therefore, the remainder of the division P ( x ) : [ ( x a ) ( x b ) ( x c ) ] is
R : = T ( x a ) ( x b ) + S ( x a ) + R .
By the classical Remainder Theorem,
R = P ( a ) ,
S = C ( b )
and
T = D ( c ) .
As P ( b ) = C ( b ) ( b a ) + R , taking into account (26) and (27), one has
P ( b ) = S ( b a ) + P ( a ) ,
from where
S = P ( b ) P ( a ) b a = P ( a ) a b + P ( b ) b a .
On the other hand, by (24),
P ( c ) = T ( c a ) ( c b ) + S ( c a ) + R
or, equivalently,
P ( c ) = T ( c a ) ( c b ) + P ( b ) P ( a ) b a ( c a ) + P ( a ) ,
from where
T = P ( c ) P ( a ) ( c a ) ( c b ) P ( b ) P ( a ) ( b a ) ( c b ) = P ( c ) P ( a ) ( c a ) ( c b ) + P ( b ) P ( a ) ( b a ) ( b c ) .
If P ( x ) = a n x n + a n 1 x n 1 + + a 0 , a practical arrangement can be used as represented in Figure 2, where calculations have been performed according to Horner’s scheme.
Simple calculation shows that
T = P ( a ) ( a b ) ( a c ) + P ( b ) ( b a ) ( b c ) + P ( c ) ( c a ) ( c b ) .
Thus, the remainder of the division P ( x ) : [ ( x a ) ( x b ) ( x c ) ] remains as
R = P ( a ) ( a b ) ( a c ) + P ( b ) ( b a ) ( b c ) + P ( c ) ( c a ) ( c b ) ( x a ) ( x b ) + P ( a ) a b + P ( b ) b a ( x a ) + P ( a ) .
Observe that the solution of R obtained in Equation (34) is the same as the solution obtained in Equation (15), but adds up a new term (specifically, the quadratic term).
Example 3.
To calculate the remainder of the division of the polynomial P ( x ) = x 5 by Q ( x ) = x 3 x , take into account that
  • x 3 x = x ( x 1 ) ( x + 1 ) .
  • P ( 0 ) = 0 .
  • P ( 1 ) = 1 .
  • P ( 1 ) = 1
Then, by considering Formula (34),
R = 0 1 + 1 2 + 1 2 ( x 0 ) ( x 1 ) + 0 1 + 1 1 ( x 0 ) + 0 = x .

2.4. Particular Case

In the case in which a = b = c , Formula (32) is indeterminate. So, we can take
T = lim ( b , c ) ( a , a ) P ( c ) P ( a ) ( c a ) ( c b ) P ( b ) P ( a ) ( b a ) ( c b ) .
Let c a : = h and c b = b a = h 2 . Therefore, the former limit remains as
T = lim h 0 P ( a + h ) P ( a ) h 2 / 2 P ( a + h / 2 ) P ( a ) h 2 / 4 .
Making simple calculations,
T = lim h 0 P ( a + h ) P ( a ) 1 / 2 [ P ( a + h / 2 ) P ( a ) ] h 2 / 2 = P ( a + h ) 1 / 2 P ( a + h / 2 ) h = P ( a ) 1 2 P ( a ) = 1 2 P ( a ) .
Then,
R = 1 2 P ( a ) ( x a ) ( x b ) + P ( a ) ( x a ) + P ( a ) .
Example 4.
To calculate the remainder of the division of the polynomial P ( x ) = 5 x 4 8 x 3 + 6 x 2 5 x + 2 by Q ( x ) = x 3 + 3 x 2 + 3 x + 1 , take into account that
  • x 3 + 3 x 2 + 3 x + 1 = ( x + 1 ) 3 .
  • P ( 1 ) = 26 .
  • P ( x ) = 20 x 3 24 x 2 + 12 x 5
  • P ( x ) = 60 x 2 48 x + 12
  • P ( 1 ) = 20 24 12 5 = 61 .
  • P ( 1 ) = 60 + 48 + 12 = 120 .
Then, by considering Formula (39),
R = 120 2 ! ( x + 1 ) 2 61 ( x + 1 ) + 26 = 60 x 2 + 59 x + 25 .

2.5. General Case

Let P ( x ) be a polynomial of degree n. Assume that P ( x ) has to be divided by ( x a 1 ) ( x a 2 ) ( x a n ) . By recurrence, it can be shown that
R : = i = 1 n P ( a i ) j i j = 1 n ( a i a j ) i = 1 n ( x a i ) + i = 1 n 1 P ( a i ) j i j = 1 n 1 ( a i a j ) i = 1 n 1 ( x a i ) + + P ( a ) a b + P ( b ) b a ( x a 1 ) + P ( a 1 ) = k = 1 n i = 1 k P ( a i ) j i j = 1 k ( a i a j ) i = 1 k ( x a i ) .
Remark 1.
Observe that if R is the remainder of dividing the polynomial P by ( x a 1 ) ( x a n ) , then R is the interpolation polynomial in Newton’s form for the set of points ( a 1 , P ( a 1 ) ) , , ( a n , P ( a n ) ) ; hence, the natural way to find this R .
In general, if the divisor is ( x a 1 ) n 1 ( x a 2 ) n 2 ( x a k ) n k , then the remainder of the division is
R = R 1 ( x ) + ( x a 1 ) n 1 { R 2 ( x ) + ( x a 2 ) n 2 [ R 3 ( x ) ( x a 3 ) n 3 + R k ( x ) ] } ,
where R 1 ( x ) is the remainder of the division P ( x ) : ( x a 1 ) n 1 , whose quotient is Q 1 ( x ) ; R 2 ( x ) is the remainder of the division Q 1 ( x ) : ( x a 2 ) n 2 , whose quotient is Q 2 ( x ) ; …; and, finally, R k ( x ) is the remainder of the division Q k 1 ( x ) : ( x a k ) n k , whose quotient is Q k ( x ) , in such a way that the degree of Q k ( x ) is less than n k + 1 .
Example 5.
To calculate the remainder of the division of the polynomial P ( x ) = 5 x 4 6 x 3 2 x 2 + 7 x + 9 by Q ( x ) = x 3 + 2 x 2 , take into account that Q ( x ) = x 2 ( x + 2 ) . Obviously, one has
P ( x ) = ( 5 x 2 6 x 2 ) x 2 + ( 7 x + 9 ) ,
from where
Q 1 ( x ) = 5 x 2 6 x 2
and
R 1 ( x ) = 7 x + 9 .
Moreover,
Q 1 ( x ) = ( 5 x 16 ) ( x + 2 ) ,
from where
Q 2 ( x ) = 5 x 16
and
R 2 ( x ) = 30 .
Consequently,
R ( x ) = R 1 ( x ) + x 2 [ R 2 ( x ) ] = ( 7 x + 9 ) + 30 x 2 = 30 x 2 + 7 x + 9 .

3. Conclusions

In this paper, we have presented a case study where a generalization of a topic related to the division of polynomials is presented to university students as a model to follow the strategy of generalizing a mathematical result influenced by previous strategies. Specifically, we have solved the general problem of determining the remainder of the division of a polynomial P ( x ) by a product of binomials D ( x ) = ( x a 1 ) n 1 ( x a 2 ) n 2 ( x a k ) n k . The main advantage of the solution presented in the present paper is that it does not use the successive derivatives of P ( x ) , as in [12]. In effect, one contribution of [12] is Theorem 2.3, which provides a result concerning a special remainder theorem when the polynomial P ( x ) is divided by another polynomial D ( x ) of the form ( x b ) m . Additionally, Theorem 2.5 presents the expression of the quotient in the same case as Theorem 2.3. In these two results, the successive derivatives of P ( x ) have been used. Finally, Theorem 4.1 states the so-called Generalized Quotient and Remainder Theorem, which uses the successive derivatives of D ( x ) . However, in the present paper, derivatives have been only used in the particular cases presented in Section 2.2 and Section 2.4.
The findings of this paper can be applied to the construction and analysis of finite fields of order p n , based on a irreducible polynomial of degree n over a finite field of p elements.

Funding

This research was partially supported by Mediterranean Research Center for Economics and Sustainable Development (CIMEDES).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The author acknowledges the valuable comments and suggestions offered by four anonymous referees.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Winger, R.M. Generalization as a method in teaching mathematics. Math. Teach. 1936, 29, 241–250. [Google Scholar] [CrossRef]
  2. Ellis, A.B. Generalizing-promoting actions: How classroom collaborations can support students’ mathematical generalizations. J. Res. Math. Educ. 2011, 42, 308–345. [Google Scholar] [CrossRef]
  3. Kinach, B.M. Generalizing: The core of algebraic thinking. Math. Teach. 2014, 107, 432–439. [Google Scholar] [CrossRef]
  4. Dumitrascu, G. Understanding the process of generalization in mathematics through activity theory. Int. J. Learn. Teach. Educ. Res. 2017, 16, 46–69. [Google Scholar] [CrossRef]
  5. Ellis, A.B. A taxonomy for categorizing generalizations: Generalizing actions and reflection generalizations. J. Learn. Sci. 2007, 16, 221–262. [Google Scholar] [CrossRef]
  6. Harel, G.; Martin, G. A pedagogical approach to forming generalizations. Int. J. Math. Educ. Sci. Technol. 1988, 19, 101–107. [Google Scholar] [CrossRef]
  7. Hashemi, N.; Abu, M.S.; Kashefi, H.; Rahimi, K. Generalization in the learning of mathematics. In Proceedings of the 2nd International Seminar on Quality and Affordable Education (ISQAE 2013), Johor, Malaysia, 7–10 October 2013; pp. 208–215. [Google Scholar]
  8. Burgos, M.; Tizón-Escamilla, N.; Chaverri, J. A model for problem creation: Implications for teacher training. Math. Educ. Res. J. 2024, 1–30. [Google Scholar] [CrossRef]
  9. Biza, I.; Hewitt, D.; Watson, A.; Mason, J. Generalization strategies in finding the nth term rule for simple quadratic sequences. Int. J. Sci. Math. Educ. 2020, 18, 1105–1126. [Google Scholar] [CrossRef]
  10. Laudano, F. A generalization of the remainder theorem and factor theorem. Int. J. Math. Educ. Sci. Technol. 2019, 50, 960–967. [Google Scholar] [CrossRef]
  11. Cuida, A.; Laudano, F.; Martinez-Moro, E. General remainder theorem and factor theorem for polynomials over non-commutative coefficient rings. Int. J. Math. Educ. Sci. Technol. 2020, 51, 775–785. [Google Scholar] [CrossRef]
  12. Wanicharpichat, W. A Hermite’s interpolation formula with generalized quotient and remainders theorems. Sci. Math. Jpn. Online 2010, e-2010, 183–192. [Google Scholar]
  13. Idarraga, I.R.A.; Salas, A.H. A generalized factor theorem. Int. J. Algebra 2011, 5, 809–816. [Google Scholar]
  14. Hidalgo Rosas, M.A.; Laudano, F. A vectorial approach to generalize the remainder theorem. Ann. Univ. Craiova Math. Comput. Sci. Ser. 2022, 49, 52–61. [Google Scholar] [CrossRef]
Figure 1. Practical arrangement to determine expression (12) (quadratic case). Observe that the calculation of S can easily be performed by applying twice Ruffini’s rule to the polynomial P and then subtracting the obtained results (numerator of S). The denominator of S is simply the subtraction of the given values a and b.
Figure 1. Practical arrangement to determine expression (12) (quadratic case). Observe that the calculation of S can easily be performed by applying twice Ruffini’s rule to the polynomial P and then subtracting the obtained results (numerator of S). The denominator of S is simply the subtraction of the given values a and b.
Foundations 04 00044 g001
Figure 2. Practical arrangement to determine expression (34) (cubic case). Observe that the calculation of T can easily be performed by applying three times Ruffini’s rule to the polynomial P and then subtracting the obtained results (both numerators of T). The denominators of T are simply the subtractions of each value (b or c) and the other two values.
Figure 2. Practical arrangement to determine expression (34) (cubic case). Observe that the calculation of T can easily be performed by applying three times Ruffini’s rule to the polynomial P and then subtracting the obtained results (both numerators of T). The denominators of T are simply the subtractions of each value (b or c) and the other two values.
Foundations 04 00044 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Cruz Rambaud, S. Generalizing the Classical Remainder Theorem: A Reflection-Based Methodological Strategy. Foundations 2024, 4, 704-712. https://doi.org/10.3390/foundations4040044

AMA Style

Cruz Rambaud S. Generalizing the Classical Remainder Theorem: A Reflection-Based Methodological Strategy. Foundations. 2024; 4(4):704-712. https://doi.org/10.3390/foundations4040044

Chicago/Turabian Style

Cruz Rambaud, Salvador. 2024. "Generalizing the Classical Remainder Theorem: A Reflection-Based Methodological Strategy" Foundations 4, no. 4: 704-712. https://doi.org/10.3390/foundations4040044

APA Style

Cruz Rambaud, S. (2024). Generalizing the Classical Remainder Theorem: A Reflection-Based Methodological Strategy. Foundations, 4(4), 704-712. https://doi.org/10.3390/foundations4040044

Article Metrics

Back to TopTop