olymmath

US-TST 2014 Problem 6

    For a prime pp, a subset SS of residues modulo pp is called a sum-free multiplicative subgroup of Fp\mathbb{F}_{p} if - there is a nonzero residue α\alpha modulo pp such that S={1,α1,α2,…}S=\left\{1, \alpha^{1}, \alpha^{2}, \ldots\right\} (all considered  mod p\bmod p ), and - there are no a,b,c∈Sa, b, c \in S (not necessarily distinct) such that a+b≡c( mod p)a+b \equiv c(\bmod p). Prove that for every integer NN, there is a prime pp and a sum-free multiplicative subgroup SS of Fp\mathbb{F}_{p} such that ∣S∣≥N|S| \geq N.

    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 us-tst/2014/p6 · Tag 4874R9NB46 · Edit this page on GitHub · Keys: j next, k previous