Return to program CVS log

Up to [local] / OpenXM_contrib / pari-2.2 / src / test / 64

Annotation of OpenXM_contrib/pari-2.2/src/test/64/program, Revision 1.1

1.1     ! noro        1:    echo = 1 (on)
        !             2: ? alias(ln,log)
        !             3: ? ln(2)
        !             4: 0.69314718055994530941723212145817656807
        !             5: ? for(x=1,5,print(x!))
        !             6: 1
        !             7: 2
        !             8: 6
        !             9: 24
        !            10: 120
        !            11: ? fordiv(10,x,print(x))
        !            12: 1
        !            13: 2
        !            14: 5
        !            15: 10
        !            16: ? forprime(p=1,30,print(p))
        !            17: 2
        !            18: 3
        !            19: 5
        !            20: 7
        !            21: 11
        !            22: 13
        !            23: 17
        !            24: 19
        !            25: 23
        !            26: 29
        !            27: ? forstep(x=0,Pi,Pi/12,print(sin(x)))
        !            28: 0.E-38
        !            29: 0.25881904510252076234889883762404832834
        !            30: 0.49999999999999999999999999999999999999
        !            31: 0.70710678118654752440084436210484903928
        !            32: 0.86602540378443864676372317075293618346
        !            33: 0.96592582628906828674974319972889736763
        !            34: 1.0000000000000000000000000000000000000
        !            35: 0.96592582628906828674974319972889736764
        !            36: 0.86602540378443864676372317075293618348
        !            37: 0.70710678118654752440084436210484903930
        !            38: 0.50000000000000000000000000000000000002
        !            39: 0.25881904510252076234889883762404832838
        !            40: 4.7019774032891500318749461488889827112 E-38
        !            41: ? forvec(x=[[1,3],[-2,2]],print1([x[1],x[2]]," "));print(" ");
        !            42: [1, -2] [1, -1] [1, 0] [1, 1] [1, 2] [2, -2] [2, -1] [2, 0] [2, 1] [2, 2] [3
        !            43: , -2] [3, -1] [3, 0] [3, 1] [3, 2]
        !            44: ? getheap
        !            45: [3, 24]
        !            46: ? getrand
        !            47: 1
        !            48: ? getstack
        !            49: 0
        !            50: ? if(3<2,print("bof"),print("ok"));
        !            51: ok
        !            52: ? kill(y);print(x+y);reorder([x,y]);print(x+y);
        !            53: x + y
        !            54: x + y
        !            55: ? f(u)=u+1;
        !            56: ? print(f(5));kill(f);
        !            57: 6
        !            58: ? f=12
        !            59: 12
        !            60: ? g(u)=if(u,,return(17));u+2
        !            61: ? g(2)
        !            62: 4
        !            63: ? g(0)
        !            64: 17
        !            65: ? setrand(10)
        !            66: 10
        !            67: ? n=33;until(n==1,print1(n," ");if(n%2,n=3*n+1,n=n/2));print(1)
        !            68: 33 100 50 25 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1
        !            69: ? m=5;while(m<20,print1(m," ");m=m+1);print()
        !            70: 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
        !            71: ? default(realprecision,28)
        !            72:    realprecision = 38 significant digits (28 digits displayed)
        !            73: ? default(seriesprecision,12)
        !            74:    seriesprecision = 12 significant terms
        !            75: ? print((x-12*y)/(y+13*x));
        !            76: (x - 12*y)/(13*x + y)
        !            77: ? print([1,2;3,4])
        !            78: [1, 2; 3, 4]
        !            79: ? print1(x+y);print(x+y);
        !            80: x + yx + y
        !            81: ? print((x-12*y)/(y+13*x));
        !            82: (x - 12*y)/(13*x + y)
        !            83: ? print([1,2;3,4])
        !            84: [1, 2; 3, 4]
        !            85: ? print1(x+y);print1(" equals ");print(x+y);
        !            86: x + y equals x + y
        !            87: ? print1("give a value for s? ");s=input();print(1/(s^2+1))
        !            88: give a value for s? printtex((x+y)^3/(x-y)^2)
        !            89: {{x^{3} + {{3}y}x^{2} + {{3}y^{2}}x + {y^{3}}}\over{x^{2} - {{2}y}x + {y^{2}
        !            90: }}}
        !            91: 1
        !            92: ? for(i=1,100,for(j=1,25,if(i+j==32,break(2)));print(i))
        !            93: 1
        !            94: 2
        !            95: 3
        !            96: 4
        !            97: 5
        !            98: 6
        !            99: ? u=v=p=q=1;for(k=1,400,w=u+v;u=v;v=w;p*=w;q=lcm(q,w);if(k%50==0,print(k" "l
        !           100: og(p)/log(q))));
        !           101: 50 1.561229126903099279206171725
        !           102: 100 1.601335375590875348711141031
        !           103: 150 1.606915548673659127523394774
        !           104: 200 1.618659998991528481508175175
        !           105: 250 1.626284706204746765086080988
        !           106: 300 1.627822776845103001192024532
        !           107: 350 1.632105905172986668189652273
        !           108: 400 1.632424285532931448171405619
        !           109: ? install(addii,GG)
        !           110: ? addii(1,2)
        !           111: 3
        !           112: ? kill(addii)
        !           113: ? getheap
        !           114: [21, 1569]
        !           115: ? print("Total time spent: ",gettime);
        !           116: Total time spent: 247
        !           117: ? \q