Are These Polynomial Factorizations Correct in Z7?

  • Context: MHB 
  • Thread starter Thread starter ertagon2
  • Start date Start date
  • Tags Tags
    Induction Polynomials
Click For Summary

Discussion Overview

The discussion revolves around the factorization of polynomials in the finite field \( Z_7 \). Participants examine specific polynomial expressions, their factorizations, and the implications of these factorizations in the context of greatest common divisors and properties of irreducibility.

Discussion Character

  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant requests verification of their polynomial factorization answers and expresses uncertainty about several responses.
  • Another participant critiques the initial attempts, indicating that many answers are incorrect and provides detailed factorization for the polynomials \( f(x) \) and \( g(x) \), suggesting that \( f(x) = (x+ 1)^2(x^2- x+ 1) \) and \( g(x) = (x- 1)(x+ 1)^2(x^2- x+ 1) \).
  • A participant discusses the requirements for mathematical induction, correcting misconceptions about the number of base cases needed and the nature of reasoning involved.
  • Another participant provides factorizations for \( x^3 - 1 \) and \( x^4 - x^3 + x^2 - 1 \) in \( Z_7 \), noting that \( x^2 - x + 1 \) is irreducible while \( x^3 + x + 1 \) remains irreducible in \( Z_7 \).
  • There is a query about the greatest common divisor of the factored forms of the polynomials discussed.

Areas of Agreement / Disagreement

Participants express differing views on the correctness of the initial polynomial factorizations, with some asserting errors in the original claims while others seek clarification and verification of their own work. The discussion remains unresolved regarding the overall correctness of the factorizations and the implications for greatest common divisors.

Contextual Notes

There are limitations regarding the assumptions made about irreducibility and the specific properties of polynomials in \( Z_7 \). The discussion does not resolve the mathematical steps necessary to fully establish the greatest common divisor.

ertagon2
Messages
36
Reaction score
0

Attachments

  • Maths61-2.png
    Maths61-2.png
    20.8 KB · Views: 169
  • Maths61-3.png
    Maths61-3.png
    15.7 KB · Views: 171
  • Maths61-4.png
    Maths61-4.png
    16.2 KB · Views: 163
Physics news on Phys.org
Oh, dear. You have left almost all of them blank and those you have tried to answer, the "multiple choice" questions, are mostly wrong.

The first question asks you to find the Greatest Common Divisor of $$f(x)= x^4+ x^3+ x+ 1$$ and [math]g(x)= x^5- x^3+ x^2- 1[/math]. We need to factor those to see what possible divisors there are. The first thing I notice is that [math]f(-1)= 1- 1- 1+ 1= 0[/math] which means f has x+ 1 as a factor. Dividing f by x+ 1 gives [math]x^3+ 1[/math]. But [math](-1)^3+ 1= -1+ 1= 0[/math] also so there is another factor of x+ 1. Dividing [math]x^3+ 1[/math] by x+ 1 we get [math]x^2- x+ 1[/math]. That does not factor (in the real numbers) since the quadratic formula give complex roots. [math]f(x)= x^4+ x^3+ x+ 1= (x+ 1)^2(x^2- x+ 1)[/math].

And I see that [math]g(1)= 1- 1+ 1- 1= 0[/math] so g(x) has x- 1 as a factor. In fact [math]g(x)= (x- 1)(x^4+ x^3+ x+ 1)[/math]. And (-1)^4+ (-1)^3+ (-1)+ 1= 1- 1- 1+ 1= 0 so we have an additional factor of x+ 1: [math]g(x)= (x- 1)(x+ 1)(x^3+ 1)[/math]. Again [math](-1)^3+ 1= -1+ 1= 0[/math] so there is another factor of x+ 1: [math]g(x)= (x- 1)(x+ 1)^2(X^2- x+ 1)[/math]. The quadratic formula again shows that [math]x^2- x+ 1[/math] does not factor. [math]g(x)= x^5- x^3+ x^2- 1= (x- 1)(x+ 1)^2(x^2- x+ 1)[/math].<br /> <br /> So what factors do f(x) and g(x) have in common? <br /> <br /> If you expect help with the others, show what you have tried so we will understand what you <b>do</b> know about them!
 
For number 9, "word 5" is "every".

Let P(n) b statement about the natural numbers. If
1. P(1) is true[/b] and
2. P(k) implies P(k+1) for every integer k> 0

then we can conclude that P(n) is true for every $n\in N$.
 
For 10, you have the statement "Every proof by mathematical induction requires at least two base cases to be checked" marked "true". That is incorrect. Proof by induction requires only one "base case" be checked.

And you have the statement "Mathematical induction differs from the kind of induction used in the experimental sciences because it is actually a form of deductive reasoning" marked "false". That is incorrect. "Mathematical Induction" is "deductive reasoning" while the type of "induction" used in the experimental sciences is "inductive reasoning".
 
In 7, $x^3- 1= (x- 1)(x^2- x+ 1)$ and $x^4- x^3+ x^2- 1= (x- 1)(x^3+ x+ 1 )$.
The two polynomials, $x^2- x+ 1$ and $x^3+ x+ 1$ are "irreducible" over the natural numbers. But working in $Z_7$, we need to check their values for x= 0, 1, 2, 3, 4, 5, and 6 "mod 7". $3^2- 3+ 1= 7$ and $5^2- 5+ 1= 25- 5+ 1= 21$, a multiple of 7 so $x^2- x+ 1= (x- 5)(x- 3)$ (mod 7) so we can write $x^3- 1= (x- 1)(x- 3)(x- 5)$ mod 7. No value from 0 to 6 makes $x^3+ x+ 1$ a multiple of 7 so it is irreducible even in $Z_7$.

In $Z_7$ $x^3- 1= (x- 1)(x- 3)(x- 5)$ and $x^4- x^3+ x^2- 1= (x- 1)(x^3+ x+ 1)$. What is the greatest common divisor of those?
 

Similar threads

  • · Replies 24 ·
Replies
24
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K