I want to add something here: great mathematicians compute too. They also know how to perform an algorithm. It is in performing, say, long division, that you start to notice things like when 10 is a primitive root modulo the divisor. Gauss spent his down time counting primes (in his head, he said). Riemann's notes were full of haphazard computations. Amidst his scratch work where the Riemann-Siegel formula appears, t…
> One striking characteristic of Grothendieck’s mode of thinking is that it seemed to rely so little on examples. This can be seen in the legend of the so-called “Grothendieck prime”. In a mathematical conversation, someone suggested to Grothendieck that they should consider a particular prime number. “You mean an actual number?” Grothendieck asked. The other person replied, yes, an actual prime number. Grothendieck suggested, “All right, take 57.”
( taken form http://www.ams.org/notices/200410/fea-grothendieck-part2.pdf )
Btw, 57 is now jocularly referred to as the "Grothendieck prime".