PARI's commands

[science_man_88]

Originally Posted by 3.14159

Which comment?

In the meantime, I'll have to try setting up the bastard software..

Originally Posted by http://oeis.org/A000043

It is believed (but unproved) that this sequence is infinite. The data suggests that the number of terms up to exponent N is roughly K log N for some constant K.

I couldn't see regularity in i/log(mersenne[i]) so I went to i/(i/(mersenne[i])) which looks to be always increasing I'm just trying to find a pattern but I can't get it into a vector and I don't have excel to work with my beta of 2010 expired.

[3.14159]

Originally Posted by science_man_88

I couldn't see regularity in i/log(mersenne[i]) so I went to i/(i/(mersenne[i])) which looks to be always increasing I'm just trying to find a pattern but I can't get it into a vector and I don't have excel to work with my beta of 2010 expired.

Pattern? For what?

[3.14159]

Sorry for what might be an FAQ, but can you use more than one thread while using msieve? If so, what's the proper command for it?

[Mini-Geek]

Originally Posted by 3.14159

Sorry for what might be an FAQ, but can you use more than one thread while using msieve? If so, what's the proper command for it?

-h is your friend.
From msieve -h:

-t <num>  use at most <num> threads

Note that not all operations are currently able to be multithreaded.

[3.14159]

Originally Posted by Mini-Geek

-h is your friend.
From msieve -h:

-t <num>  use at most <num> threads

Note that not all operations are currently able to be multithreaded.

Ah, thanks. Is this placed in the file where the number to be factored is?

.. New (personal) record(?) for largest number factored, using ECM alone;

86229339801531617891831457738571589954220336672017171494473111387369807457745518549587104321020559, was split into:
9718861371938934531518644129 * 8872370589676254655649824600732500550515117106932992561896988884890671.

In the meantime, I'll try using ECM on a number of the form p^n, where p is prime;

I will use 95073391004784128912711766271532202619^3, or 859363596928113044181922356350379552940370289056898128253811986832399424760212777288750086152706299079127416742659.

[3.14159]

Originally Posted by 3.14159

Ah, thanks. Is this placed in the file where the number to be factored is?

.. New (personal) record(?) for largest number factored, using ECM alone;

86229339801531617891831457738571589954220336672017171494473111387369807457745518549587104321020559, was split into:
9718861371938934531518644129 * 8872370589676254655649824600732500550515117106932992561896988884890671.

In the meantime, I'll try using ECM on a number of the form p^n, where p is prime;

I will use 95073391004784128912711766271532202619^3, or 859363596928113044181922356350379552940370289056898128253811986832399424760212777288750086152706299079127416742659.

On the above, it didn't immediately recognize it as a prime power. There should be something to catch a prime power.

I tried using SIQS, to see if it would catch that it was a number of the form pⁿ.

Results:

>> siqs(859363596928113044181922356350379552940370289056898128253811986832399424760212777288750086152706299079127416742659)


starting SIQS on c114: 859363596928113044181922356350379552940370289056898128253811986832399424760212777288750086152706299079127416742659

==== sieving in progress ( 4 threads):  304064 relations needed ====
====            Press ctrl-c to abort and save state            ====

.. Tried the same w/GMP-ECM. It didn't immediately catch it as such either.

[3.14159]

By the way; Is that project about factoring sigma(p^n) still active?

[CRGreathouse]

Originally Posted by 3.14159

Tried the same w/GMP-ECM. It didn't immediately catch it as such either.

Odd, isn't it, that an ECM program would run ECM curves rather than detecting if a number is a perfect power.

[science_man_88]

Originally Posted by CRGreathouse

Odd, isn't it, that an ECM program would run ECM curves rather than detecting if a number is a perfect power.

Are you making laughable statements ?

[3.14159]

Originally Posted by CRGreathouse

Odd, isn't it, that an ECM program would run ECM curves rather than detecting if a number is a perfect power.

I don't need your meaningless sarcasm..

[3.14159]

The largest split I've done today;

5033844143885372027408530219404495142062957042044896658482934984273473395896485383398087 can be expressed as..
55142677216152829111571294528236299932749631 * 91287626898369355743182721817195029989331577
Soon to be replaced by a c95. (I'll report back w/factors in ≈60-75 minutes.)