title: Algorithm for ProjectEuler Problem 99
body: <p>From <a href="http://projecteuler.net/index.php?section=problems&amp;id=99" rel="nofollow noreferrer">http://projecteuler.net/index.php?section=problems&amp;id=99</a></p>
  
  <blockquote>
    <p>Comparing two numbers written in index
    form like 2<sup>11</sup> and
    3<sup>7</sup> is not difficult, as any
    calculator would confirm that 
    2<sup>11</sup> = 2048  3<sup>7</sup> =
    2187.</p>
    
    <p>However, confirming that
    632382<sup>518061</sup> &gt;
    519432<sup>525806</sup> would be much
    more difficult, as both numbers
    contain over three million digits.</p>
    
    <p>Using <a href="http://projecteuler.net/project/base_exp.txt" rel="nofollow noreferrer">base_exp.txt</a> (right click
    and 'Save Link/Target As...'), a 22K
    text file containing one thousand
    lines with a base/exponent pair on
    each line, determine which line number
    has the greatest numerical value.</p>
  </blockquote>
  
  <p>How might I approach this?</p>