Were those random or not?

Oh, wait, it's stupid to ask that question, probably pseudorandom and therefore nonrandom.

[QUOTE=3.14159;237011]Were those random or not?

Oh, wait, it's stupid to ask that question, probably pseudorandom and therefore nonrandom.[/QUOTE]

I could ask the same question of you, I suppose. Did you use radioactive decay or atmospheric noise to generate yours?

I'm thinking of starting factor work on a 110-digit number; Leave it be overnight.

59871850441883979044405428847542168288138150651887598225568902241762187682493909226207334528522020202725805381 is the number to factor.

Update: .. No way in hell that's going to happen.. That would take weeks..

74338891272149377427874674085271601642998185764655979027122653603490870033854228718287247388242120669311638350 = 2 * 3 * 5 * 5 * 17 * 19 * 43 * 101 * 311 * 739 * 116089 * 56917967 * 85348061 * 24947787413 * 167004293206339246027388107 * p39
38157159043738331401770964558106272101132422830636574102031515637789982659143857425996997108344070816764016398 = 2 * 3 * 383 * 2207 * 49782128129 * 51632606880677 * 156884557596929 * 35326563739232550038346583 * p39
11314500073059879067886420101455744756056583155142547166688513231714281478559695041703165299690029082907304664 = 2 * 2 * 2 * 7 * 13 * 743 * 14253409 * 38342281 * 87109567 * 232021873 * 350751703 * 908198324477 * 371162877118224182083 * p32
38883006611497575841712984979937342738910548225867207643379880594896105015715234112134584827624939020648574364 = 2 * 2 * 3 * 3 * 13 * 19 * 139 * 797 * 953 * 3257 * 15583 * 2740853 * 34977359 * 310700502904243953576307 * p53
57154156281492131910314562461340925913051944956802811736273712026632015939560259856292966072562836085732464260 = 2 * 2 * 3 * 5 * 23 * 29 * 31 * 37 * 7583 * 12253 * 88609 * 733511 * 18392476667797 * 22718716829477 * 38909979964631862673 * p38
11319605852137651873403299821012824711353456801354811440918206799022343059180006953094526111916258398453892206 = 2 * 3 * 3 * 7 * 19 * 31 * 113 * 1839427 * 79429547 * 84050827901 * 44899644930840362563 * 310863964758761491678397003 * p31
21253390829391485599579071715096746356539968858721165124074898220673020203691756740591620783581417537349600524 = 2 * 2 * 3 * 61 * 199 * 1831 * 4973 * 12985217471 * 103559428601 * 1652431643381920607578972385063 * p46
17656425106311690323287834186253129439586141910462304868361141029659008087286680063906706096470233598526787089 = 3 * 3 * 37 * 43 * 47 * 53 * 67 * 97 * 1217 * 1511 * 12799 * 55949 * 1558103 * 29636798459 * 61746720158803 * 27801348173060546509221263 * p27
10235945216789034618704567927879704249747724066834656445615415712014237345917819634728542736764868908944797893 = 7 * 29 * 31 * 37 * 136621 * 11917334171 * 184132753821836720843 * 31767599544330932051496130561 * p40
68302099261155078078235897584706041151104132298645035742120788756482833523311597129517261530492922001577292164 = 2 * 2 * 7 * 13 * 13 * 61 * 3691 * 24337 * 1418561 * 17319670189 * 522621860509518597887657005161133813 * p45

[QUOTE=3.14159;237018]I'm thinking of starting factor work on a 110-digit number[/QUOTE]

You've reached the the lower end of my stockpile of composites. For example here's the unfactored residual from a cyclotomic number.
[code]52074219475176599544589880036618463852389141452984899716122268110474982992898184859374665810756777666157468887[/code]

[QUOTE=wblipp;237083]You've reached the the lower end of my stockpile of composites. For example here's the unfactored residual from a cyclotomic number.
[code]52074219475176599544589880036618463852389141452984899716122268110474982992898184859374665810756777666157468887[/code][/QUOTE]

The number I used above was a p55 * p55. I take it that this might be a similar case, but I think it would be unrealistic; It would take weeks using a mere four-thread box for YAFU. Then, there's the GGNFS/Msieve application.

I can run Msieve easily, but I just can't seem to be able to set GGNFS up. If I could set it up, and give it a test number, say, a 100 or 105-digit number, to test its performance, maybe, just maybe, my range of numbers to factor would be extended to about 130 digits, or p65 * p65.

Here would be a nice example of a test number:

21773062350309841033157922516689393992032263697886427348664223252931714352536971180880778110859557388403. I set it up so that it's p52 * p52.

If it can handle that, then, I might test the c110 I posted earlier.. That means, I'll have to get to work getting the binaries.

Okay; I set them up to be in the factoring directory, where YAFU and GMP-ECM reside. Onwards to the rest of the guide.. If I could make head or tail out of it, that is.

This step confuses me; [QUOTE=Beginner's Guide][B]Obtain the latest MSIEVE binaries (v1.43 or newer) and overwrite the msieve that comes with ggnfs.[/B][/QUOTE]

Do they mean, download Msieve and replace the msieve already there? :huh:

[QUOTE=3.14159;237113]Do they mean, download Msieve and replace the msieve already there? :huh:[/QUOTE]

Yes, the version of msieve that comes with ggnfs may not be up to date.

[QUOTE=CRGreathouse;237118]Yes, the version of msieve that comes with ggnfs may not be up to date.[/QUOTE]

Okay; Got it.

.. Done. The latest version is 1.47.

.. Then there's Python and the Python script, which I already have.. Copy-pasted there..

I also got rid of the superfluous files.

The next steps are where I normally get lost.. It says, I should make a separate directory for the number I want to factor, then make some edits to the lines of the Python script..

How maddening..
 

[B]-> Could not find the program: msieve.
-> Did you set the paths properly in this script?
-> They are currently set to:
-> GGNFS_BIN_PATH = ../
-> MSIEVE_BIN_PATH = ../[/B]

[QUOTE=3.14159;237138][B]-> Could not find the program: msieve.[/B]
[B]-> Did you set the paths properly in this script?[/B]
[B]-> They are currently set to:[/B]
[B]-> GGNFS_BIN_PATH = ../[/B]
[B]-> MSIEVE_BIN_PATH = ../[/B][/QUOTE]
This assumes that you are running the factorization from a subdirectory of your main GGNFS directory; this is commonly done to avoid getting files mixed up (which is easy to do since the ggnfs binary suite is expansive and quite a few files are produced during the factorization).

What you'll want to do is create a subdirectory off the GGNFS directory for this particular factorization; place your .n file in there (formatted properly--if you need help with this see [URL]http://gilchrist.ca/jeff/factoring/nfs_beginners_guide.html[/URL]). Then open a command prompt to the subdirectory and run:

../factmsieve.py filename.n

Assuming you have Python installed correctly (which it looks like you do to have gotten as far as you did), this should do the trick. The script will begin factoring the number given in filename.n, placing all of its temp files in the subdirectory. When you're done and have the factors, you can delete the entire subdirectory and handily clean up after yourself. (The relations files produced during the factorization can be sizeable, so you'll definitely want to clean up afterwards.)