0 Members and 1 Guest are viewing this topic.

6.283185307179586476925286766559005768394338798750211641949889184615632812572417997256069650684234135964296173026564613294187689219101164463450718816256962234900568205403877042211119289245897909860763928857621951331866892256951296467573566330542403818291297133846920697220908653296426787214520498282547449174013212631176349763041841925658508183430728735785180720022661061097640933042768293903883023218866114540731519183906184372234763865223586210237096148924759925499134703771505449782455876366023898259667346724881313286172042789892790449474381404359721887405541078434352586353504769349636935338810264001136254290527121655571542685515579218347274357442936881802449906860293099170742101584559378517847084039912224258043921728068836319627259549542619921037414422699999996745956099902119463465632192637190048918910693816605285044616506689370070523862376342020006275677505773175066416762841234355338294607196506980857510937462319125727764707575187503915563715561064342453613226003855753222391818432840398

This reminds me... Did i ever get my Hello World walrii points?

2π

Goto 0Lbl 1If min(L₁)>0 and ᴇ10≥max(L₁End0→PMTFor([recursiven],1,dim(L₁PMT+L₁([recursiven]→|Nint(|Nᴇ⁻10→PMT|N-PMTᴇ10→L₁([recursiven]EndIf not(PMTEnd[recursiven]→dim(L₂Ans→dim(ʟQAns→dim(ʟRAns→dim(ʟTPMT→L₁(AnsEndLbl 21+dim(L₁→|NRepeat Ans or |N=1|N-1→|NL₁(|N)-L₂(|NEndEndLbl 0SetUpEditor T,R,Q{30→T6Ans→R{1→QClrHome"?→Str12→I%Lbl 3If 1<length(Str1Then" If not(fPart((length(Str1)-2)/16Output(6+C,1,sub(Ans+Ans,1,162+16int((length(Str1)-114)/16)(130≤length(Str1Output(1,1,sub(Str1,Ans,1-Ans+length(Str1End5ʟT→L₁For(θ,⁻1,0If θGoto 1EndL₁→L₂(9I%-4)ʟQ→L₁For(θ,⁻1,0If θGoto 1End3L₁+5ʟR→L₁For(θ,⁻1,0If θGoto 1End0→PVFor(θ,⁻1,0If θGoto 2EndWhile Ans≥0PV+1→PVL₁-L₂→L₁For(θ,⁻2,0If θ=⁻2Goto 1If θGoto 2EndEndsub("0123456789",PV+1,1If I%=2Ans+".Str1+Ans→Str1(5I%-2)ʟQ+ʟR-PVʟT→L₁For(θ,⁻1,0If θGoto 1End30L₁→L₁For(θ,⁻1,0If θGoto 1EndIf I%<33Then9I%²+9I%+2Else(3I%+1)L₁→L₁For(θ,⁻1,0If θGoto 1End3I%+2EndAnsL₁→L₁For(θ,⁻1,0If θGoto 1EndL₁→ʟR10I%ʟQ→L₁For(θ,⁻1,0If θGoto 1End(2I%-1)L₁→L₁For(θ,⁻1,0If θGoto 1EndL₁→ʟQ3ʟT→L₁For(θ,⁻1,0If θGoto 1EndIf I%<33Then9I%²+9I%+2Else(3I%+1)L₁→L₁For(θ,⁻1,0If θGoto 1End3I%+2EndAnsL₁→L₁For(θ,⁻1,0If θGoto 1EndL₁→ʟTI%+1→I%If getKey≠45 and 1003>length(Str1Goto 3If 1003=length(Str1Pause ClrHome

If someone could post an algorithm to find all the terms of tao in succession i would be willing to golf something up in axe.

Quote from: c4ooo on March 01, 2017, 03:21:41 amIf someone could post an algorithm to find all the terms of tao in succession i would be willing to golf something up in axe.*tauAnd I just posted one.

{30→T6Ans→R{1→QClrHomeFor(I,2,ᴇ4⁻1→V5ʟTFor(θ,V,0If θGoto 1EndʟA→BAns+3(9I-4)ʟQ+5ʟR→ARepeat Ans<0IS>(V,9ʟA-ʟBFor(θ,⁻1,0If θGoto 1EndEndDisp V(5I-2)ʟQ+ʟR-VʟTFor(W,0,1For(Z,1,2If W(3I+Z)ʟAFor(θ,⁻1,0If θGoto 1End30ʟAEndEndʟA→R10IʟQFor(W,⁻1,0For(Z,1,2If not(W(3I+Z)ʟAFor(θ,⁻1,0If θGoto 1End(2I-1)ʟAEndIf WʟA→QIf W3ʟT→AEndʟA→TEndLbl 1DelVar PAns→AFor(M,1,dim(ʟAP+ʟA(M→Nint(Ansᴇ⁻9→PN-Ansᴇ9→ʟA(MEndIf PP→ʟA(Mdim(ʟA→dim(ʟBAns→dim(ʟQAns→dim(ʟRAns→dim(ʟTAns→NRepeat Ans or not(NʟA(N)-ʟB(NDS<(N,0EndEnd

FacebookandTwitterFollow @Codewalr_us