X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: f996b,43829188203eedab
X-Google-Attributes: gidf996b,public
X-Google-ArrivalTime: 2001-08-23 14:46:43 PST
Path: 
 archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!news.tele.dk!small.news.tele.dk!130.133.1.3!fu-berlin.de!uni-berlin.de!a1as05-p29.mch.tli.DE!not-for-mail
From: Michael Schierl <schierlm-usenet@gmx.de>
Newsgroups: alt.ascii-art
Subject: Re: mathematical expressions
Date: Thu, 23 Aug 2001 23:46:26 +0200
Lines: 68
Message-ID: <9m3tk1$8g26$1@ID-39741.news.dfncis.de>
References: <3B80D892.C7B984F9@rz.uni-karlsruhe.de>
 <9lsjqs$4in$1@cantuc.canterbury.ac.nz>
 <3B82119F.1AB52C53@rz.uni-karlsruhe.de>
 <9ltdks$cs7$1@cantuc.canterbury.ac.nz>
 <slrn9o4mbl.fe0.spamblock@localhost.localdomain>
 <9lv7lr$18d$1@cantuc.canterbury.ac.nz>
Reply-To: schierl@gmx.de
NNTP-Posting-Host: a1as05-p29.mch.tli.de (195.252.163.29)
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Trace: fu-berlin.de 998603202 278598 195.252.163.29 (16 [39741])
X-Newsreader: Forte Agent 1.8/32.548
Xref: archiver1.google.com alt.ascii-art:7113

mathwft@math.canterbury.ac.nz (Bill Taylor) wrote:

>|> >         .-----------------------------------------------------------
>|> >        /        .------------------------------------------------
>|> >       /        /       .-------------------------------------
>|> >      /        /       /        .--------------------------
>|> >     /        /       /        /        .---------------
>|> >    /  1 + 1 / 1 + 2 /  1 + 3 /  1 + 4 /  1 + 5 /~~~...
>|> >   v        v       v        v        v        v
>|> 
>|> Is that ----------------------^ 3 * square root(1+...) or cube root(1+...) ?
>
>Ambiguous indeed.
>
>Yes, they are all square roots.   Multiplied in front by "n".
>
>Happy solving.   (It's not all that hard, BTW...)

i would say 

gur erfhyg vf rknpgyl gjb.
(ROT13)

it is simple to determine this by a small program (i have tried it in
Q(uick)Basic). Calculate the value while ~~~... in the above
expression is zero and while it is e.g 1e+20 and when the result is
nearly the same, it is ok. going up to sqrt(26) is enough.

For the prog, see my sig (which is too long...)

ob-Ascii (it's my first):
  ____________
 |.----------.|
 ||12345678. ||
 |`----------'|
 |    _       |
 | % V  CE ON |
 |[] [] [] [] |
 |M+ M- MR MC |
 |[] [] [] [] |
 | 7  8  9  : |
 |[] [] [] [] |
 | 4  5  6  * |
 |[] [] [] [] |
 | 1  2  3  - |
 |[] [] [] [] |
 | 0  , +/- + |
 |[] [] [] [] |
 |____________|

Michael
-- 
DIM i AS INTEGER, x AS SINGLE, y AS SINGLE, ky AS STRING
FOR i = 1 TO 50
  x = 0
  y = 1E+30
  FOR j = i TO 1 STEP -1
   x = SQR(x) * j + 1
  NEXT
  FOR j = i TO 1 STEP -1
   y = SQR(y) * j + 1
  NEXT
  PRINT i, SQR(x), SQR(y)
  DO
    ky = INKEY$
    IF ky = CHR$(27) THEN END
  LOOP UNTIL ky <> ""
NEXT