Erdős problem 306
If and is squarefree, can always be written as a finite sum of reciprocals of distinct products of two distinct primes?
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded here
- Next gapNot recorded
Result history
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 details
Exact provenance
- Problem row
- sha256:06b5b7791cc127be91c643a6d667508afa3ee856efa51f5f997a2e2841014ca7
- Metadata
- sha256:bac411d1dff0b1c593a85ddc84606447ccf8a16d40cbe5e3b09602e651c9c978
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:82ac6afc4efd933130328a064515d55c9e3de78d430aab7fda0777398c417be7
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb