mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   PARI/GP (https://www.mersenneforum.org/forumdisplay.php?f=155)
-   -   PARI's commands (https://www.mersenneforum.org/showthread.php?t=13636)

science_man_88 2010-11-20 16:01

[QUOTE=3.14159;237954]Which comment?

In the meantime, I'll have to try setting up the bastard software..[/QUOTE]

[QUOTE=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. [/QUOTE]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 2010-11-20 16:09

[QUOTE=science_man_88;237956]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.[/QUOTE]

Pattern? For what?

3.14159 2010-11-20 16:19

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 2010-11-20 16:26

[QUOTE=3.14159;237960]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?[/QUOTE]

-h is your friend. :smile:
From msieve -h:
[CODE]-t <num> use at most <num> threads[/CODE]Note that not all operations are currently able to be multithreaded.

3.14159 2010-11-20 16:28

[QUOTE=Mini-Geek;237962]-h is your friend. :smile:
From msieve -h:
[CODE]-t <num> use at most <num> threads[/CODE]Note that not all operations are currently able to be multithreaded.[/QUOTE]

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 2010-11-20 19:09

[QUOTE=3.14159;237963]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.[/QUOTE]

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[sup]n[/sup].

Results:
[code]>> siqs(859363596928113044181922356350379552940370289056898128253811986832399424760212777288750086152706299079127416742659)


starting SIQS on c114: 859363596928113044181922356350379552940370289056898128253811986832399424760212777288750086152706299079127416742659

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

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

3.14159 2010-11-20 19:29

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

CRGreathouse 2010-11-20 23:23

[QUOTE=3.14159;237983]Tried the same w/GMP-ECM. It didn't immediately catch it as such either.[/QUOTE]

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 2010-11-20 23:25

[QUOTE=CRGreathouse;238028]Odd, isn't it, that an ECM program would run ECM curves rather than detecting if a number is a perfect power.[/QUOTE]

Are you making laughable statements ?

3.14159 2010-11-20 23:46

[QUOTE=CRGreathouse;238028]Odd, isn't it, that an ECM program would run ECM curves rather than detecting if a number is a perfect power.[/QUOTE]

I don't need your meaningless sarcasm..

3.14159 2010-11-21 00:47

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.)


All times are UTC. The time now is 23:13.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.