Contribution and Reservation

(25·10²⁴⁷-1)/3 =: 8(3)₂₄₇_<248>; = 43 · 83 · 283 · 2441 · 14581157 · 60774353193356424253061192369_<29> · [38142193006577298239466929070185778489742250584036856902984968940699592379591946049117265062788293594397059952147115853024700777880245975321148568392069493931589054895807529678052249165458321443273798443_<203>] SUBMIT/RESERVE

Status

Expression:	(25·10²⁴⁷-1)/3
Composite Factor:	381421930065772982394669290701857784897422505840368569029849 689406995923795919460491172650627882935943970599521471158530 247007778802459753211485683920694939315890548958075296780522 49165458321443273798443 (203-digit)
Status:	Not factored. Not reserved. You can submit its factors or reserve it for submitting in the future.

How to factor it

ECM, P-1, P+1

Look for prime factors by GMP-ECM first. Refer to the section "Efforts by ECM". Not only ECM but also P-1/P+1 may be helpful.

SNFS

Use GGNFS and/or Msieve if GMP-ECM cannot find a factor. The SNFS difficulty of this composite number is 250.49-digit and the GNFS difficulty is 202.58-digit. SNFS must be faster than GNFS. It will take about 932 CPU-days to factor this composite number on 64-bit Opteron-2600MHz.

Put factMsieve.pl to which $GGNFS_BIN_PATH and $NUM_CPUS were modified properly in the working directory 83333_247.
Put the following polynomial file 83333_247.poly in there too.
And then, run "perl factMsieve.pl 83333_247".

83333_247.poly ^*1

n: 38142193006577298239466929070185778489742250584036856902984968940699592379591946049117265062788293594397059952147115853024700777880245975321148568392069493931589054895807529678052249165458321443273798443
m: 500000000000000000000000000000000000000000
deg: 6
c6: 2
c0: -125
skew: 1.99
type: snfs
lss: 1
rlim: 105000000
alim: 105000000
lpbr: 31
lpba: 31
mfbr: 62
mfba: 62
rlambda: 2.8
alambda: 2.8

*1 These parameters were not fully adjusted. The approximate expressions which were used for making the parameters are: deg=expt<=105?4:expt<=210?5:6 or expt<=144?4:6; d=log10(c[deg])+deg*log10(m)[digits]; time=10^(d/30-4)[hours]; skew=|c0/c[deg]|^(1/deg); rlim=round(7*10^(d/60+3)); lpbr=floor(d/25+21); mfbr=floor(d/8+31); rlambda=floor(d/25+18)/10;

Efforts by ECM

The efforts by ECM to find small factors of this 203-digit composite number so far are as follows. According to the reports, unknown prime factors of this composite number are probably 30-digit or more. Please report your efforts by ECM. (Anonymous reports are not acceptable)

Level	B1	Reported runs Total / Required runs (Required runs for lower level)	Name
30	25e4	430	Makoto Kamada	Oct 22, 2008
30	25e4	430 / 430
35	1e6	0 / 825
35	1e6	/ 825
40	3e6	0 / 2336 (294)
40	3e6	/ 2336 (294)
45	11e6	0 / 4479 (677)
45	11e6	/ 4479 (677)
50	43e6	0 / 7553 (1277)
50	43e6	/ 7553 (1277)

Command line to find prime factors up to about 35-digit

echo 38142193006577298239466929070185778489742250584036856902984968940699592379591946049117265062788293594397059952147115853024700777880245975321148568392069493931589054895807529678052249165458321443273798443 | ecm -n -c 825 1e6

Command line to find prime factors up to about 40-digit

echo 38142193006577298239466929070185778489742250584036856902984968940699592379591946049117265062788293594397059952147115853024700777880245975321148568392069493931589054895807529678052249165458321443273798443 | ecm -n -c 2336 3e6

Command line to find prime factors up to about 45-digit

echo 38142193006577298239466929070185778489742250584036856902984968940699592379591946049117265062788293594397059952147115853024700777880245975321148568392069493931589054895807529678052249165458321443273798443 | ecm -n -c 4479 11e6

Command line to find prime factors up to about 50-digit

echo 38142193006577298239466929070185778489742250584036856902984968940699592379591946049117265062788293594397059952147115853024700777880245975321148568392069493931589054895807529678052249165458321443273798443 | ecm -n -c 7553 43e6

Submit factors

Make reservation

Back to Factorizations of near-repdigit numbers