What are the possible values of m and n for which Q divides P?

In summary, the problem is to determine m and n such that Q divides P, given P = (X+2)m+(X+3)n and Q = x2+5x+7. The solution involves finding the remainder of P divided by Q and using different cases based on the remainder values of m mod 3. The possible solutions for m and n are given by the set S = {{m = 3*u; n = 6*v+3}, {m = 3*u+1; n = 6*v+5}, {m = 3*u+2; n = 6*v+1}}. Effort should be shown before asking for help.
  • #1
larry91
12
0
Hi everybody! I have this problem: Either P = (X+2)m+(X+3)n and Q = x2+5x+7;
Determine m, n such that Q | P;( m, n = ? (Q divide P));

May you help me please?
Thank You!
 
Last edited:
Physics news on Phys.org
  • #2


We'll be happy to help you, but not unless you show some effort first...
 
  • #3


Ok! I try this, but I dislike this method:
Either 'P mod Q' the rest of the P at Q rapport;
(x+2)2 mod Q = -(x+3)
(x+2)3 mod Q = (x+2)2(x+2) mod Q = (-(x+3)(x+2)) mod Q = 1
=> the debris of (x+2)m at Q are repeated from 3 to 3;
(x+3)2 mod Q = x+2
(x+3)3 mod Q = ((x+2)(x+3)) mod Q = -1
(x+3)4 mod Q = -(x+3) mod Q = -(x+3)
(x+3)5 mod Q = -(x+2)
(x+3)6 mod Q = 1
=> the debris of (x+3)n at Q are repeated from 6 to 6;

P mod Q = ((x+2)m mod Q + (x+3)n mod Q) mod Q = 0;

1) If m mod 3 = 0 => (x+2)m mod Q = 1 => (x+3)n mod Q = -1 => n mod 6 = 3 => m = 3*u; n = 6*v+3

2) If m mod 3 = 1 => (x+2)m mod Q = x+2 => (x+3)n mod Q = -(x+2) => n mod 6 = 5 => m = 3*u+1; n = 6*v+5

3) If m mod 3 = 2 => (x+2)m mod Q = -(x+3) => (x+3)n mod Q = x+3 => n mod 6 = 1 => m = 3*u+2; n = 6*v+1

=> S={{m = 3*u; n = 6*v+3}, {m = 3*u+1; n = 6*v+5}, {m = 3*u+2; n = 6*v+1}}
 

1. What is the definition of divisibility of polynomials?

Divisibility of polynomials refers to the property of one polynomial being able to divide evenly into another polynomial, leaving no remainder. This is similar to the concept of divisibility in arithmetic, where one number divides evenly into another with no remainder.

2. How do you know if one polynomial is divisible by another?

A polynomial is divisible by another polynomial if the remainder of the division is equal to zero. This can be determined by using the division algorithm, which involves dividing the coefficients of the polynomials and comparing the remainder to zero.

3. What is the importance of divisibility of polynomials in mathematics?

Divisibility of polynomials is an important concept in mathematics as it allows for simplifying and solving equations involving polynomials. It also plays a crucial role in the process of factoring polynomials, which is essential in various areas of mathematics such as algebra and calculus.

4. How does the degree of a polynomial affect its divisibility?

The degree of a polynomial is a key factor in determining its divisibility. A polynomial of higher degree can only be divided by a polynomial of equal or lower degree. For example, a polynomial of degree 4 can be divided by a polynomial of degree 2 or 3, but not by a polynomial of degree 5.

5. Can a polynomial be divisible by more than one polynomial?

Yes, a polynomial can be divisible by more than one polynomial. This is known as common factors or common divisors. For example, if both polynomials have a common factor of x, then the polynomial is divisible by both x and the other polynomial.

Similar threads

  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
13
Views
2K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
Replies
11
Views
364
  • General Math
Replies
4
Views
868
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
Back
Top