Ivan Shishkin, Rye (1878)

Problems/Real analysisReviewed

Polynomial of prime numbers

by Sequoia·
54
Difficulty scaleÉchelle de difficulté

This score reflects both the level of the required concepts and the difficulty of the solution.Ce score tient compte à la fois du niveau des notions nécessaires et de la difficulté de la résolution.

  1. 1–10First steps / middle schoolPremiers pas / collège
  2. 11–25Beginner / high schoolDébutant / lycée
  3. 26–50Intermediate / undergraduateIntermédiaire / licence
  4. 51–70Advanced / graduateAvancé / master
  5. 71–90Expert / specializedExpert / spécialisé
  6. 91–100Research levelNiveau recherche
These levels are approximate guides.Ces niveaux sont des repères approximatifs.
·
English
EnglishFrançais

Let pnp_n be the nn-th prime number and P(X):=Xn+p1Xn−1+⋯+pn−1X+pn,n∈N∗P(X):=X^n+p_1 X^{n-1}+\dots + p_{n-1} X+p_n, n\in\N^*.
Show that PP is irreducible in Z[X]\Z[X] for all n∈N∗n\in\N^*.

I solved itMark it doneAdd to my listKeep it in your list
I like this problem7 likes

Liked by

References

  1. Phil Caldero
Details

Export references

BibTeXJSON
Show related problems0

No related problems yet.

Solutions

0
Report

For an unclear, ambiguous, or possibly incorrect statement, please use the Discussion tab on the right. Report content that needs moderator intervention, such as dangerous, clearly non-mathematical, or plagiarized content.