PARI Ubasic. Yasutoshi.

[y.kohmoto]

    Hello, Don McDonald.


>Greeting Yasutoshi, seqfans,
>
>I did not understand your numbers or HOW YOU OBTAINED THEM.
>Where did they come from?
>Another poster proposed (Help Pari... 81st cyclotomic polynomial??)
>

>>1156990585940081
>>96707816240874023
>>15391955572707227

    When I searched amicable pairs, I used Adleman test in UBASIC as a
subroutine.
    And the software stopped several times at prime tests of these numbers.

>Did you mean to print (^ B !!!!)  or stuff like that?
>


    Sorry, they are typos.

>The first number was not prime; it has at least 2 factors.
>And it was a useful test of my program.
>
>The third number may have been
>12*large number-1.
>
>It was too big for me (2^52 limit = 4.5E15.)
>The second number was also too big.
>
>I didn't use Archimedes PARI or 486 UBasic.
>
>When I use Pari (factor) I first ask it
>isprime().
>Then, if answer is 0, (composite) you can try smallfact().
>Then try isprime() again on what is left (the big factor).
>
>Finally try factor(the big factor.)
>
>--  don.mcdonald  23.06.03  23:47
>
>
>my file > *ram.sumryfact.creditcd1..  Mon,23 Jun 2003.23:18:35
>by don.mcdonald.pgm.c241Q. BBC Basic64.Risc os.Acorn Archimedes comp 1990.
>
>(prob) -- #formula,--  value, --   FACTORS -- ,  (centiseconds).
>---
>2  1156990585940081 yas..=1156990585940081= ?1519967*761194543prime 1mn
>3  15391955572707227 ya..=15391955572707228= Accy?(2^2*3*? 34mn
>
>?searched to 26 million  -  34 minutes.
>
>Really, these numbers should not be at all hard to determine with
>a modern computer and better programs.  What was your problem
>with them?
>

    My program is in UBASIC. And I am sure it has a bug.
    I should rewrite it in MATHEMATICA.

>I solved a number that troubled (Maple 2 Derive?) order 6000*6000*6000?
>I also announced the factor of (10^9)^(10^9)+3.
>
>>.Profile.eisintegsq.Seqfan.YasutoshiK.PariUBASIC
>e n d. prog c241Q  24.2.03   close *spool
>-- don.
>

    Yasutoshi