title: Greatest Common Factor in o(1)?
body: <p>Note: This is not asking how to solve the GCF in O(n)</p>
  
  <p>You have two integers, <code>n</code> and <code>i</code>. How can we (in pseudo-code) calculate <code>GCM(n, i)</code> in constant time, where <code>n</code> and <code>i</code> have the domain of <code>0 -&gt; infinity</code>?</p>
  
  <p>The only solutions I've seen use recursion or loops. I'd like to do it in constant time if that is possible.</p>
  
  <p>Thanks.</p>