# An interesting proof of polynomial

Prove that x^3m+x^3k+1+x^3n+2 is divisible by x^2+x+1 such that m,k,n are any non -negative integers.

Note by Sayantan Nandy
4 years, 7 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

P(x) is divisible by x-a if P(a)=0. Factor theorem. So, x2+x+1 has two roots -1/2+isqrt(3)/2 and -1/2-isqrt(3)/2 If P(x) is your above polynomial. P(-1/2+isqrt(3)/2)=0 and P(-1/2-isqrt(3)/2)=0. So your polynomial x^3m+x^3k+1+x^3n+2 is divisible by x^2+x+1.

- 4 years, 7 months ago