Related papers: On the difference between squares and integral $S$…

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

Let $q > 1$ be a real number and let $m=m(q)$ be the largest integer smaller than $q$. It is well known that each number $x \in J_q:=[0, \sum_{i=1}^{\infty} m q^{-i}]$ can be written as $x=\sum_{i=1}^{\infty}{c_i}q^{-i}$ with integer…

Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as…

Let $Q$ be a positive-definite quaternary quadratic form with prime discriminant. We give an explicit lower bound on the number of representations of a positive integer $n$ by $Q$. This problem is connected with deriving an upper bound on…

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

We study singularity of effective $\mathbb{Q}$-divisors on products of projective spaces of multidegree $(1,1...,1).$ This generalizes works of Bath, Musta{\c{t}}{\u{a}} and Walther on singularity of square-free polynomials. We also give a…

Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…

We study the distribution of spacings between squares modulo q as the number of prime divisors of q tends to infinity. In an earlier paper Kurlberg and Rudnick proved that the spacing distribution for square free q is Poissonian, this paper…

We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…

We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…

We consider the primes which divide the denominator of the x-coordinate of a sequence of rational points on an elliptic curve. It is expected that for every sufficiently large value of the index, each term should be divisible by a primitive…

Given a set of $n$ positive integers $\{a_1, \ldots, a_n\}$ and an integer parameter $H$ we study small additive shifts of its elements by integers $h_i$ with $|h_i| \le H$, $i =1, \ldots, n$, such that the greatest common divisor of…

In a previous paper with the same title, we gave an upper bound for the exponent of uniform rational approximation to a quadruple of $\mathbb{Q}$-linearly independent real numbers in geometric progression. Here, we explain why this upper…

Define a natural number $n$ as a \textit{square-full} integer if for every prime $p$ such that $p|n$, we have $p^2|n$. In this paper, we establish an upper bound on the variance of square-full integers in short intervals of an expected…

We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…

Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

We propose a criterion that allows one to distinguish prime numbers from compound ones. This criterion is based on the counting of small quadratic residues.