| prop-fr:contenu
|
- 4020.0
- * Alfakodning, ett lättkodningssystem för EDB-maskiner , Nord.Symp. för Användn. av Matematikmaskiner, Karlskrona 1959.
* In which order are different conditions to be examined? BIT 3 pp. 255-256. (fr)
- * A note on large linear systems, Math.Comp. 10 p. 60.
* Die thermodynamischen Zustandsgrössen des Wasserdampfes bei maschinellen Berechnungen, Acta Polytechn.Scand., Phys. and Appl.Math. Series, 14 pp. 1-20.
* A randomly generated program for automatic identity checking, BIT 15 pp. 381-384.
* Partitions in squares BIT 19 pp. 297-301. (fr)
- * Note on the congruence a^=1 , Math.Comp. 18 pp. 149-150.
* Some soluble cases of the discrete logarithm problem, BIT 28 pp. 839-851. (fr)
- * A case of numerical divergence, BIT 1 pp. 130-131.
* Some series related to infinite series given by Ramanujan, BIT 13 pp. 97-113.
* Summation of Double Series Using the Euler-MacLaurin Sum Formula, BIT 36 pp. 860-862. (fr)
- * A note on the prime numbers of the forms N=.2^-1 and M=.2^-1, Arkiv för mat. 3 pp. 245-253.
* Lucasian criteria for the primality of N=h.2^n-1, Math.Comp. 23 pp. 869-875.
* Some calculations related to Riemann's prime number formula, Math.Comp. 24 1970 pp. 968-983.
* Primes forming arithmetic series and clusters of large primes, BIT 10 pp. 333-342.
* Vad nytt på primtalsfronten? Nord.Mat.Tidskr. 23 pp. 5-14.
* On sums of primes, Arkiv för mat. 21 pp.45-74.
* Modern factorization methods, BIT 25 pp. 205-222.
* On admissible constellations of consecutive primes, BIT 28 pp. 391-396.
* Wie schnell kann man Zahlen in Faktoren zerlegen? Mitt. Math. Ges. Hamburg, Band XII pp. 253-260.
* Prime numbers and computer methods for factorization, Birkhäuser, Boston 1985, 2nd ed. 1994 . (fr)
- * Om rekursionsformler för Bernoullis tal, Nord.Mat Tidskr. 9 pp. 44-48.
* On a property of the minimal universal exponent, Arkiv för Mat. 4 pp. 401-403.
* A consequence of the von Staudt-Clausen Theorem, BIT 14 pp. 120-121.
* An "exact" formula for the 2n-th Bernoulli number, Acta Arithm. 26 pp.281-285. (fr)
- * A new Mersenne prime, MTAC 12 p. 60.
* Mersenne numbers, MTAC 12 pp. 207-213.
* All factors q<10^8 in all Mersenne numbers 2^p-1, p prime <10^4, Math.Comp. 16 pp. 479-482. (fr)
|