Probability that the k-gcd of products of positive integers is B-friable
From MaRDI portal
Publication:301413
DOI10.1016/J.JNT.2016.04.013zbMATH Open1397.11139OpenAlexW2417776807MaRDI QIDQ301413FDOQ301413
Publication date: 30 June 2016
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2016.04.013
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Distribution of integers with specified multiplicative constraints (11N25)
Cites Work
Cited In (3)
Recommendations
- Title not available (Why is that?) π π
- On the probability that \(n\) and \([n^c\) are coprime] π π
- The probability that random positive integers are \(k\)-wise relatively prime π π
- On the probability that n and g(n) are relatively prime π π
- The probability that \(k\) positive integers are pairwise relatively prime π π
- The probability of two \(\mathbb F_q\)-polynomials to be coprime π π
- The probability that random algebraic integers are relatively \(r\)-prime π π
- Friable sums of random multiplicative functions π π
- On the probability that two random integers are coprime π π
This page was built for publication: Probability that the \(k\)-gcd of products of positive integers is \(B\)-friable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301413)