ProbXiv
Explorersign in
Problem archiveProblem record

Statement

  1. (proposed by Ben Green) Cover the integers {1, 2, . . . , N } by residue classes ap (mod p), one residue class per prime. (1) Can you cover each number twice (meaning at least 2 times each), using only primes p \leq N ? (This Pwas asked by Erdős.) (2) Can you do it with p 1/p \leq K ? (This has been considered by Erdős– Ruzsa and by Hildebrand.) 13. (proposed by Sarah Peluse and Robert Lemke Oliver) In 2000, Daniel Shiu showed that if (a, q) = 1, then there exist arbitrarily long strings of consecutive primes ≡ a (mod q). 14. (proposed by Simon Myerson) Can one develop something like the circle method, or Weyl sums, or Poisson summation for quaternions? 9. (proposed by Trevor Wooley) Suppose that f (x) \in Z[x] has degree d \geq 2. We say that f is 2-superirreducible if f (g(x)) is irreducible whenever the degree of g(x) \in Z[x] is \leq 2. In 1967, Schinzel showed that if deg f = d \geq 3, then there is a polynomial g of degree d − 1 such that f (g(x)) is reducible. Question: Does there exist a polynomial of degree 5 that is 2-superirreducible? (This is a question of J. Bober, D. Fretwell, G. Kopp, L. Du and T. Wooley). 10. (proposed by Trevor Wooley) dIf G is a finite\timesabelian group, then there exist integers n and d such that G \sim = z : z \in (Z/nZ) . Obtain sharp upper bounds for the parameters n and d in terms of |G|. 11. (proposed by Jori Merikowski) Do there exist polynomials f, g \in Z[x1 , . . . , x4 , x5 ] with f homogeneous of degree 3 and g homogeneous of degree 2 such that f 2 + g 3 = N (x1 , . . . , x5 ) = NK/Q (x1 \omega1 + \cdot \cdot \cdot + x5 \omega5 ) ?

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.