Showing 1 - 2 results of 2 for search '"Mersenne conjectures', query time: 0.02s Refine Results
  1. 1
  2. 2

    The 3𝑥+1 Problem as a String Rewriting System by Joseph Sinyor

    Published 2010-01-01
    “…This approach enables the conjecture to be recast as two assertions. (I) Every odd 𝑛∈𝐍 lies on a distinct 3𝑥+1 trajectory between two Mersenne numbers (2𝑘−1) or their equivalents, in the sense that every integer of the form (4𝑚+1) with 𝑚 being odd is equivalent to 𝑚 because both yield the same successor. …”
    Get full text
    Article