Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword
Like this
2Activity
0 of .
Results for:
No results containing your search query
P. 1
brent-factorizacion_fermat_10_11-96

brent-factorizacion_fermat_10_11-96

Ratings: (0)|Views: 12|Likes:
Published by api-3744003

More info:

Published by: api-3744003 on Dec 02, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

03/18/2014

pdf

text

original

TR-CS-96-02
Factorization of the Tenth and
Eleventh Fermat Numbers
Richard P. Brent
February 1996
Joint Computer Science Technical Report Series
Department of Computer Science
Faculty of Engineering and Information Technology
Computer Sciences Laboratory
Research School of Information Sciences and Engineering

This technical report series is published jointly by the Department of Computer Science, Faculty of Engineering and Information Technology, and the Computer Sciences Laboratory, Research School of Information Sciences and Engineering, The Australian National University.

Please direct correspondence regarding this series to:
Technical Reports
Department of Computer Science
Faculty of Engineering and Information Technology
The Australian National University
Canberra ACT 0200
Australia
or send email to:
Technical.Reports@cs.anu.edu.au
A list of technical reports, including some abstracts and copies of some full
reports may be found at:
http://cs.anu.edu.au/techreports/
Recent reports in this series:
TR-CS-96-01 Weifa Liang and Richard P. Brent.Constructing the spanners
of graphs in parallel. January 1996.
TR-CS-95-08 David Hawking.The design and implementation of a parallel
document retrieval engine. December 1995.
TR-CS-95-07 Raymond H. Chan and Michael K. Ng.Conjugate gradient
methods for Toeplitz systems. September 1995.
TR-CS-95-06 Oscar Bosman and Heinz W. Schmidt.Object test coverage
using \ufb01nite state machines. September 1995.
TR-CS-95-05 Jeffrey X. Yu, Kian-Lee Tan, and Xun Qu.
On balancing
workload in a highly mobile environment. August 1995.
TR-CS-95-04 Department of Computer Science.
Annual report 1994.
August 1995.
F
A
C
T
O
R
I
Z
A
T
I
O
N
O
F
T
H
E
T
E
N
T
H
A
N
D
E
L
E
V
E
N
T
H
F
E
R
M
A
T
N
U
M
B
E
R
S
R
I
C
H
A
R
D
P
.
B
R
E
N
T
A
b
s
t
r
a
c
t
.
W
e
d
e
s
c
r
i
b
e
t
h
e
c
o
m
p
l
e
t
e
f
a
c
t
o
r
i
z
a
t
i
o
n
o
f
t
h
e
t
e
n
t
h
a
n
d
e
l
e
v
e
n
t
h
F
e
r
m
a
t
n
u
m
b
e
r
s
.
T
h
e
t
e
n
t
h
F
e
r
m
a
t
n
u
m
b
e
r
i
s
a
p
r
o
d
u
c
t
o
f
f
o
u
r
p
r
i
m
e
f
a
c
t
o
r
s
w
i
t
h
8
,
1
0
,
4
0
a
n
d
2
5
2
d
e
c
i
m
a
l
d
i
g
i
t
s
.
T
h
e
e
l
e
v
e
n
t
h
F
e
r
m
a
t
n
u
m
b
e
r
i
s
a
p
r
o
d
u
c
t
o
f
\ue001
v
e
p
r
i
m
e
f
a
c
t
o
r
s
w
i
t
h
6
,
6
,
2
1
,
2
2
a
n
d
5
6
4
d
e
c
i
m
a
l
d
i
g
i
t
s
.
W
e
a
l
s
o
n
o
t
e
a
n
e
w
2
7
-
d
e
c
i
m
a
l
d
i
g
i
t
f
a
c
t
o
r
o
f
t
h
e
t
h
i
r
t
e
e
n
t
h
F
e
r
m
a
t
n
u
m
b
e
r
.
T
h
i
s
n
u
m
b
e
r
h
a
s
f
o
u
r
k
n
o
w
n
p
r
i
m
e
f
a
c
t
o
r
s
a
n
d
a
2
3
9
1
-
d
e
c
i
m
a
l
d
i
g
i
t
c
o
m
p
o
s
i
t
e
f
a
c
t
o
r
.
A
l
l
t
h
e
n
e
w
f
a
c
t
o
r
s
r
e
p
o
r
t
e
d
h
e
r
e
w
e
r
e
f
o
u
n
d
b
y
t
h
e
e
l
l
i
p
t
i
c
c
u
r
v
e
m
e
t
h
o
d
\ue004
E
C
M
\ue005
.
T
h
e
4
0
-
d
i
g
i
t
f
a
c
t
o
r
o
f
t
h
e
t
e
n
t
h
F
e
r
m
a
t
n
u
m
b
e
r
w
a
s
f
o
u
n
d
a
f
t
e
r
a
b
o
u
t
1
4
0
M
\ue002
o
p
-
y
e
a
r
s
o
f
c
o
m
p
u
t
a
t
i
o
n
.
W
e
d
i
s
c
u
s
s
a
s
p
e
c
t
s
o
f
t
h
e
p
r
a
c
t
i
c
a
l
i
m
p
l
e
m
e
n
t
a
t
i
o
n
o
f
E
C
M
,
i
n
c
l
u
d
i
n
g
t
h
e
u
s
e
o
f
s
p
e
c
i
a
l
-
p
u
r
p
o
s
e
h
a
r
d
w
a
r
e
,
a
n
d
n
o
t
e
s
e
v
e
r
a
l
o
t
h
e
r
l
a
r
g
e
f
a
c
t
o
r
s
f
o
u
n
d
r
e
c
e
n
t
l
y
b
y
E
C
M
.
1
.
I
n
t
r
o
d
u
c
t
i
o
n
F
o
r
a
n
o
n
n
e
g
a
t
i
v
e
i
n
t
e
g
e
r
n
,
t
h
e
n
-
t
h
F
e
r
m
a
t
n
u
m
b
e
r
i
s
F
n
=
2
2
n
+
1
.
I
t
i
s
k
n
o
w
n
t
h
a
t
F
n
i
s
p
r
i
m
e
f
o
r
0
\ue003
n
\ue003
4
,
a
n
d
c
o
m
p
o
s
i
t
e
f
o
r
5
\ue003
n
\ue003
2
3
.
A
l
s
o
,
f
o
r
n
\ue004
2
,
t
h
e
f
a
c
t
o
r
s
o
f
F
n
a
r
e
o
f
t
h
e
f
o
r
m
k
2
n
+
2
+
1
:
\ue009
1
\ue00a
I
n
1
7
3
2
E
u
l
e
r
\ue00c
3
6
,
p
.
1
0
4
\ue00e
f
o
u
n
d
t
h
a
t
6
4
1
=
5
\ue000
2
7
+
1
i
s
a
f
a
c
t
o
r
o
f
F
5
,
t
h
u
s
d
i
s
p
r
o
v
i
n
g
F
e
r
m
a
t
'
s
b
e
l
i
e
f
\ue00c
3
8
,
p
p
.
2
0
6
\ue00f
2
0
8
\ue00e
t
h
a
t
a
l
l
F
n
a
r
e
p
r
i
m
e
.
E
u
l
e
r
a
p
p
a
r
e
n
t
l
y
u
s
e
d
t
r
i
a
l
d
i
v
i
s
i
o
n
b
y
p
r
i
m
e
s
o
f
t
h
e
f
o
r
m
6
4
k
+
1
,
s
e
e
\ue00c
3
7
,
p
.
3
3
\ue00e
.
N
o
F
e
r
m
a
t
p
r
i
m
e
s
l
a
r
g
e
r
t
h
a
n
F
4
a
r
e
k
n
o
w
n
,
a
n
d
a
p
r
o
b
a
b
i
l
i
s
t
i
c
a
r
g
u
m
e
n
t
m
a
k
e
s
i
t
p
l
a
u
s
i
b
l
e
t
h
a
t
o
n
l
y
a
\ue002
n
i
t
e
n
u
m
b
e
r
o
f
F
n
\ue009
p
e
r
h
a
p
s
o
n
l
y
F
0
;
:
:
:
;
F
4
\ue00a
a
r
e
p
r
i
m
e
.
T
h
e
c
o
m
p
l
e
t
e
f
a
c
t
o
r
i
z
a
t
i
o
n
o
f
t
h
e
F
e
r
m
a
t
n
u
m
b
e
r
s
F
6
;
F
7
;
:
:
:
h
a
s
b
e
e
n
a
c
h
a
l
l
e
n
g
e
s
i
n
c
e
E
u
l
e
r
'
s
t
i
m
e
.
B
e
c
a
u
s
e
t
h
e
F
n
g
r
o
w
r
a
p
i
d
l
y
i
n
s
i
z
e
,
a
m
e
t
h
o
d
w
h
i
c
h
f
a
c
t
o
r
s
F
n
m
a
y
b
e
i
n
a
d
e
q
u
a
t
e
f
o
r
F
n
+
1
.
I
n
t
h
i
s
s
e
c
t
i
o
n
w
e
g
i
v
e
a
s
u
m
m
a
r
y
o
f
w
h
a
t
h
a
s
b
e
e
n
a
c
h
i
e
v
e
d
s
i
n
c
e
1
7
3
2
.
A
d
d
i
t
i
o
n
a
l
h
i
s
t
o
r
i
c
a
l
d
e
t
a
i
l
s
a
n
d
r
e
f
e
r
e
n
c
e
s
c
a
n
b
e
f
o
u
n
d
i
n
\ue00c
2
0
,
4
5
,
5
3
\ue00e
,
a
n
d
s
o
m
e
r
e
c
e
n
t
r
e
s
u
l
t
s
a
r
e
g
i
v
e
n
i
n
\ue00c
2
6
,
2
7
,
4
0
\ue00e
.
I
n
t
h
e
f
o
l
l
o
w
i
n
g
,
p
n
d
e
n
o
t
e
s
a
p
r
i
m
e
n
u
m
b
e
r
w
i
t
h
n
d
e
c
i
m
a
l
d
i
g
i
t
s
,
e
.
g
.
p
3
=
1
6
3
.
S
i
m
i
l
a
r
l
y
,
c
n
d
e
n
o
t
e
s
a
c
o
m
p
o
s
i
t
e
n
u
m
b
e
r
w
i
t
h
n
d
e
c
i
m
a
l
d
i
g
i
t
s
,
e
.
g
.
c
4
=
1
7
2
9
.
I
n
c
a
s
e
s
w
h
e
r
e
o
n
e
f
a
c
t
o
r
c
a
n
b
e
f
o
u
n
d
b
y
d
i
v
i
s
i
o
n
,
w
e
u
s
u
a
l
l
y
w
r
i
t
e
i
t
a
s
p
n
o
r
c
n
a
n
d
l
e
a
v
e
i
t
s
c
o
m
p
u
t
a
t
i
o
n
a
s
a
n
e
x
e
r
c
i
s
e
.
F
o
r
e
x
a
m
p
l
e
,
M
o
r
a
i
n
\ue00c
6
3
\ue00e
s
h
o
w
e
d
t
h
a
t
2
3
5
3
9
+
1
=
3
\ue000
p
1
0
6
5
.
I
t
w
o
u
l
d
b
e
t
e
d
i
o
u
s
t
o
w
r
i
t
e
o
u
t
t
h
e
1
0
6
5
-
d
i
g
i
t
p
r
i
m
e
i
n
d
e
c
i
m
a
l
\ue009
t
h
o
u
g
h
e
a
s
y
i
n
b
i
n
a
r
y
\ue00a
.
I
n
1
8
8
0
,
L
a
n
d
r
y
\ue00c
5
0
\ue00e
f
a
c
t
o
r
e
d
F
6
=
2
7
4
1
7
7
\ue000
p
1
4
:
L
a
n
d
r
y
'
s
m
e
t
h
o
d
w
a
s
n
e
v
e
r
p
u
b
l
i
s
h
e
d
i
n
f
u
l
l
,
b
u
t
W
i
l
l
i
a
m
s
\ue00c
8
2
\ue00e
h
a
s
a
t
t
e
m
p
t
e
d
t
o
r
e
c
o
n
s
t
r
u
c
t
i
t
.
1
9
9
1
M
a
t
h
e
m
a
t
i
c
s
S
u
b
j
e
c
t
C
l
a
s
s
i
\ue001
c
a
t
i
o
n
.
1
1
Y
0
5
,
1
1
B
8
3
,
1
1
Y
5
5
;
S
e
c
o
n
d
a
r
y
1
1
-
0
4
,
1
1
A
5
1
,
1
1
Y
1
1
,
1
1
Y
1
6
,
1
4
H
5
2
,
6
5
Y
1
0
,
6
8
Q
2
5
.
K
e
y
w
o
r
d
s
a
n
d
p
h
r
a
s
e
s
.
c
o
m
p
u
t
a
t
i
o
n
a
l
n
u
m
b
e
r
t
h
e
o
r
y
,
C
u
n
n
i
n
g
h
a
m
p
r
o
j
e
c
t
,
E
C
M
,
e
l
l
i
p
t
i
c
c
u
r
v
e
m
e
t
h
o
d
,
f
a
c
t
o
r
i
z
a
t
i
o
n
,
F
e
r
m
a
t
n
u
m
b
e
r
,
F
1
0
,
F
1
1
,
F
1
2
,
F
1
3
,
i
n
t
e
g
e
r
f
a
c
t
o
r
i
z
a
t
i
o
n
.
C
o
p
y
r
i
g
h
t
c
\ue003
1
9
9
6
,
R
.
P
.
B
r
e
n
t
T
y
p
e
s
e
t
u
s
i
n
g
A
M
S
-
L
A
T
E
X
.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->