DICLIB.COM
KI-basierte Sprachtools

Alle Tools Abonnement Kontaktieren Sie uns

Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆

Sprache:

Übersetzung und Analyse von Wörtern durch künstliche Intelligenz

Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:

wie das Wort verwendet wird
Häufigkeit der Nutzung
es wird häufiger in mündlicher oder schriftlicher Rede verwendet
Wortübersetzungsoptionen
Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
Etymologie

polynomial irreducibility - Übersetzung nach russisch

THEOREM

Eisenstein polynomial; Eisenstein criterion; Eisenstein's Irreducibility Criterion; Eisenstein's irreducibility criterion; Eisenstein irreducibility criterion; Schönemann-Eisenstein theorem; Schönemann–Eisenstein theorem; Eisenstein Criterion

polynomial irreducibility

математика

неприводимость многочленов

reducible polynomial

IRREDUCIBLE ELEMENT IN THE RING OF POLYNOMIALS; A NON-CONSTANT POLYNOMIAL THAT IS NOT THE PRODUCT OF TWO NON-CONSTANT POLYNOMIALS

Prime polynomial; Reducible polynomial; Algorithms for factoring polynomials

математика

приводимый многочлен

irreducible polynomial

IRREDUCIBLE ELEMENT IN THE RING OF POLYNOMIALS; A NON-CONSTANT POLYNOMIAL THAT IS NOT THE PRODUCT OF TWO NON-CONSTANT POLYNOMIALS

Prime polynomial; Reducible polynomial; Algorithms for factoring polynomials

общая лексика

неприводимый многочлен

неприводимый полином

Definition

Polynomial

·adj Containing many names or terms; multinominal; as, the polynomial theorem.

II. Polynomial ·noun An expression composed of two or more terms, connected by the signs plus or minus; as, a² - 2ab + b².

III. Polynomial ·adj Consisting of two or more words; having names consisting of two or more words; as, a polynomial name; polynomial nomenclature.

Weitere Definitionen anzeigen

Wikipedia

Eisenstein's criterion

In mathematics, Eisenstein's criterion gives a sufficient condition for a polynomial with integer coefficients to be irreducible over the rational numbers – that is, for it to not be factorizable into the product of non-constant polynomials with rational coefficients.

This criterion is not applicable to all polynomials with integer coefficients that are irreducible over the rational numbers, but it does allow in certain important cases for irreducibility to be proved with very little effort. It may apply either directly or after transformation of the original polynomial.

This criterion is named after Gotthold Eisenstein. In the early 20th century, it was also known as the Schönemann–Eisenstein theorem because Theodor Schönemann was the first to publish it.

https://en.wikipedia.org/wiki/Eisenstein's criterion

Übersetzung von &#39polynomial irreducibility&#39 in Russisch