نتایج جستجو برای: mersenne number
تعداد نتایج: 1168650 فیلتر نتایج به سال:
The issues related to the problem of minimizing hardware costs in software and implementation digital algorithms discrete Fourier transform (DFT) are considered. Possible ways solving these problems based on use classical methods DFT described. Various direct, fast recurrent (RDFT) number-theoretic Mersenne transforms investigated. purpose research is a comparative analysis methods. used mathem...
We introduce a new class of pseudoprimes-so called ”overpseudoprimes” which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n,we show that odd number n is overpseudoprime if and only if the value of h(n) is invariant of all divisors d > 1 of n. In particular, we prove that all composite Mersenne numbers 2 − 1, where p is prime, and squa...
We present new factors of seventeen Mersenne numbers, obtained using a variant of the special number field sieve where sieving on the algebraic side is shared among the numbers. It reduced the overall factoring effort by more than 50%. As far as we know this is the first practical application of Coppersmith’s “factorization factory” idea. Most factorizations used a new double-product approach t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید