olymmath

RMM 2024 Problem 6

  • Day 2

A polynomial PP with integer coefficients is square-free if it is not expressible in the form P=Q2RP=Q^{2} R, where QQ and RR are polynomials with integer coefficients and QQ is not constant. For a positive integer nn, let Pn\mathcal{P}_{n} be the set of polynomials of the form

1+a1x+a2x2+⋯+anxn1+a_{1} x+a_{2} x^{2}+\cdots+a_{n} x^{n}

with a1,a2,…,an∈{0,1}a_{1}, a_{2}, \ldots, a_{n} \in\{0,1\}. Prove that there exists an integer NN so that, for all integers n≥Nn \geq N, more than 99%99 \% of the polynomials in Pn\mathcal{P}_{n} are square-free.

Each problem is worth 7 marks. Time allowed: 4124 \frac{1}{2} hours.

Dataset text NuminaMath olympiads. 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

Locator rmm/2024/p6 · Tag W9M2H6Q8R2 · Edit this page on GitHub · Keys: j next, k previous