Roshan's Conjecture: Revision history

From Rest of What I Know

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

16 June 2024

  • curprev 06:1106:11, 16 June 2024‎ 2601:645:8781:9410:4805:6ef2:b9ba:b784 talk‎ 993 bytes +44‎ No edit summary cin gbere le
  • curprev 06:0706:07, 16 June 2024‎ Roshan talk contribs‎ 949 bytes +949‎ Created page with "When I was a young child, I noticed a pattern. Every number past 3 seemed to have a pair of primes 'around' it. # <math> (4-1) < 4 < (4+1) </math> # <math> (5-2) < 5 < (5+2) </math> # <math> (6-1) < 6 < (6+1) </math> # <math> (7-4) < 7 < (7+4) </math> # <math> (11324-45) < 11324 < (11324+45) </math> Notice how for every number you can think of, there's a prime below it and a prime above it equidistant from it. Better stated, what I concluded was that: <math>\forall n..."
Retrieved from ‘https://wiki.roshangeorge.dev/index.php/Roshan%27s_Conjecture’