Related papers: On square-free numbers generated from given sets o…

We progress with the investigation started in article \cite{Roman2022}, namely the analysis of the asymptotic behaviour of $Q_{\mathcal{P}}(x)$ for different sets $\mathcal{P}$, where $Q_{\mathcal{P}}(x)$ is the element count of the set…

Let $\alpha\in \mathbb{R}\setminus\mathbb{Q}$ and $\beta\in \mathbb{R}$ be given. Suppose that $a_1,\ldots,a_s$ are distinct positive integers that do not contain a reduced residue system modulo $p^2$ for any prime $p$. We prove that there…

A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the…

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

Let $p/q$ ($p, q \in \mathbb{N}^*$) be a positive rational number such that $p > q^2$. We show that for any $\epsilon > 0$, there exists a set $A(\epsilon) \subset [0, 1[$, with finite border and with Lebesgue measure $< \epsilon$, for…

A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…

Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in…

Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

Asymptotic formulae are established for the number of natural numbers $m$ with largest square-free divisor not exceeding $m^{\vartheta}$, for any fixed positive parameter $\vartheta$. Related counting functions are also considered.

We prove that every integer greater than two may be written as the sum of a prime and a square-free number.

Let $d\geq 2$ be a squarefree integer, let $\omega\in\{\sqrt{d},\frac{1+\sqrt{d}}{2}\}$ be such that $\mathbb{Z}[\omega]$ is the ring of algebraic integers of the real quadratic number field $\mathbb{Q}(\sqrt{d})$, let $\varepsilon>1$ be…

In this short paper we shall prove that there exist infinitely many consecutive square-free numbers of the form $[\alpha p]$, $[\alpha p]+1$, where $p$ is prime and $\alpha>0$ is irrational algebraic number. We also establish an asymptotic…

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…

We prove that there are infinitely many integers, which can represent as sum of a square-free integer and a prime $p$ with $||\alpha p+\beta||<p^{-1/10}$, where $\alpha$ is irrational.