相关论文: On differences between consecutive numbers coprime…

A Prime Difference Champion (PDC) for primes up to $x$ is defined to be any element of the set of one or more differences that occur most frequently among all positive differences between primes $\le x$. Assuming an appropriate form of the…

We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…

Probabilistic models for the distribution of primes in the natural numbers are constructed in the article. The author found and proved the probabilistic estimates of the deviation $R(x)=|\pi(x)- Li(x)|$. The author has analyzed the…

Following a question of J. Cooper, we study the expected number of occurrences of a given permutation pattern $q$ in permutations that avoid another given pattern $r$. In some cases, we find the pattern that occurs least often, (resp. most…

Different questions lead to the same class of functions from natural integers to integers: those which have integral difference ratios, i.e. verifying $f(a)-f(b)\equiv0 \pmod {(a-b)}$ for all $a>b$. We characterize this class of functions…

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

I present a new property of prime numbers that leads to a generalization of Cramer's conjecture. The study of the gap between consecutive primes is treated as a special case of the gap between consecutive terms of sequences having a certain…

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

A positive integer $n$ is said to be $k$-layered if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we start the systematic study of these class of numbers. In particular, we state some algorithms to find some…

The calculation of many and large Perrin pseudoprimes is a challenge. This is mainly due to their rarity. Perrin pseudoprimes are one of the rarest known pseudoprimes. In order to calculate many such large numbers, one needs not only a fast…

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 consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

Let $\left\lbrace P_{k}\right\rbrace_{k\geq0}$ be the Padovan sequence defined by $P_{k}=P_{k-2}+P_{k-3}$ with initial values are $P_{0}=P_{1}=P_{2}=1$. Let $\left\lbrace R_{k}\right\rbrace_{k\geq0}$ be the Perrin sequence defined by…

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…

We prove that for each odd number k, the sequence (k2^n+1)_{n\ge 1} contains only a finite number of Carmichael numbers. We also prove that k=27 is the smallest value for which such a sequence contains some Carmichael number.

In this article, we derive lower bounds for the number of distinct prime divisors of families of non-zero Fourier coefficients of non-CM primitive cusp forms and more generally of non-CM primitive Hilbert cusp forms. In particular, for the…

We study first-order expansions of the reals which do not define the set of natural numbers. We also show that several stronger notions of tameness are equivalent to each others.

We define a primitive index of an integer in a sequence to be the index of the term with the integer as a primitive divisor. For the sequences $k^u+h^u$ and $k^u-h^u$, we discern a formula to find the primitive indexes of any composite…

Bounds and other relations involving variables connected with Carmichael numbers are reviewed and extended. Families of numbers or individual numbers attaining or approaching these bounds are given. A new algorithm for finding three-prime…

The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…