Faktorenzerlegung Mersennescher Zahlen mittels programmgesteuerter Rechenger�te-Reference-Cited by-同舟云学术

Faktorenzerlegung Mersennescher Zahlen mittels programmgesteuerter Rechenger�te

Published:1961-12 Issue:1 Volume:3 Page:79-86
ISSN:0029-599X
Container-title:Numerische Mathematik
language:de
Short-container-title:Numer. Math.

Author:

Karst E.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics

Link

http://link.springer.com/article/10.1007/BF01386004/fulltext.html

Reference14 articles.

1. Seelhoff, P.: 261?1 eine Primzahl. Z. Math. u. Phys.31, 174?178 (1886).

2. Euler, Leonhard: Comm. Acad. Petropol.6 (1738), ad annos 1732?1733 p. 103. Cf. idem,Euler, Leonhard: Commentationes Arithmeticae Collectae, I, Petropoli, 1849, p. 2.

3. Lucas, Eduard: Amer. J. Math.1, 236 (1878). Zu Algorithmus vonLucas cf. idem, Comptes Rendus Paris82, 165?167 (1876) und Bull. Bibl. Storia Sc. Mat. e Fis.10, 152 (1877).

4. Woodall, H. J.: Manchester Lit. and Phil. So., Memoirs and Proc.56, no. 1, 5 (April 1912). Cf.R. C. Archibald: Mersenne's numbers. Scripta Mathematica3, 112?119 (1935).

5. de Fermat, Pierre: Fragment eines Briefes etwa vom Jahre 1643. Bull. Bibl. Storia Sc. Mat.12, 715 (1879). Cf. Oeuvres de Fermat2, 256 (1894).

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computers As a Novel Mathematical Reality: III. Mersenne Numbers and Sums of Divisors;Doklady Mathematics;2023-06

2. Unique representation of primitive factors of 2 n −1,n ODD, in certain quadratic forms;BIT;1969-06

3. Reviews and Descriptions of Tables and Books;Mathematics of Computation;1965

4. List of all prime divisorsq=2Kp+1 of 2 p −1,K<10,p<15000;BIT;1963-12

5. Search Limits on Divisors of Mersenne numbers;BIT;1962-12