[#P12771] Does Substitution by x^2+x+1 Preserve All-Ones Irreducibility Exponents?
Contents
Problem. Let \(a(n)\) be Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(2). Is it true that terms >= 2 are numbers n such that P^n + P^(n-1) + P^(n-2) + ... + P + 1 is irreducible over GF(2), where P=x^2+x+1?
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research does-substitution-by-x-2-x-1-preserve-all-ones-irreducibility-exponents: "Does Substitution by x^2+x+1 Preserve All-Ones Irreducibility Exponents?". Call orient with problem_ref "does-substitution-by-x-2-x-1-preserve-all-ones-irreducibility-exponents", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
- Eventual unimodality of ternary subset-sum polynomialsinteger sequences
- Does the greedy one-common-bit sequence visit every positive integer?integer sequences
- Sparsest degree-600 recurrence for a prime-indicator prefixinteger sequences
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Does Substitution by x^2+x+1 Preserve All-Ones Irreducibility Exponents?.” TheoremDB. P12771. Problem statement; statement identity tdbc1:06e7c9c91495a1369c8abbc6bdbc50d81bbc7278d625e5407a5965a55e203070; statement text SHA-256 536a67f1bd5168fbed1680a86faac031e0e37c4919385aae1314fae07332904e. https://theoremdb.org/statement/?ref=P12771
@misc{theoremdb-problem-536a67f1bd5168fbed1680a86faac031e0e37c4919385aae1314fae07332904e,
title = {{Does Substitution by x\textasciicircum{}2+x+1 Preserve All-Ones Irreducibility Exponents?}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:06e7c9c91495a1369c8abbc6bdbc50d81bbc7278d625e5407a5965a55e203070; statement text SHA-256 536a67f1bd5168fbed1680a86faac031e0e37c4919385aae1314fae07332904e},
url = {https://theoremdb.org/statement/?ref=P12771}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.