Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Integer partitioning problem - for fun

  1. Jul 10, 2016 #1
    I have a user input of 2 integers (m,n)
    Then my system will generate 1 list of M (m,n < M) integers that start at m and end at Mth integer of value xM. The formula to calculate xM is followed by
    [itex]x_0=m[/itex]
    [itex]x_M=x_{M-1}+n[/itex]
    After the list is generated I randomly delete N (N << M) rows from it and given that my system isn't allowed to remember (m,n), how can I find out what values (m,n) were ?

    For example
    (m,n)=(2,5)
    M=5 => L={2,7,12,17,22}
    deleting L2,4 yields L={2,12,22}
     
  2. jcsd
  3. Jul 10, 2016 #2

    Borek

    User Avatar

    Staff: Mentor

    In general case you can't.

    I would start checking what all xi-xi-1 (actually every xi-xj) have in common.
     
  4. Jul 10, 2016 #3
    As Borek says, you can't do this if you don't know ##N## and ##M##. But you can statistically analyze what the ##n## and ##m## values likely might have been.
     
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Loading...