Skip to content

Erdős problem 1190

Start work

Let ϵm=max⁡∑1ni\epsilon_m=\max \sum \frac{1}{n_i} where the maximum is taken over all finite sequences m<n1<⋯<nkm<n_1<\cdots<n_k for which there exist congruences ai(modni)a_i\pmod{n_i} such that no integer satisfies two such congruences.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:7a1aaab3ea0ca28a610e27ea4703b31aea9f88fe2dbf4d92fb790cb73bee49fd
Metadata
sha256:1892366f7f1871968dc95bc1feb1089732d22b5e54dbae031ec165419cbae8ad
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:af7aee85166d59ee68128ac7dfca3fe461d221ac71d886040f0b46e13bd1df59
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON