title: how work around remainder functions?
body: <p>I am looking at a formula which is:</p>
  
  <blockquote>
    <p>Xn+1 = (a Xn + c)(mod m)</p>
    
    <p>where "n" is number of values which can be from 1 to 1700.   "X" is
    the number. (n+1 and n are both as sub-scripts)</p>
  </blockquote>
  
  <p>I am trying to find possible future outcome of a list of pseudo random numbers (each number has a maximum of 6 digits and can have a value from 000001 to 999999).</p>
  
  <p>I know the values of Xn+1 and Xn; for "m" i am using the value "1000000" or "999999", so the result is always 6 digits or less.</p>
  
  <p>I need to find out value of "a".</p>
  
  <blockquote>
    <p><strong>for reference:</strong> Xn=663354 and Xn+1=142516 OR 211941 OR 453794 OR 512535
    OR 704928 (do not know the order of these numbers but can try them one
    by one myself, if i just can know how to get a value of "a" in the
    above equation)</p>
  </blockquote>
  
  <p>I need to solve this equation or any other if someone can suggest something else.</p>
  
  <p>I am not good at programming; am currently using <code>MS Excel</code> to solve this issue.
  but can understand a little bit of code in <code>VB</code>.</p>
  
  <p>Thanking you in anticipation.</p>