erdős #2

← #1 · #3 → (packet.json; erdosproblems.com)

Can the smallest modulus of a covering system be arbitrarily large?

claimed — no verifier run, no signed judgmentunreviewedOpen. Worked here; no verified result yet.

number theory · disproved · prize $1000 · 0 attempts

Check This Result Yourself

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

OEIS1

A160559 — Minimal covering numbers.12,80,90,210,280,378,448,1386,1650,2200,2464,5346,9750,11264,11466,13000,14994,18954,20384,23166,26656,27846,30294,31122

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

vela reproduce examples/erdos-problems
  • packet.json · sha256 1fa798455b21240300a770d35ee183b7cbce3d4efda81decb68286b6003442ba

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.