Skip to content

Erdős problem 493

Does there exist a kk such that every sufficiently large integer can be written in the form ∏i=1kai−∑i=1kai\prod_{i=1}^k a_i - \sum_{i=1}^k a_i for some integers ai≥2a_i\geq 2?

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:df5c3161bb7cea5f477fd4b2e59202a62378fb02984ce6c608a5a7d2e9f2a6ed
Metadata
sha256:04831eb63a95d14aa5f8e386917fcab632f11b02c6c23e02ee18a215bc1ab765
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:7131a4eab0c08adddbcc829518a2fdaac31d6cc70fe314e89ce7626fee1a4e70
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb