Related papers: Cyclic prime numbers

We present constructions of symmetric complete sum-free sets in general finite cyclic groups. It is shown that the relative sizes of the sets are dense in $[0,\frac{1}{3}]$, answering a question of Cameron, and that the number of those…

We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…

We present a family of reducible cyclic codes constructed as the direct sum of two different semiprimitive two-weight irreducible cyclic codes. This family generalizes the class of reducible cyclic codes that was reported in the main result…

We completely characterise when the sequence of free subgroup numbers of a finitely generated virtually free group is ultimately periodic modulo a given prime power.

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…

A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.

Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…

We prove the cyclic sum formulas for certain two-parameter multiple series. These are new and non-trivial generalizations of the cyclic sum formulas for multiple zeta values and multiple zeta-star values.

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three zeros. Recently, \cite{Y-X-D12}…

Expressions of type $(p^q-1)/(p-1)$ and $a^2+ab+b^2$, where $a, b$ are natural and $p, q$ are prime numbers, are studied.

In this paper, we list several interesting structures of cyclotomic polynomials: specifically relations among blocks obtained by suitable partition of cyclotomic polynomials. We present explicit and self-contained proof for all of them,…

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

The number of primes of a kind x^2+1 is infinite.

We construct an infinite family of real cyclotomic fields with non-trivial class group. This result generalizes the result in [1] in the sense that our family includes theirs.

This article deals with a study of the structure of the class group of the cyclotomic field $K=\Q(\zeta_p)$ for $p$ an odd prime number, starting from Stickelberger relation. The present state of this work leads me to set a question for all…

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We introduce $p$-derivations and give a few basic ways in which they act like derivatives by numbers.

We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…

Since their appearance in the 1950s, computational models capable of performing probabilistic choices have received wide attention and are nowadays pervasive in almost every areas of computer science. Their development was also inextricably…