Related papers: Browkin's discriminator conjecture
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
Let $F_n$ be the $n$-th Fibonacci number. In this paper, we study the Diophantine equation $F_n+F_m=p^xq^y$ in nonnegative integers $n\ge m$, $x$ and $y$, where $p$ and $q$ are fixed distinct prime numbers. We determine all pairs of primes…
We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms…
The celebrated (First) Borwein Conjecture predicts that for all positive integers~$n$ the sign pattern of the coefficients of the ``Borwein polynomial'' $$(1-q)(1-q^2)(1-q^4)(1-q^5) \cdots(1-q^{3n-2})(1-q^{3n-1})$$ is $+--+--\cdots$. It was…
We first prove that if $a$ has a prime factor not dividing $b$ then there are infinitely many positive integers $n$ such that $\binom {an+bn} {an}$ is not divisible by $bn+1$. This confirms a recent conjecture of Z.-W. Sun. Moreover, we…
Let $\overline{p}_{k}(n)$ denote the number of overpartition $k$-tuples of $n$. In 2023, Saikia \cite{saikia} conjectured the following congruences: \begin{align*} \overline{p}_{q}(8n+2)& \equiv 0 \pmod{4},\quad \overline{p}_{q}(8n+3)\equiv…
Let $q$ be a prime power of a prime $p$, $n$ a positive integer and $\mathbb F_{q^n}$ the finite field with $q^n$ elements. The $k-$normal elements over finite fields were introduced and characterized by Huczynska et al (2013). Under the…
For integers $m \geq 2$, we study divergent continued fractions whose numerators and denominators in each of the $m$ arithmetic progressions modulo $m$ converge. Special cases give, among other things, an infinite sequence of divergence…
We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…
We introduce a random recursive tree model with two communities, called balanced community modulated random recursive tree, or BCMRT in short. In this setting, pairs of nodes of different type appear sequentially. Each node of the pair…
In this paper, we introduce and study a variant of Kummer's notion of (ir)regularity of primes which we call G-irregularity. It is based on Genocchi numbers $G_n$, rather than Bernoulli number $B_n.$ We say that an odd prime $p$ is…
Recently, Romik determined in [9] the Taylor expansion of the Jacobi theta constant \theta_3, around the point x = 1. He discovered a new integer sequence, (d(n))_0^\infty=1, 1, -1, 51, 849, -26199, \dots, from which the Taylor coefficients…
Prime numbers, whose properties are important subjects in mathematics, are also fundamental in computer science notably in IT security, Cryptocurrencies as Bitcoin and Blockchain, cryptography, Code theory notably Error detection codes,…
Generating primes is a fundamental problem in modern cryptography. Deterministic primality tests work well for special integers such as Mersenne or Proth primes, but these forms are quite restrictive. In this paper, we give a direct method…
In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
Suppose that $ m\equiv 1\mod 4 $ is a prime and that $ n\equiv 3\mod 4 $ is a primitive root modulo $ m $. In this paper we obtain a relation between the class number of the imaginary quadratic field $ \Q(\sqrt{-nm}) $ and the digits of the…
A recent construction by Amarra, Devillers and Praeger of block designs with specific parameters depends on certain quadratic polynomials, with integer coefficients, taking prime power values. The Bunyakovsky Conjecture, if true, would…
The Twin Prime conjecture states that there are infinitely many pairs of distinct primes which differ by $2$. Until recently this conjecture had seemed to be far out of reach with current techniques. However, in April 2013, Yitang Zhang…
Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers < x that are in a given arithmetic progression modulo q and the product of two primes. The two assumptions are (i) the…