## Cyclotomic Polynomials

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Let $\phi_{n}(x)$ be the $n$-th cyclotomic polynomial. What are the restrictions to $n$ (if any) to have $\phi_{n}(x)$ divides $\phi_{2n}(x)$ (where division is in $\mathbb{Z}[x]$)?Or is it true that $\frac{\phi_{2n}(x)}{\phi_{n}(x)}\in\mathbb{Z}[x]$ for all integers $n$?

-
Oh I see...but is it still impossible to have "$\phi_{n}(x)$ divides $\phi_{2n}(x)$" (not necessarily over \mathbb{Z}[x])? – Kikiriku Mar 24 2011 at 13:04

2
It's just not possible. – Charles Matthews Mar 24 2011 at 15:05

## 3 Answers

When is a primitive *n*th root of unity also a primitive 2*n*th root of unity? Please note that the answer is never, and this can also be seen by unique factorisation.

-

Clear...thx.... – Kikiriku Mar 24 2011 at 13:11

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Those polynomials are irreducible in $\mathbb Z[X]$ and have different degree... see http://en.wikipedia.org/wiki/Cyclotomic_polynomial

-

2
well, $\phi_{2011}$ and $\phi_{4022}$ have the same degree. – Xandi Tuni Mar 24 2011 at 13:10
Maybe I should think a bit before writing... Of course those polynomials will very often have the same degree (as soon as n is odd)... Kikiriku's answer is much better and does not use the irreducibility of those polynomials... – Aurelien Mar 25 2011 at 13:35

The restrictions are $n$ nonnegative with $n \le 0$. Another characterization is $n=2n.$

I mention that mainly for the humor value. The OEIS comments:

We follow Maple in defining $\Phi_0$ to be $x$; it could equally well be taken to be $1$.

I suppose one could equally well just not define it, a number of sources don't.

$\Phi_{2n}(x)$ is $\Phi_{n}(-x)$ for odd $n$ and $\Phi_n(x^2)$ for even $n$. That would argue that $\Phi_0$ should be $1$ if it is defined.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 26, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9347923398017883, "perplexity_flag": "middle"}