Related papers: A Variation on Mills-Like Prime-Representing Funct…

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

We prove that if A is a subset of the primes, and the lower density of A in the primes is larger than 1/2, then every sufficiently large even integer can be written as the sum of eight primes from A. The constant 1/2 in this statement is…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

In 2016, Dummit, Granville, and Kisilevsky showed that the proportion of semiprimes (products of two primes) not exceeding a given $x$, whose factors are congruent to $3$ modulo $4$, is more than a quarter when $x$ is sufficiently large.…

The {\em Liouville function} is defined by $\gl(n):=(-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime divisors of $n$ counting multiplicity. Let $\z_m:=e^{2\pi i/m}$ be a primitive $m$--th root of unity. As a generalization of…

We define A_n=\sum_{i=1}^n (-1)^i\frac{1}{i} and we show that, for every prime p, there exists a number n such that A_n\equiv 0 (mod p).

Let $f$ be a multiplicative function which satisfies \[ f(a^2+b^2+c^2+d^2) = f(a^2+b^2)+f(c^2+d^2) \] for positive integers $a$, $b$, $c$, and $d$. We show that $f$ is the identity function provided that $f(3)\,f(11) \ne 0$. Otherwise,…

We introduce a rigorous arithmetic--spectral construction associating planar geometric objects with additive prime factor statistics. Let $\mathrm{sopfr}(n)$ denote the sum of prime factors of $n$, counted with multiplicity, and define the…

Define {\em the Liouville function for $A$}, a subset of the primes $P$, by $\lambda_{A}(n) =(-1)^{\Omega_A(n)}$ where $\Omega_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville…

J.P. Serre showed that for any integer $m,~a(n)\equiv 0 \pmod m$ for almost all $n,$ where $a(n)$ is the $n^{\text{th}}$ Fourier coefficient of any modular form with rational coefficients. In this article, we consider a certain class of…

Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

We study values of k for which the interval (kn,(k+1)n) contains a prime for every n>1. We prove that the list of such integers k includes k=1,2,3,5,9,14, and no others, at least for k<=50,000,000. For every known k of this list, we give a…

Fix a positive integer X. We quantify the cardinality of the set $\{\lfloor X/n \rfloor\}_{n=1}^X$. We discuss restricting the set to those elements that are prime, semiprime or similar.

The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

This note studies various ways of measuring the complexity of primitive solutions to the equation $A \,+\, B\, + \,C = 0$ and conjectures relating them. We define the insulator $\mathcal I(A,B,C)$ of a primitive solution as the smallest…

This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less one million. The conjecture has also been tested for ternary representation…

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…