| |
|
|
Jac de Lad | here time one Posting of me:
Verify whether a number number Primzahl is: CompileMarkSeparation
Proc IsPrim
Parameters z&
declare x&,x%
case LT(z&,11):Return If(Or(Or(Or(Equ(z&,2),Equ(z&,3)),Equ(z&,5)),Equ(z&,7)),1,0)
x&=3
whileloop 3,Int(Sqrt(z&)),2
case Equ(Mul(&Loop,Div&(z&,&Loop)),z&):Inc x%
case x%:Break
wend
Return Not(x%)
CompileMarkSeparation Kleinstes common multiple (needed GGT, see supra): CompileMarkSeparation Jac |
|
|
| Profan² 2.6 bis XProfan 11.1+XPSE+XPIA+XPRR (und irgendwann XIDE) Core2Duo E8500/T2250, 8192/1024 MB, Radeon HD4850/Radeon XPress 1250, Vista64/XP | 12/03/05 ▲ |
|
|
|
|
Carlo Keil | Hello Jac,
I recommend, the KGV so To to charge, because otherwise one To grosser worth at product come into being and to a incorrect Result lead can: CompileMarkSeparation Greeting Carlo |
|
|
| |
|
|