It might even be done with a recursive DEF FN. I need to think of the code however.

Your program would be then

instead LET A=VAL A$
it will be LET A=FN V(A$)

and a DEF FN V(A$)= .... in the begin of the prog.

... be done with a recursive DEF FN. I need to think of ... (A$)

and a DEF FN V(A$)= .... in the begin ...

... :

10 DEF FN f(n)=VAL "1n*FN f(n-1 ...

10 DEF FN s$(n)=VAL$ """""+"" ""+FN $(n-1)"( TO 2 ...

... up from scratch by a DEF FN statement? Chaosmongers' solutions ... this:

10 DEF FN r$(a$)=a$(2 TO ... a$(1)
20 DEF FN l$(a$)=a$(LEN a ... br />
Hence, FN r$("ABCDEFG") returns BCDEFGA.
FN r$ or FN l$ repeatedly, printing ...

Well there is a function :)

10 DEF FN p$(n) = ("ODD" AND
n/2INT (n/2))+("EVEN" AND n/2=
INT (n/2))
20 PRINT FN p$(3)
30 PRINT FN p$(1000)

... more versatile.

10 DEF FN m(x,y) = x - INT ... />
Example 1
PRINT FN m (5, 1.4)

Example 2
PRINT FN m (5, -1.4)

Example 3
PRINT FN m (-5, 1.4)

Example 4
PRINT FN m (-5, -1.4)

... .

I used the DEF FN routine for it as stated ...

... code]
DEF FN B$(n)=STR$ INT (n/128)+STR$ INT (FN V ... STR$ INT (FN V(FN V(FN V(FN V(FN V(FN V(n,128 ... STR$ INT FN V(FN V(FN V(FN V(FN V(FN V(FN V(n ... /> Similarly:

[code]
DEF FN T$(n)=STR$ INT (n ... )+STR$ INT (FN V(FN V( monty.mole November 2004 Sinclair Basic

... will yield:

[code]DEF FN H$(n)=CHR$ (INT (n ... "optimised" version):

[code]DEF FN D$(n)=CHR$ (INT n ... ]DEF FN H$(n)=FN D$(n/4096)+FN D$(FN V(n,4096)/256)+FN ... D$(FN V(FN V(n,4096),256)/16)+FN D$(FN V(FN V(FN ...

... ;"9")[/code]:

[code]DEF FN D(H$)=(CODE H$(1 ... faster calculation:

[code]DEF FN H$(n)=CHR$ (INT (n ... 9)+48)+CHR$ (INT (FN V(FN V(n,4096),256)/16 ... gt;9)+48)+CHR$ ((FN V(FN V(FN V(n,4096),256 ... ),16))+7*(INT FN V(FN V(FN ...

... head, and I rarely use Def FN`s unless it`s a ...

... and y (inclusive).

DEF FN r(x,y) = INT (RND ... use for ex:
PRINT FN r(10, 100);

... in a def fn as in the next example:
Def fn a$(x ... *int(x/32))
Print Fn a$(45);"..."
That would ...

... last time:

10 DEF FN M(A,A$,Z,P ...

20 LET X=FN M(X,INKEY$,32,"5 ... ","8")
30 LET Y=FN M(Y,INKEY$,22,"6 ...

Oooh, that DEF FN stuff looks like it would be an ideal candidate for RC, no?

[quote]
On 2005-04-13 13:14, Arjun wrote:
Oooh, that DEF FN stuff looks like it would be an ideal candidate for RC, no?
[/quote]
Who you calling arsey???

... you do a

Def FN Tim=PEEK (23672)+256*PEEK ...

... 01:49, CKay wrote:
Def FN Tim=PEEK (23672)+256*PEEK ... like this:

10 DEF FN p(x) = PEEK(x) + 256 ... (x+1)
20 PRINT FN p(23672)

Replace ...

[quote]
On 2005-04-13 13:14, Arjun wrote:
Oooh, that DEF FN stuff looks like it would be an ideal candidate for RC, no?
[/quote]

No, the call of INKEY$ is only done once!

... 01:49, CKay wrote:
Def FN Tim=PEEK (23672)+256*PEEK ... like this:

10 DEF FN p(x) = PEEK(x) + 256 ... (x+1)
20 PRINT FN p(23672)

Replace ... , must admit, after hardly using Def FN`s ever they seem to ...

...

30 DEF FN t()=FN m(FN u(), FN u() ) : REM time, right ...