At 22:37 23-09-98 -0700, you wrote: >Just try >to power :x :y >output exp(ln :x)* :y >end >neuwirth heeft geschreven in bericht ... [snap] That's OK, but in this case we wouldn't know for example, that 1967 are 156-159th digits of 2^999. With Neuwirth minimal multiplication method and some procedures to multiply and add on lists of digits rather then on floating point numbers, I could get all 301 digits of 2^999 in just few minutes with my Logo on a tiny AMD-K5 processor. By the way - is it any clever way to calculate a factoral. My Logo took almost 2 minutes to find 4274883284060025564298013753389399649690343788366813724672000000000000 as 53! Best regards Andrzej B. --------------------------------------------------------------- Please post messages to the Logo forum to logo-l@gsn.org. Mail questions about the list administration to logofdn@gsn.org. To unsubscribe send unsubscribe logo-l to majordomo@gsn.org.
Global SchoolNet Foundation -
Linking Kids Around the World!
Copyright GSN - All Rights Reserved
- Comments
& Questions
Visit GSN's
Global
Schoolhouse for more exciting learning resources!
Search our Site
-
Home