Re: [math-fun] Origin of SQRT hack? -- inverse problem

Suppose you go t'other way: given flonum x approximate x^2 by left shifting it (assume no overflow). How close? Can you get it even closer using only a fixed number of "linear" operations (add, shift, bitwise logical ops etc)--short, of course, of "morally" multiplying via shift-and-add etc?