ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b,c∈Nb,c\in\mathbb N, and let

f(x)=xn+bϵ1x+cϵ2f(x)=x^n+b\epsilon_1x+c\epsilon_2

be a trinomial of degree n≥4n\ge 4, where ϵ1,ϵ2∈{±1}\epsilon_1,\epsilon_2\in\{\pm1\}. A trinomial has reducibility type (n1,n2,…,nk)(n_1,n_2,\ldots,n_k) if it is a product of irreducible polynomials in Q[x]\mathbb Q[x] with degrees n1,n2,…,nkn_1,n_2,\ldots,n_k.

Bremner and Ulas's conjecture. The reducibility type (1,1,1,n−3)(1,1,1,n-3) does not occur for f(x)f(x).

The conjecture is part of the study of possible factor-degree patterns of trinomials. The source reports that the assertion remains a conjectural obstruction for degree n≥4n\ge4.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.