XProfan

Window Title "Permutationen in the eindeutigen Lucas-Lehmer code darstellen"
CLS
AppendMenuBar 10, "Summe aufeinanderfolgenden faculties time their index is Nächste_Fakultät-1"
' "https://de.wikipedia.org/wiki/Fakult%C3%A4tsbasiertes_Zahlensystem"
var xf!=0.797:var xr%=(%WinRight- %WinLeft-width(%Hwnd))+1
var yf!=0.72 :var yr%=(%WinBottom-%WinTop-height(%Hwnd))+1
var u%= 640*1.5 : var v%= 480*1.5
Window (u%-xr%)*xf!+xr%, (v%-yr%)*yf!+yr%
SetWindowPos %HWnd=(%maxx-u%)/2,((%maxy-v%)/2) - u%,v%
Declare s$,s!,n!,m!,m&,mmax&,prod!,lprod!,w&[200]
set("decimals",0)
Font 2:randomize
nomoi:
CLS rnd(8^8)
Print " Zugrundeliegende question: which product all Integerzahlen of n To 1 "
Print " yields one bestimmtes Result 'Fakultät of n' = \n ";
Input s$
s!=val(s$)
Print "\n (remainder)-Laufprodukt:"
ausloten:
prod!=1

WhileLoop 2147483647

    n!=&Loop
    lprod!=prod!
    Prod!=Prod!*n!
    case Prod!>S!:break

EndWhile

'print " Drüber:  product 1 .. "; n!;" with product ";tab(40);Prod!
'print " Drunter: product 1 .. "; n!-1; " with product ";tab(40);LProd!
m!=n!-1
m&=m!
case mmax&<m&:mmax&=m&
'print m!,
w&[m&]=w&[m&]+1
S!=s!-LProd!
case s!>0: goto "ausloten"
print
print
'print " = ";mmax&;":";

WhileLoop mmax&,0,-1

    if W&[&Loop]>9:print "'";

        if W&[&Loop]>99:print "'";

            if W&[&Loop]>999:print "'";

            endif

        endif

    endif

    print W&[&Loop];
    'case (&Loop>1):print ",";

EndWhile

WaitInput
clear w&[]
mmax&=0
goto "nomoi"