title: Is it possible to simplify (x == 0 || x == 1) into a single operation?
body: <p>So I was trying to write the <em>n</em>th number in the Fibonacci sequence in as compact a function as possible:</p>
  
  <pre><code>public uint fibn ( uint N ) 
  {
     return (N == 0 || N == 1) ? 1 : fibn(N-1) + fibn(N-2);
  }
  </code></pre>
  
  <p>But I'm wondering if I can make this even more compact and efficient by changing </p>
  
  <pre><code>(N == 0 || N == 1)
  </code></pre>
  
  <p>into a single comparison. Is there some fancy bit shift operation that can do this?</p>