搜索结果: 1-4 共查到“geometric progression”相关记录4条 . 查询时间(0.156 秒)
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
foundations / Polynomial Selection Number Field Sieve LLL Algorithm
2012/3/28
The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial...
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
Polynomial Selection Number Field Sieve LLL Algorithm
2011/6/9
The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial...
Various observations on angles proceeding in geometric progression
Various observations angles proceeding geometric progression
2010/12/1
Since a great many well known properties found about angles, or arcs,and the sines, cosines, tangents, cotangents, secants and cosecants of them have been derived from the consideration of arcs increa...
A. Marciniuk and A. Weron, On annuities under random rates of interest with payments varying in arithmetic and geometric progression
Annuity accumulated value random interest rate
2009/9/21
In the article we consider accumulated values of annuities-
certain with yearly payments with independent random interest
rates. We focus on general annuities with payments varying in arithmetic
an...