olymmath

Putnam 1961 A6

  • Session A

Prove that p(x)=1+x+x2+…+xnp(x)=1+x+x^2 +\ldots+x^n is reducible over F2\mathbb{F}_{2} in case n+1n+1 is composite. If n+1n+1 is prime, is p(x)p(x) irreducible over F2\mathbb{F}_{2} ?

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1961/a6 · Tag 15M5JT8EVQ · Edit this page on GitHub · Keys: j next, k previous