Related papers: A Generalization of Euler's Theorem on Congruencie…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

We present a quantum version of the generalized $(h,\phi)$-entropies, introduced by Salicr\'u \textit{et al.} for the study of classical probability distributions. We establish their basic properties, and show that already known quantum…

For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for…

Euler defines a function f(x) somehow as an infinite product and a generalization of [x], where [x] ist, what we now call following Legendre the Gamma-Funktion. He gets some recursive relationships for f(x), by applying some very nice…

Letting $\delta_1(n,m)$ be the density of the set of integers with exactly one divisor in $(n,m)$, Erd\H{o}s wondered if $\delta_1(n,m)$ is unimodular for fixed $n$. We prove this is false in general, as the sequence $(\delta_1(n,m))$ has…

Let phi denote Euler's phi function. For a fixed odd prime we give an asymptotic series expansion in the sense of Poincare for the number E_q(x) of n<=x such that q does not divide phi(n). Thereby we improve on a recent theorem of B.K.…

Let $p$ be a prime. In 1878 \'{E}. Lucas proved that the congruence $$ {p-1\choose k}\equiv (-1)^k\pmod{p}$$ holds for any nonnegative integer $k\in\{0,1,\ldots,p-1\}$. The converse statement was given in Problem 1494 of {\it Mathematics…

I present Franz Lemmermeyer's proof that if p is a prime congruent to 9 mod 16 then the class number of Q(p^(1/4)) is congruent to 2 mod 4.

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…

We derive general structure and rigidity theorems for submetries $f: M \to X$, where $M$ is a Riemannian manifold with sectional curvature $\sec M \ge 1$. When applied to a non-trivial Riemannian submersion, it follows that $diam X \leq…

We classify the coefficients $(a_1,...,a_n) \in \mathbb{F}_q[t]^n$ that can appear in a linear relation $\sum_{i=1}^n a_i \gamma_i =0$ among Galois conjugates $\gamma_i \in \overline{\mathbb{F}_q(t)}$. We call such an $n$-tuple a Smyth…

In this paper, we use the framework of mod-$\phi$ convergence to prove precise large or moderate deviations for quite general sequences of real valued random variables $(X_{n})_{n \in \mathbb{N}}$, which can be lattice or non-lattice…

Let $N$ be a positive integer and let $f$ be a meromorphic modular function of level $N$ with rational Fourier coefficients. For a prime $p$, define a function $f_p$ on the complex upper half-plane $\mathbb{H}$ by \begin{equation*}…

Fillmore Theorem says that if $A$ is a nonscalar matrix of order $n$ over a field $\mathbb{F}$ and $\gamma_1,\ldots,\gamma_n\in \mathbb{F}$ are such that $\gamma_1+\cdots+\gamma_n=\text{tr} \, A$, then there is a matrix $B$ similar to $A$…

Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius…

In this paper Euler shows how, if we have recursive functions f,g,h and an infinite sequence A,B,C,... which satisfies fA=gB+hC, f'B=g'C+h'D, f''C=g''D+h''E, f'''D=g'''E+h'''F, etc., where the primes denote an index not a derivative, then…

It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…

In 1963, Edward Spence published a proof of the following With $\phi$ being Euler totient function, if $n>1$ is an integer, and if \begin{equation*} 0<a_1<\cdots<a_{\phi(n)}<n, \end{equation*} are the positive integers less than $n$,…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.