Related papers: Cyclic prime numbers
In the present article, real number representations, that are generalizations of classical positive and alternating representations of numbers, are introduced and investigated. The main metric relation, properties of cylinder sets are…
As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square…
If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…
This note will give an enumeration of $n$-cycles in the symmetric group ${\mathcal S}_n$ by their degree (also known as their cyclic descent number) and studies similar counting problems for the conjugacy classes of $n$-cycles under the…
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
We survey the classical results on the prime number theorem
Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…
We obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic points and tails in the case of modulo a prime to…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
In recent years, computer simulations are playing a fundamental role in unveiling some of the most intriguing features of prime numbers. In this work, we define an algorithm for a deterministic walk through a two-dimensional grid that we…
Let $p$ be a prime number. In this paper, we discuss the structures of cyclic codes over the ring $ \mathbb{F}_p[u, v] / \langle u^k, v^2, uv-vu\rangle$. We find a unique set of generators for these codes. We also study the rank and the…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
We arrive at some new relations for the prime number $P_n$, based on the logarithmic and absolute-value properties of the function $\pi(x)$.
Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an…
We define a class of rational numbers including, as a particular case, the classical harmonic numbers. For one particular instance we apply it to the expansion into powers series of a special function, and also detail its relashionship with…
In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins
We generalize the definition and properties of root systems to complex reflection groups - roots become rank one projective modules over the ring of integers of a number field k. In the irreducible case, we provide a classification of root…
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
In this paper we review the properties of families of numbers of the form $6n\pm1$, with $n$ integer (in which there are all prime numbers greater than 3 and other compound numbers with particular properties) to later use them in a new…