On Thu, Jul 16, 2009 at 1:54 PM, Roger Hui<[email protected]> wrote: > In "At Work and Play in the Fields of J" (1993) > http://www.jsoftware.com/papers/eem/AWPFJ/5.htm > Eugene McDonnell posed the problem, > > Write a numeric constant with value 2147483648 (2^31) > in the fewest characters.
I have found two occupying eight characters, but I have not yet convinced myself that shorter sequences are not possible. FYI, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
