๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of calculating factorials

โœ Scribed by Peter B Borwein

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
205 KB
Volume
6
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the factoriality of some rings of com
On the factoriality of some rings of complex Nash functions
โœ G. Fatabbi; A. Tancredi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ French โš– 124 KB

In this paper we give a topological characterization of the factoriality of the ring N X (K) of the complex Nash functions on a semianalytic Nash affine compact of a factorial Nash subvariety of C n .

On the Parity of Exponents in the Prime
On the Parity of Exponents in the Prime Factorization of Factorials
โœ J.W. Sander ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

In 1997 Berend proved a conjecture of Erdo s and Graham by showing that for every positive integer r there are infinitely many positive integers n with the property that where p(1)=2, p(2)=3, p(3)=5, ... is the sequence of primes in ascending order, and e p (m) denotes the order of the prime p in t

On the complexity of circulations
On the complexity of circulations
โœ Esther M Arkin; Christos H Papadimitriou ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 703 KB