Generating random factored numbers, easily (Q1879421)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generating random factored numbers, easily |
scientific article; zbMATH DE number 2102284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating random factored numbers, easily |
scientific article; zbMATH DE number 2102284 |
Statements
Generating random factored numbers, easily (English)
0 references
22 September 2004
0 references
In [SIAM J. Comput. 17, No. 2, 179--193 (1988; Zbl 0642.10003)], \textit{E. Bach} presented an efficient algorithm for the generation of uniformly random numbers along with its prime factorization. In this short note, the author presents a significantly simpler algorithm and analysis for this problem.
0 references
random numbers
0 references
factorization
0 references
0.8699726462364197
0 references
0.797775387763977
0 references
0.7814282774925232
0 references
0.7370393872261047
0 references
