Related papers: The Multiplication table for Smooth integers

A natural number $n$ is $y$-smooth if the greatest prime factor of $n$ does not exceed $y$. Let $s_{1}$ and $s_{2}$ are $y$-smooth numbers. We consider sums of smooth squares of the binary Titchmarsh divisor problem and give asymptotic…

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…

Let $b \ge 2$ be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer which is not a multiple of $b$ cannot have simultaneously only few distinct prime factors and only few nonzero…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…

Following Wigert, various authors, including Ramanujan, Gronwall, Erd\H{o}s, Ivi\'{c}, Schwarz, Wirsing, and Shiu, determined the maximal order of several multiplicative functions, generalizing Wigert's result $$\max_{n\leq x} \log d(n) =…

We revisit the problem of rigorously and deterministically finding elements of large order in the multiplicative group of integers modulo a natural number $N$. Solving this problem is an essential step in several recent deterministic…

We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a…

Inspired by the proof of the Bertrand postulate given by P. Erd\H{o}S, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer…

We show that infinitely many three-term arithmetic progressions $N, N+d, N+2d$ of powerful numbers exist with $d = 2\sqrt{N} + 1$. We further conjecture that infinitely many of these progressions consist of three consecutive terms in the…

A representation number is a function which expresses the number of ways an integer can be written as a sum of elements of chosen sets. One of the oldest number-theoretic results on representation numbers is Fermat's theorem which says that…

This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…

For which values of $n$ can we color the positive integers with precisely $n$ colors in such a way that for any $a$, the numbers $a,2a,\dots,na$ all get different colors? Pach posed the question around 2008-9. Particular cases appeared in…

In this paper we study sum-free subsets of the set $\{1,...,n\}$, that is, subsets of the first $n$ positive integers which contain no solution to the equation $x + y = z$. Cameron and Erd\H{o}s conjectured in 1990 that the number of such…

We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…

Let $m\geq 2$ be a positive integer. Given a set $E(\omega )\subseteq \mathbb{N}$ we define $r_{N}^{(m)}(\omega )$ to be the number of ways to represent $N\in \mathbb{Z}$ as any combination of sums $\textit{ and }$ differences of $m$…

We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old…

Let \( X \geq y \geq 2 \), and let \( u = \frac{\log X}{\log y} \). We say a number is \textit{$y$-smooth} if all of its prime factors are less than or equal to \( y \). In this paper, we study the distribution of $y$-smooth numbers in…

We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…