相关论文: Congruences for the Fishburn Numbers

The Fishburn numbers $\xi (n)$ are defined by the formal power series \[ \sum_{n \geq 0} \xi (n) q^n = \sum_{n \geq 0} \prod_{j = 1}^n (1 - (1 - q)^j). \] Recently, G. Andrews and J. Sellers discovered congruences of the form $\xi (p m + j)…

There has been significant recent interest in the arithmetic properties of the coefficients of $F(1-q)$ and $\mathscr{F}_t(1-q)$ where $F(q)$ is the Kontsevich-Zagier strange series and $\mathscr{F}_t(q)$ is the strange series associated to…

The "strange" function of Kontsevich and Zagier is defined by \[F(q):=\sum_{n=0}^\infty(1-q)(1-q^2)\dots(1-q^n).\] This series is defined only when $q$ is a root of unity, and provides an example of what Zagier has called a "quantum modular…

Andrews and Sellers recently initiated the study of arithmetic properties of Fishburn numbers. In this paper, we prove prime power congruences for generalized Fishburn numbers. These numbers are the coefficients in the $1-q$ expansion of…

Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…

Recently, a beautiful paper of Andrews and Sellers has established linear congruences for the Fishburn numbers modulo an infinite set of primes. Since then, a number of authors have proven refined results, for example, extending all of…

Let $p \equiv 1 \pmod{4}$ be prime, let $m$ and $n$ be integers such that $p=m^2+n^2$, and let $b$ be a positive integer. Let $Q(z,q) = (z,q/z,q;q)_{\infty}(qz^2,q/z^2;q^2)_{\infty}$ denote the product appearing in the quintuple product…

Let $\{q_n\}_{n=0}^\infty\subset [0,1]$ satisfy $q_0=0$, $\sum_{n=0}^\infty q_n=1$, and $\gcd\{n\geq 1\mid q_n\neq 0\}=1$. We consider the following process: Let $x$ be a real number. We first set $x=0$. Then $x$ is increased by $i$ with…

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}.…

The set $\Mfib$ of fibbinary numbers is defined via a bijection between the set $\BB{N}$ of natural numbers and $\Mfib$. Since the elements of $\Mfib$ do not exhaust $\BB{N}$, the structure of the complement $\overline{\Mfib}$ of $\Mfib$ in…

The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…

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 give an explicit description of the coefficients of the formal power series (1-x)(1-x^2)(1-x^3)(1-x^5)(1-x^8)(1-x^13)... In particular, we show that all the coefficients are equal to -1, 0 or 1.

We prove that, if $m,n\geqslant 1$ and $a_1,\ldots,a_m$ are nonnegative integers, then \begin{align*} \frac{[a_1+\cdots+a_m+1]!}{[a_1]!\ldots[a_m]!}\sum^{n-1}_{h=0}q^h\prod_{i=1}^m{h\brack a_i} \equiv 0\pmod{[n]}, \end{align*} where…

Recently Andrews and Sellers proved some amazing congruences for the Fishburn numbers. We extend their results to a more general sequence of numbers. As a result we prove a new congruence mod 23 for the Fishburn numbers and prove their…

Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in…

The purpose of this note is to report on the discovery of the primes of the form $p=1+n!\sum n$, for some natural numbers $n>0$. The number of digits in the prime p are approximately equal to $\lfloor log_{10}(1+n!\sum n)\rceil+1$.

Let \beta be a real number. Then for almost all irrational \alpha>0 (in the sense of Lebesgue measure) \limsup_{x\to\infty}\pi_{\alpha,\beta}^*(x)(\log x)^2/x>=1, where \pi_{\alpha,\beta}^*(x)={p<=x: both p and [\alpha p+\beta] are primes}.

The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…

In a base phi representation a natural number is written as a sum of powers of the golden mean $\varphi$. There are many ways to do this. How many? Even if the number of powers of $\varphi$ is finite, then any number has infinitely many…