How Can Polynomial Remainders Reveal Patterns in Algebra?

  • Thread starter Thread starter coolul007
  • Start date Start date
coolul007
Gold Member
Messages
271
Reaction score
8
While tutoring Algebra, division of polynomials, I ran across those problems with remainders. As an example: (x^2 + 2x + 1)/(x-7) the result is x + 9 with a remainder of 64/(x-7). I then assumed that the remainder was a positive integer and set x-7 equal to the divisors of 64 and solved for x.
x - 7 = 1, x = 8 then the original polynomial became 64+16+1, or 81 of course is divisible by 1.
x - 7 = 2, x = 9, 81+18+1 = 100, 2(50)
x - 7 = 4, x = 11, 121+22+1 = 144, 4(36)
x - 7 = 8, x = 15, 225+30+1 = 256, 8(32)
x - 7 = 16, x = 23, 529+46+1 = 576, 16(36)
x - 7 = 32, x = 39, 1521+78+1 = 1600, 32(50)
x - 7 = 64, x = 71, 5041+142+1 = 5184, 64(81)

I thought this was interesting, however, I could not think of a problem where I could apply this solution. It may work for solving for different bases, etc.
 
Physics news on Phys.org
This is tricky method to solve, yes definitely this method is going to use to find the value of X, this is sort cut method to solve this problem of finding the value of x
 
coolul007 said:
While tutoring Algebra, division of polynomials, I ran across those problems with remainders. As an example: (x^2 + 2x + 1)/(x-7) the result is x + 9 with a remainder of 64/(x-7). I then assumed that the remainder was a positive integer and set x-7 equal to the divisors of 64 and solved for x.
x - 7 = 1, x = 8 then the original polynomial became 64+16+1, or 81 of course is divisible by 1.
x - 7 = 2, x = 9, 81+18+1 = 100, 2(50)
x - 7 = 4, x = 11, 121+22+1 = 144, 4(36)
x - 7 = 8, x = 15, 225+30+1 = 256, 8(32)
x - 7 = 16, x = 23, 529+46+1 = 576, 16(36)
x - 7 = 32, x = 39, 1521+78+1 = 1600, 32(50)
x - 7 = 64, x = 71, 5041+142+1 = 5184, 64(81)

I thought this was interesting, however, I could not think of a problem where I could apply this solution. It may work for solving for different bases, etc.
You would get similar results if you chose x - 2^n + 1 in lieu of x - 7. Or try other negative prime powers plus 1.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top