Related papers: Chiral Prime Concatenations
A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…
The classical principal chiral model in 1+1 dimensions with target space a compact Lie supergroup is investigated. It is shown how to construct a local conserved charge given an invariant tensor of the Lie superalgebra. We calculate the…
A recursive random number generator using prime reciprocals is described.
We study the relationship between the continuum overlap and its corresponding chiral determinant, showing that the former amounts to an unregularised version of the latter. We then construct a regularised continuum overlap, and consider the…
Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…
Developments during the last eight years have refuted the folklore that chiral symmetries cannot be preserved on the lattice. The mechanism that permits chiral symmetry to coexist with the lattice is quite general and may work in Nature as…
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…
Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…
A compacted binary tree is a graph created from a binary tree such that repeatedly occurring subtrees in the original tree are represented by pointers to existing ones, and hence every subtree is unique. Such representations form a special…
For every sufficiently large integer $R$, there exists a Carmichael number with exactly $R$ prime factors.
Chirality is of primary importance in many areas of chemistry and has been extensively investigated since its discovery. We introduce here the description of central chirality for tetrahedral molecules using a geometrical approach based on…
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…
We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…
In this paper, we construct a special family of cyclic codes, known as quadratic residue codes of prime length \( p \equiv \pm 1 \pmod{44} ,\) \( p \equiv \pm 5 \pmod{44} ,\) \( p \equiv \pm 7 \pmod{44} ,\) \( p \equiv \pm 9 \pmod{44} \)…
We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…
We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…
We show that for every positive integer $k$, there exist $k$ consecutive primes having the property that if any digit of any one of the primes, including any of the infinitely many leading zero digits, is changed, then that prime becomes…
In this note we describe a method for finding prime numbers as fixed points of particularly simple sequences. Some basic calculations show that success rates for identifying primes this way are over 99.9%. In particular, it seems that the…