English
Related papers

Related papers: Divisibility by 2 and 3 of certain Stirling number…

200 papers

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun

We construct a new parametrization of double sequences $\{A_{n,k}(s)\}_{n,k}$ between $A_{n,k}(0)= \binom{n-1}{k-1}$ and $A_{n,k}(1)= \frac{1}{n!}\stirl{n}{k}$, where $\stirl{n}{k}$ are the unsigned Stirling numbers of the first kind. For…

Combinatorics · Mathematics 2022-08-23 Bernhard Heim , Markus Neuhauser

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

Number Theory · Mathematics 2018-01-23 Andrea Sartori

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

Number Theory · Mathematics 2018-04-25 Olivier Bordellès , Florian Luca , Pieter Moree , Igor E. Shparlinski

Kurepa's hypothesis asserts that for each integer $n\ge 2$ the greatest common divisor of $!n:=\sum_{k=0}^{n-1}k!$ and $n!$ is $2$. Motivated by an equivalent formulation of this hypothesis involving derangement numbers, here we give a…

Number Theory · Mathematics 2014-01-08 Romeo Meštrović

Let $L(n,k,r,p)$ denote the minimum number of $k$-subsets of an $n$-set such that all the $\binom{n}{p}$ $p$-subsets are intersected by one of them in at least $r$ elements. The case $p=r$ corresponds to the covering numbers, while the case…

Combinatorics · Mathematics 2023-11-14 Alexander Sidorenko

If S is a smooth compact surface in $\mathbb{R}^{3}$ with strictly positive second fundamental form, and $E_S$ is the corresponding extension operator, then we prove that for all $p > 3$, $\left\|E_S f\right\|_{L^p\left(\mathbb{R}^3\right)}…

Classical Analysis and ODEs · Mathematics 2023-04-05 Hoyoung Song

In this article, we give a positive answer to a question posed in 1960 by D.S. Mitrinovi\'{c} and R.S. Mitrinovi\'{c} (see: D.S. Mitrinovi\'{c} et R.S. Mitrinovi\'{c}, Tableaux qui fournissent des polyn\^{o}mes de Stirling, Publications de…

Combinatorics · Mathematics 2014-02-25 Farid Bencherif , Tarek Garici

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie

Let $p>3$ be a prime. Euler numbers $E_{p-3}$ first appeared in H. S. Vandiver's work (1940) in connection with the first case of Fermat Last Theorem. Vandiver proved that $x^p+y^p=z^p$ has no solution for integers $x,y,z$ with…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2014-06-25 Tewodros Amdeberhan

Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4p-3$, $p$ is a prime number, then it has a subsequence of length $p$, whose sum is $0$ modulo $p$. It is known that in $Z_{p}^{3}$ to get a…

Number Theory · Mathematics 2014-09-10 Satwik Mukherjee

A partition n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k is called non-squashing if p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the…

Combinatorics · Mathematics 2014-09-17 N. J. A. Sloane , James A. Sellers

A sequence $S$ is potentially $K_{p,1,1}$ graphical if it has a realization containing a $K_{p,1,1}$ as a subgraph, where $K_{p,1,1}$ is a complete 3-partite graph with partition sizes $p,1,1$. Let $\sigma(K_{p,1,1}, n)$ denote the smallest…

Combinatorics · Mathematics 2007-05-23 Chunhui Lai

A number which is S.P in base r is a positive integer which is equal to the sum of its base-r digits multiplied by the product of its base-r digits. These numbers have been studied extensively in The Mathematical Gazette. Recently, Shah Ali…

History and Overview · Mathematics 2011-01-04 Paul M. Kominers , Scott D. Kominers

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

Number Theory · Mathematics 2008-10-06 Joseph B. Keller

Let P be the set of the sequence of polynomials of degree n. The aim of this paper is to study the Stirling numbers of the second kind associated with P and of the first kind associated with P, in a unified and systematic way with the help…

Number Theory · Mathematics 2022-02-24 Dae san Kim , taekyun Kim

The author advocates two specific mathematical notations from his popular course and joint textbook, "Concrete Mathematics". The first of these, extending an idea of Iverson, is the notation "[P]" for the function which is 1 when the…

History and Overview · Mathematics 2008-02-03 Donald E. Knuth

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

Number Theory · Mathematics 2011-10-24 Thomas Stoll

A sequence $(x_n)$ in a lattice-normed space $(X,p,E)$ is statistical $p$-convergent to $x\in X$ if there exists a statistical $p$-decreasing sequence $q\stpd 0$ with an index set $K$ such that $\delta(K)=1$ and $p(x_{n_k}-x)\leq q_{n_k}$…

Functional Analysis · Mathematics 2022-04-25 Abdullah Aydın , Reha Yapalı , Erdal Korkmaz