Skip to content

Erdős problem 686

Start work

Can every integer N≥2N≥2 be written as N=∏1≤i≤k(m+i)∏1≤i≤k(n+i)N=\frac{\prod_{1\leq i\leq k}(m+i)}{\prod_{1\leq i\leq k}(n+i)} for some k≥2k≥2 and m≥n+km≥n+k?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:2c214a2f9fc7d005a7fb987d5aa3f61091efaae4e015b4a9cc3a2314baf6e4c0
Metadata
sha256:50f5e6bae06ad9ae62f78f4b48fe60ba050b9c2102b970dc0930596e736ef6fe
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:45ab4b694871314b92b0a8ce7a83d3eb9050d7689bbcdf512302138c04abfb81
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON