This paper presents various transcendence results in the ring of integers modulo infinitely large primes $\mathcal {A}$. In the ring $\mathcal {A}$, one can consider two notions of transcendence. One is based on the notion of finite algebraic numbers introduced by Rosen, while the other is transcendence in the naive sense. It is known that transcendence in the latter sense automatically implies transcendence in the former sense. In this paper, we strengthen results due to Anzawa and Funakura and to Luca and Zudilin by removing some of their assumptions and, in some cases, upgrading them to statements of naive transcendence. We also present several examples of naive transcendental numbers that do not seem to have appeared previously in the literature. Although we are not able to establish naive transcendence for certain numbers, we prove the irrationality of numbers such as $\log _{\mathcal {A}}(2)$ under the ABC conjecture.

We prove the following conjecture of Z.-W. Sun [‘On congruences related to central binomial coefficients’, J. Number Theory 13(11) (2011), 2219–2238]. Let p be an odd prime. Then

$$ \begin{align*} \sum_{k=1}^{p-1}\frac{\binom{2k}k}{k2^k}\equiv-\frac12H_{{(p-1)}/2}+\frac7{16}p^2B_{p-3}\pmod{p^3}, \end{align*} $$

where $H_n$ is the nth harmonic number and $B_n$ is the nth Bernoulli number. In addition, we evaluate $\sum _{k=0}^{p-1}(ak+b)\binom {2k}k/2^k$ modulo $p^3$ for any p-adic integers $a, b$.

In this paper, we mainly prove the following conjectures of Sun [16]: Let p > 3 be a prime. Then

\begin{align*}&A_{2p}\equiv A_2-\frac{1648}3p^3B_{p-3}\ ({\rm{mod}}\ p^4),\\&A_{2p-1}\equiv A_1+\frac{16p^3}3B_{p-3}\ ({\rm{mod}}\ p^4),\\&A_{3p}\equiv A_3-36738p^3B_{p-3}\ ({\rm{mod}}\ p^4),\end{align*}

where $A_n=\sum_{k=0}^n\binom{n}k^2\binom{n+k}{k}^2$ is the nth Apéry number, and Bn is the nth Bernoulli number.

We prove two conjectural congruences on the $(p-1)$th Apéry number, which were recently proposed by Z.-H. Sun.

We prove that ${ \mathbb{Z} }_{{p}^{n} } $ and ${ \mathbb{Z} }_{p} [t] / ({t}^{n} )$ are polynomially equivalent if and only if $n\leq 2$ or ${p}^{n} = 8$. For the proof, employing Bernoulli numbers, we explicitly provide the polynomials which compute the carry-on part for the addition and multiplication in base $p$. As a corollary, we characterize finite rings of ${p}^{2} $ elements up to polynomial equivalence.

Let $b\,>\,1$ be an integer. We prove that for almost all $n$ , the sum of the digits in base $b$ of the numerator of the Bernoulli number ${{B}_{2n}}$ exceeds $c$ log $n$ , where $c\,:=\,c\left( b \right)\,>\,0$ is some constant depending on $b$ .

We prove that the sequence {log ζ(n)}n≥2 is not holonomic, that is, does not satisfy a finite recurrence relation with polynomial coefficients. A similar result holds for L-functions. We then prove a result concerning the number of distinct prime factors of the sequence of numerators of even indexed Bernoulli numbers.

We present a fast Poisson solver on spherical shells. With a special change of variable, the radial part of the Laplacian transforms to a constant coefficient differential operator. As a result, the Fast Fourier Transform can be applied to solve the Poisson equation with operations. Numerical examples have confirmed the accuracy and robustness of the new scheme.

We obtain a generalized discrete Hilbert and Hardy-Hilbert inequality with non-conjugate parameters by means of an Euler-Maclaurin summation formula. We derive some general results for homogeneous functions and compare our findings with existing results. We improve some earlier results and apply the results to some special homogeneous functions.