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=1kaii=1kai\prod_{i=1}^k a_i - \sum_{i=1}^k a_i for some integers ai2a_i\geq 2?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:7131a4eab0c08adddbcc829518a2fdaac31d6cc70fe314e89ce7626fee1a4e70
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page