On a problem of Oppenheim concerning Factorisatio Numerorum
From MaRDI portal
Publication:1050397
DOI10.1016/0022-314X(83)90002-1zbMath0513.10043OpenAlexW2123355614WikidataQ105517231 ScholiaQ105517231MaRDI QIDQ1050397
E. Rodney Canfield, Carl B. Pomerance
Publication date: 1983
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-314x(83)90002-1
maximal orderlargest prime divisors of highly factorable numberslower bound for Psi-functionnumber of factorizations of positive integer
Asymptotic results on arithmetic functions (11N37) Special sequences and polynomials (11B83) Arithmetic functions; related numbers; inversion formulas (11A25) Distribution of primes (11N05)
Related Items (only showing first 100 items - show all)
Optimal Parameterization of SNFS ⋮ Unnamed Item ⋮ Individual discrete logarithm with sublattice reduction ⋮ Two problems on the distribution of Carmichael's lambda function ⋮ An efficient key recovery attack on SIDH ⋮ Products of distinct integers being high powers ⋮ Recursively divisible numbers ⋮ Distribution \(\bmod{p}\) of Euler's totient and the sum of proper divisors ⋮ Unnamed Item ⋮ A SURVEY OF FACTORIZATION COUNTING FUNCTIONS ⋮ An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Exponential sums with the Dirichlet coefficients of Rankin–Selberg L-functions ⋮ Statistical distribution and collisions of VSH ⋮ On ordered factorizations into distinct parts ⋮ On the local behavior of the order of appearance in the Fibonacci sequence ⋮ Unnamed Item ⋮ On the number of arithmetic formulas ⋮ On the number of semismooth integers ⋮ Asymptotic bounds for factorizations into distinct parts ⋮ Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 ⋮ Multiplicative partitions of numbers with a large squarefree divisor ⋮ Romanov type problems ⋮ On numbers n dividing the nth term of a linear recurrence ⋮ On digit sums of multiples of an integer ⋮ Diffie-Hellman Oracles ⋮ Algorithms for Black-Box Fields and their Application to Cryptography ⋮ Discrete logarithms in \(\mathrm{GF}(p)\) ⋮ Counting terms $U_n$ of third order linear recurrences with $U_n=u^2+nv^2$ ⋮ On the number of factorizations of an integer ⋮ On consecutive integers divisible by the number of their divisors ⋮ Practical cryptanalysis of ISO 9796-2 and EMV signatures ⋮ Perfect power testing ⋮ The sharp threshold for making squares ⋮ Some Ramanujan-Nagell equations with many solutions ⋮ On a conjecture of Wilf ⋮ Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function ⋮ On the Average Number of Groups of Square-Free Order ⋮ Computational Number Theory and Cryptography ⋮ On the oracle complexity of factoring integers ⋮ Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor) ⋮ Polynomial approximation of anisotropic analytic functions of several variables ⋮ The distribution of numbers with many factorizations ⋮ On Fibonacci numbers which are elliptic Carmichael ⋮ Analysis of the fault attack ECDLP over prime field ⋮ Popular subsets for Euler's \(\varphi \)-function ⋮ Algorithms for the Multiplication Table Problem ⋮ On testing for zero polynomials by a set of points with bounded precision. ⋮ On the Euler function of the Catalan numbers ⋮ Additive properties of subgroups of finite index in fields ⋮ Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity ⋮ ON THE SUMS OF COMPLEMENTARY DIVISORS ⋮ A refinement of the function \(g(x)\) on Grimm's conjecture ⋮ An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient ⋮ On the typical size and cancellations among the coefficients of some modular forms ⋮ The multiplication table for smooth integers ⋮ Erdős and the integers ⋮ Quadrafree \textit{factorisatio numerorum} ⋮ Large values of the number of factorizations of an integer as an ordered product of primes ⋮ Large values and champion numbers of Kalmár's arithmetic function ⋮ Squares and factorials in products of factorials ⋮ Distribution of the number of factors in random ordered factorizations of integers ⋮ Integers without divisors from a fixed arithmetic progression ⋮ Period of the power generator and small values of Carmichael’s function ⋮ A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields ⋮ Upper bounds for sums of powers of divisor functions ⋮ Approximating the number of integers free of large prime factors ⋮ The distribution of numbers with many ordered factorizations ⋮ Computational hardness of IFP and ECDLP ⋮ On extended Eulerian numbers ⋮ Rigorous analysis of a randomised number field sieve ⋮ Estimates for Wieferich numbers ⋮ Special prime numbers and discrete logs in finite prime fields ⋮ Detecting perfect powers in essentially linear time ⋮ A deterministic version of Pollard’s $p-1$ algorithm ⋮ The number field sieve for integers of low weight ⋮ Updating key size estimations for pairings ⋮ On the ultimate complexity of factorials ⋮ On Integers Free of Large Prime Factors ⋮ Distributional properties of the largest prime factor ⋮ The Distribution of Smooth Numbers in Arithmetic Progressions ⋮ Index calculation attacks on RSA signature and encryption ⋮ Two contradictory conjectures concerning Carmichael numbers ⋮ A generic approach to searching for Jacobians ⋮ A Rigorous Time Bound for Factoring Integers ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Quadratic sieving ⋮ Recovering Fourier coefficients of some functions and factorization of integer numbers ⋮ On Amicable Numbers ⋮ Using number fields to compute logarithms in finite fields ⋮ Pairing inversion for finding discrete logarithms ⋮ Nicolaas Govert de Bruijn, the enchanter of friable integers ⋮ Approximating the number of integers without large prime factors ⋮ Montgomery's method of polynomial selection for the number field sieve ⋮ An estimate for the number of integers without large prime factors ⋮ ON THE LARGEST PRIME FACTOR OF THE MERSENNE NUMBERS ⋮ Refined analysis to the extended tower number field sieve ⋮ Estimate for the function \(\Psi_K(x,y)\) in algebraic number fields ⋮ CONGRUENCES AND EXPONENTIAL SUMS WITH THE SUM OF ALIQUOT DIVISORS FUNCTION ⋮ On highly factorable numbers
Cites Work
This page was built for publication: On a problem of Oppenheim concerning Factorisatio Numerorum
