Related papers: Counting arithmetic formulas

We construct closed forms that generate with repetitions all Mersenne primes, respectively all Fermat primes, all twin-prime pairs and all Sophie Germain primes. Also, we construct closed forms that count all Mersenne primes between $0$ and…

We define the asymptotic behavior "almost everywhere" of additive and multiplicative arithmetic functions in the paper. Classes of additive and multiplicative arithmetic functions are singled out for which the asymptotics coincides "almost…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to…

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…

The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

Let A be a set of integers. For every integer n, let r_{A,h}(n) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,...,a_h are in A and a_1 \leq a_2 \leq ... \leq a_h. The function r_{A,h}: Z \to…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

We first introduce the arithmetic subderivative of a positive integer with respect to a non-empty set of primes. This notion generalizes the concepts of the arithmetic derivative and arithmetic partial derivative. More generally, we then…

We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

We study the asymptotics of the moments of arithmetic functions that have a limit distribution, not necessarily normal, defined on a subset of the natural series that satisfies certain requirements. Several assertions are proved on…

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

We give an informal introduction to the most basic techniques used to evaluate moments on the critical line of the Riemann zeta-function and to find asymptotics for sums of arithmetic functions.

The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.