Probability that the \(k\)-gcd of products of positive integers is \(B\)-friable

DOI10.1016/j.jnt.2016.04.013zbMath1397.11139OpenAlexW2417776807MaRDI QIDQ301413

Jung Hee Cheon, Duhyeong Kim

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

zbMATH Keywords

\(B\)-friable number\(k\)-gcdgcd of productsrelatively prime numbers

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

Cryptanalysis of the CLT13 multilinear map

Cites Work

• The probability that random algebraic integers are relatively \(r\)-prime
• The probability that \(k\) positive integers are relatively \(r\)-prime
• On the probability that \(k\) positive integers are relatively prime
• Practical Multilinear Maps over the Integers

This page was built for publication: Probability that the \(k\)-gcd of products of positive integers is \(B\)-friable