Skip to content

Erdős problem 445

Start work

Is it true that, for any c>1/2c>1/2, if pp is a sufficiently large prime then, for any n≥0n\geq 0, there exist a,b∈(n,n+pc)a,b\in(n,n+p^c) such that ab≡1(modp)ab\equiv 1\pmod{p}?

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:ec945f060c88250f4c3e4348d621595a3fcd0af65bbe0f34d6915fee5d0e21f0
Metadata
sha256:d0b31c15e339c7c60eb2c796451c8a1cd9e95a842ea709a558240b119b8b4fbe
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:42e2498cec3ad0795832fca81563c6de71ca612c2c7d376671329d1ce177b4ab
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON