Related papers: On the location and classification of all prime nu…

Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…

A sieve is constructed for ordinary twin primes of the form 6m+/-1 that are characterized by their twin rank m. It has no parity problem. Non-rank numbers are identified and counted using odd primes p>=5. Twin- and non-ranks make up the set…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$.…

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

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…

A new class of positive maps is introduced. It interpolates between positive and completely positive maps. It is shown that this class gives rise to a new characterization of entangled states. Additionally, it provides a refinement of the…

Let $n\geq 3$ be an integer and $d$ an odd square-free integer. We shall compute the rank of the $2$-class group of $L_{n,d}:=\mathbb{Q}(\zeta_{2^n},\sqrt{d})$, when all the prime divisors of $d$ are congruent to $\pm 3\pmod 8$ or…

For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…

Let $R$ be a commutative ring and $n\geq1$ and $p\geq0$ two integers. Let $h_{k,\ i}$ be an element of $R$ for all $k\in\mathbb Z$ and $i\in [n]$. For any $\alpha\in\mathbb Z^n$, we define \[ t_{\alpha}:=\det\begin{pmatrix} h_{\alpha_1+1,\…

Let $[\, x\,]$ denote the integer part of a real number $x$. Assume that $\lambda_1,\lambda_2,\lambda_3$ are nonzero real numbers, not all of the same sign, that $\lambda_1/\lambda_2$ is irrational, and that $\eta$ is real. Let…

We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…

A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.

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…

The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…

We will show the two following results: If there existe an odd perfect number $n$ of prime decomposition $n=p_1^{\alpha_1} \ldots p_k^{\alpha_k}q^\beta$, where the $\alpha_i$ are even, the $\beta$ are odd and $q \equiv 5 \mod 8$. Then there…

We prove that for every irrational number $\alpha$, real number $\beta$, real number $c$ satisfying $1<c<9/8$ and positive real number $\theta$ satisfying $\theta<(9/c-8)/10$, there exist infinitely many primes of the form…

For each positive integer n, if the sum of the factors of n is divided by n, then the result is called the abundancy index of n. If the abundancy index of some positive integer m equals the abundancy index of n but m is not equal to n, then…