Related papers: Cyclic prime numbers
It is known that the sum of the reciprocal of integers, $\sum_n (1/n)$, and the sum of the reciprocal of primes, $\sum_n (1/p_n)$, both diverge. Here, we study a series made from primes that sums exactly to 1. We also show this sum is…
We prove a recursive formula for the exterior and symmetric powers of modules for a cyclic 2-group. This makes computation straightforward. Previously, a complete description was only known for cyclic groups of prime order.
We define C sequential optimization numbers, where C is a k+1-tuple vector. We prove that the unsigned Stirling numbers of first kind are (0,1) sequential optimization numbers. Many achievements of the Stirling numbers of first kind can be…
We study, from the viewpoint of metrical number theory and (infinite) ergodic theory, the probabilistic laws governing the occurrence of prime numbers as digits in continued fraction expansions of real numbers.
We consider the reduction of an elliptic curve defined over the rational numbers modulo primes in a given arithmetic progression and investigate how often the subgroup of rational points of this reduced curve is cyclic as a special case of…
A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.
A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…
Let $K/\Q$ be a cyclic extension of number fields with Galois group $G$. We study the ideal classes of primes $\mathfrak{p}$ of $K$ of residue degree bigger than one in the class group of $K$. In particular, we explore such extensions…
In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…
Prime number related fractal polygons and curves are derived by combining two different aspects. One is an approximation of the prime counting function build on an additive function. The other are prime number indexed basis entities taken…
Natural numbers satisfying an unusual property are mentioned by the author in [5], in which their infinitude is also proved. In this paper, we start with an arbitrary natural number which is not a multiple of 10 and non-palindromic, form…
A modified Lagrange Polynomial is introduced for polynomial extrapolation, which can be used to estimate the equally spaced values of a polynomial function. As an example of its application, this article presents a prime-generating…
Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.
Several examples of generalized number systems are constructed to compare various conditions occurring in the literature for the prime number theorem in the context of Beurling generalized primes.
Classifications of twin primes are established and then applied to triplets that generalize to all higher multiplets. Mersenne and Fermat twins and triplets are treated in this framework. Regular prime number multiplets are related to…
We give a simple proof of the well-known fact: any group of n elements is cyclic if and only if n and \phi(n) are coprime. This note is accessible for students familiar with permutations and basic number theory. No knowledge of abstract…
Cyclic codes have wide applications in data storage systems and communication systems. Employing two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field GF}(q) and…
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…
A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…
Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…