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

Building pseudoprimes with a large number of prime factors

โœ Scribed by D. Guillaume; F. Morain


Publisher
Springer
Year
1996
Tongue
English
Weight
750 KB
Volume
7
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On sums of three integers with a fixed n
โœ Xianmeng Meng ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 292 KB

Let N be sufficiently large odd integer. It is proved that the equation N = n 1 + n 2 + n 3 has solutions, where n i has a fixed number of prime factors, and an asymptotic formula holds for the number of representations.