Skip to content

Erdős problem 1214

Start work

Let x,y≥1x,y\geq 1 be integers such that, for all n≥1n\geq 1, the set of primes dividing xn−1x^{n}-1 is equal to the set of primes dividing yn−1y^n-1. Must x=yx=y?

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:c641dfa6e4b671075a5d71a9a54bc6a9e57ef01e9c0706a3fdb2411c4403f8a6
Metadata
sha256:c0ad22e59d0c72abe97805dc83ccac2a9067094a7f206762a15d17c3f0affb19
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:bcfa9631f9eca8e14363a7132603c7eb3f15a3cd5dedda21042edcc1d7aa8171
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON