Compute phi in base x

Hi from /sci/...  There was just a short thread about the digits of pi.  I personally think that phi (golden ratio) is far more interesting and was hoping one of you gentlemen might have some code to compute arbitrary digits of phi in any base chosen by the user.  Hopefully it isn't offensive to ask that it be in C.

Since it's purely random, there's going to be some sort of image in there, eventually.  Just curious to see what the first "significant" finding is.

>>19
Not implausible but the coefficients of the matrix grow faster than they shrink. Eventually you will run out of memory, or worse, if you're using fixed point integers, you'll overflow and produce erroneous results. For example, after printing (1 39 35 29 57 46 23 61 10 31 1 23 51 39 12 1 32 23 14) in base 64 one of the coefficients has exceeded 2^64. Overflow isn't a problem for Racket but of course there'd be issues with some naive implementations in C etc.