Related papers: On the divisibility of binomial coefficients

Let $p,q>1$ be two relatively prime integers and $\mathbb{N}$ the set of nonnegative integers. Let $f_{p,q}(n)$ be the number of different expressions of $n$ written as a sum of distinct terms taken from…

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…

The Schinzel hypothesis claims (but it seems hopeless to prove) that any irreducible Q[x] polynomial without a constant factor assumes infinitely many prime values at integer places. On the other hand, it is easy to see that a reducible…

We consider a variant of a question of N. Koblitz. For an elliptic curve $E/\Q$ which is not $\Q$-isogenous to an elliptic curve with torsion, Koblitz has conjectured that there exists infinitely many primes $p$ such that…

We use homotopy theory to define certain rational coefficients characteristic numbers with integral values, depending on a given prime number q and positive integer t. We prove the first nontrivial degree formula and use it to show that…

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

Let $P_1,\dots,P_k \colon {\bf Z} \to {\bf Z}$ be polynomials of degree at most $d$ for some $d \geq 1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Let m_1,...,m_s be positive integers. Consider the sequence defined by multinomial coefficients: a_n=\binom{(m_1+m_2+... +m_s)n}{m_1 n, m_2 n,..., m_s n}. Fix a positive integer k\ge 2. We show that there exists a positive integer C(k) such…

We prove that for all $n\geq 1$ there exists a number between $n^2$ and $(n+1)^2$ with at most 4 prime factors. This is the first result of this kind that holds for every $n\geq 1$ rather than just sufficiently large $n$. Our approach…

The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $\Phi_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime…

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…

While solving a special case of a question of Erd\H{o}s and Graham Steinerberger asks for all integers $n$ with $\phi(n)=\frac{2}{3} \cdot (n+1)$. He discovered the solutions $n\in\{5, 5 \cdot 7, 5\cdot 7\cdot 37, 5\cdot 7\cdot 37\cdot…

Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.

Inspired by the proof of the Bertrand postulate given by P. Erd\H{o}S, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer…

Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…

The discriminant of a polynomial of the form $\pm x^n \pm x^m \pm 1$ has the form $n^n \pm m^m(n-m)^{n-m}$ when $n,m$ are relatively prime. We investigate when these discriminants have prime power divisors. We explain several symmetries…

Let $h_{(m,k)}$ be the class number of $\mathbb{Q}(\sqrt{1-2m^k}).$ We prove that for any odd natural number $k,$ there exists $m_0$ such that $k \mid h_{(m,k)}$ for all odd $m > m_0.$ We also prove that for any odd $m \geq 3,$ $k \mid…