# Integer partitioning problem - for fun

1. Jul 10, 2016

### Pepper Mint

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
$x_0=m$
$x_M=x_{M-1}+n$
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. Jul 10, 2016

### Staff: Mentor

In general case you can't.

I would start checking what all xi-xi-1 (actually every xi-xj) have in common.

3. Jul 10, 2016

### micromass

Staff Emeritus
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.

Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted