On a problem of Oppenheim concerning Factorisatio Numerorum

DOI10.1016/0022-314X(83)90002-1zbMATH Open0513.10043OpenAlexW2123355614WikidataQ105517231 ScholiaQ105517231MaRDI QIDQ1050397FDOQ1050397

Authors: E. Rodney Canfield, Carl Pomerance, P. Erdős 

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

Recommendations

• Some results on Oppenheim's ``factorisatio numerorum function
• scientific article; zbMATH DE number 3034294
• scientific article; zbMATH DE number 3107125
• A problem in "Factorisatio Numerorum"
• scientific article; zbMATH DE number 3096113
• scientific article; zbMATH DE number 1885143
• On the maximal order of numbers in the ``factorisatio numerorum problem
• On some factorization problems
• On the factorization conjecture

zbMATH Keywords

maximal orderlargest prime divisors of highly factorable numberslower bound for Psi-functionnumber of factorizations of positive integer

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Special sequences and polynomials (11B83) Asymptotic results on arithmetic functions (11N37) Distribution of primes (11N05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Difference between Consecutive Prime Numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• An asymptotic formula for extended Eulerian numbers
• On Integers All of Whose Prime Factors are Small
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Approximating the number of integers free of large prime factors
• On Integers Free of Large Prime Factors
• On the composition of a certain arithmetic function
• Multiplicative partitions of numbers with a large squarefree divisor
• On the local behavior of the order of appearance in the Fibonacci sequence
• Analysis of the fault attack ECDLP over prime field
• Using number fields to compute logarithms in finite fields
• On the oracle complexity of factoring integers
• On the Euler function of the Catalan numbers
• Upper bounds for sums of powers of divisor functions
• Montgomery's method of polynomial selection for the number field sieve
• On the ultimate complexity of factorials
• Polynomial approximation of anisotropic analytic functions of several variables
• On a conjecture of Wilf
• Nicolaas Govert de Bruijn, the enchanter of friable integers
• ON THE LARGEST PRIME FACTOR OF THE MERSENNE NUMBERS
• Updating key size estimations for pairings
• Distributional properties of the largest prime factor
• Integers without divisors from a fixed arithmetic progression
• Algorithms for black-box fields and their application to cryptography
• On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
• Title not available (Why is that?)
• ON THE SUMS OF COMPLEMENTARY DIVISORS
• Integers without large prime factors
• On testing for zero polynomials by a set of points with bounded precision.
• Values of the Euler function in various sequences
• On Amicable Numbers
• On the maximal order of numbers in the ``factorisatio numerorum problem
• Statistical distribution and collisions of VSH
• Practical cryptanalysis of ISO 9796-2 and EMV signatures
• The sum of \(\alpha^{\Omega(n)}\) over integers n\(\leq x\) with all prime factors between \(\alpha\) and y
• Quadrafree \textit{factorisatio numerorum}
• Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor)
• The number of positive integers \(\leq x\) and free of prime factors \(>y\)
• Rigorous analysis of a randomised number field sieve
• Discrete logarithms in \(\mathrm{GF}(p)\)
• A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
• A problem in "Factorisatio Numerorum"
• Estimate for the function \(\Psi_K(x,y)\) in algebraic number fields
• Squares and factorials in products of factorials
• Detecting perfect powers in essentially linear time
• On digit sums of multiples of an integer
• Title not available (Why is that?)
• On the number of semismooth integers
• Additive properties of subgroups of finite index in fields
• On values taken by the largest prime factor of shifted primes
• A deterministic version of Pollard's \(p-1\) algorithm
• Function field sieve method for discrete logarithms over finite fields
• Distribution of the number of factors in random ordered factorizations of integers
• The number field sieve for integers of low weight
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
• Using partial smoothness of \(p-1\) for factoring polynomials modulo \(p\)
• Period of the power generator and small values of Carmichael's function
• A generic approach to searching for Jacobians
• Title not available (Why is that?)
• A Rigorous Time Bound for Factoring Integers
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• Some results on Oppenheim's ``factorisatio numerorum function
• Computational hardness of IFP and ECDLP
• Large values of the number of factorizations of an integer as an ordered product of primes
• On factorization of escalator numbers
• A property of the counting function of integers with no large prime factors
• The Distribution of Smooth Numbers in Arithmetic Progressions
• Indiscreet logarithms in finite fields of small characteristic
• On highly factorable numbers
• Approximating the number of integers without large prime factors
• Modifications to the number field sieve
• Constructing \(k\)-radius sequences
• Erdős and the integers
• Large values and champion numbers of Kalmár's arithmetic function
• An estimate for the number of integers without large prime factors
• Index calculation attacks on RSA signature and encryption
• Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs
• On numbers \(n\) dividing the \(n\)th term of a linear recurrence
• Diffie-Hellman Oracles
• The multiplication table for smooth integers
• Computational Number Theory and Cryptography
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
• 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 Average Number of Groups of Square-Free Order
• On ordered factorizations into distinct parts
• On the ratio between two factorization functions
• Romanov type problems
• On extended Eulerian numbers
• Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
• The distribution of numbers with many ordered factorizations
• The distribution of the number of factors in a factorization
• On almost Lehmer numbers
• How many primes can divide the values of a polynomial?
• On the greatest common divisor of a number and its sum of divisors. II
• On the number of factorizations of an integer
• The sharp threshold for making squares
• Quadratic sieving
• An upper bound for the moments of a GCD related to Lucas sequences
• Two problems on the distribution of Carmichael's lambda function
• CONGRUENCES AND EXPONENTIAL SUMS WITH THE SUM OF ALIQUOT DIVISORS FUNCTION
• Recursively divisible numbers
• On the discrete logarithm problem in the ideal class group of multiquadratic fields
• The multiple number field sieve for medium- and high-characteristic finite fields
• Optimal Parameterization of SNFS

This page was built for publication: On a problem of Oppenheim concerning Factorisatio Numerorum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1050397)