A Sieve Method for Factoring Numbers of the Form $N\sp{2}+1$

Mathematics of Computation - United States
doi 10.1090/s0025-5718-1959-0105784-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

Factoring Large Numbers With a Quadratic Sieve

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1983English

New Primes of the Form $K·2\sp{n}+1$

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1979English

Some Prime Numbers of the Forms $2A3\sp{n}+1$ and $2A3\sp{n}-1$

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1972English

Pairs Where $2\sp A-2\sp B$ Divides $N\sp A-N\sp B$ for All $N$

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1985English

On Factoring Large Numbers

Bulletin of the American Mathematical Society
1931English

Algorithm Available for Factoring Big Fermat Numbers

Journal of Software
2020English

The Diophantine Equation $X\sp 2=4q\sp N+4q\sp M+1$

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1989English

Primes of the Form N! ± 1 and 2 ⋅3 ⋅5 ⋯p ± 1

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1982English

An Open Source Software Package for Primality Testing of Numbers of the Form P2^n+1, With No Constraints on the Relative Sizes of P and 2^n

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy