On the probability that \(n\) and \([n^c]\) are coprime

DOI10.1023/A:1022337727769zbMath1026.11003MaRDI QIDQ1410384

Francine Delmer, Jean-Marc Deshouillers

Publication date: 14 October 2003

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

greatest common divisordistribution modulo 1

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) General theory of distribution modulo (1) (11K06)

Related Items (2)

On the Density of Coprime Tuples of the Form (n, ⌊ f 1(n)⌋, …, ⌊ f k (n)⌋), Where f 1, …, f k Are Functions from a Hardy Field ⋮ Coprimality of integers in Piatetski-Shapiro sequences

This page was built for publication: On the probability that \(n\) and \([n^c]\) are coprime