相关论文: Some 2-adic integers related to the odd part of 2^…

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

Let S(n,k) denote the Stirling numbers of the second kind. We prove that the p-adic limit of S(p^e a + c, p^e b + d) as e goes to infinity exists for all integers a, b, c, and d. We call the limiting p-adic integer S(p^\infty a + c,…

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Let $P_n(x)=\frac1{n!}\sum\binom n{2i+1}(2i+1)^x$. This extends to a continuous function on the 2-adic integers, the $n$th 2-adic partial Stirling function. We show that $(-1)^{n+1}P_n$ is the only 2-adically continuous approximation to…

We study the 2-adic version of the ring $C^*$-algebra of the integers. First, we work out the precise relation between the Cuntz algebra $\cO_2$ and our 2-adic ring $C^*$-algebra in terms of representations. Secondly, we prove a 2-adic…

We consider the variant of Coxeter-Conway frieze patterns called 2-frieze. We prove that there exist infinitely many closed integral 2-friezes (i.e. containing only positive integers) provided the width of the array is bigger than 4. We…

The Collatz conjecture can be stated in terms of the reduced Collatz function R(x) = (3x+1)/2^m (where 2^m is the larger power of 2 that divides 3x+1). The conjecture is: Starting from any odd positive integer and repeating R(x) we…

It is well-known that for any distinct positive integers $k$ and $n$, the numbers $2^{2^k}+1$ and $2^{2^n}+1$ are relatively prime. In this paper we consider the situation when 1 is replaced by some positive integer $d>1$

In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.

In this note, we study the arithmetic function $f : \mathbb{Z}_+^* \to \mathbb{Q}_+^*$ defined by $f(2^k \ell) = \ell^{1 - k}$ ($\forall k, \ell \in \mathbb{N}$, $\ell$ odd). We show several important properties about that function and then…

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

We prove that for any nonnegative integers $n$ and $r$ the binomial sum $$ \sum_{k=-n}^n\binom{2n}{n-k}k^{2r} $$ is divisible by $2^{2n-\min\{\alpha(n),\alpha(r)\}}$, where $\alpha(n)$ denotes the number of 1's in the binary expansion of…

The values of the Riemann zeta function at odd positive integers, $\zeta(2n+1)$, are shown to admit a representation proportional to the finite-part of the divergent integral $\int_0^{\infty} t^{-2n-1} \operatorname{csch}t\,\mathrm{d}t$.…

Using a polylogarithmic identity, we express the values of $\zeta$ at odd integers $2n+1$ as integrals over unit $n-$dimensional hypercubes of simple functions involving products of logarithms. We also prove a useful property of those…

In this paper we prove three results conjectured by Z.-W. Sun. Let $p$ be an odd prime and let $h\in \mathbb{Z}$ with $2h-1\equiv0\pmod{p^{}}$. For $a\in\mathbb{Z}^{+}$ and $p^a>3$, we show that \begin{align}\notag…

We introduce a new conjecture on products of two distinct primes that would provide a partial answer to a conjecture of McIntosh. Also, $\binom{2p-1}{p-1}-1$ is written in terms of a polynomial in prime $p$ over the integers and we discuss…

In this paper, we show that if the numbers in the range $[1,2^n]$ satisfy Collatz conjecture, then almost all integers in the range $[2^n+1,2^{n+1}]$ will satisfy the conjecture as $n \to \infty$. The previous statement is equivalent to…

We use the grid consisting of bits of 3^n to motivate the definition of 2-adic numbers. Specifically, we exhibit diagonal stripes in the bits of 3^(2^n), which turn out to be the first in an infinite sequence of such structures. Our…

Let $m, n, k$ and $c$ be positive integers. Let $\nu_2(k)$ be the 2-adic valuation of $k$. By $S(n,k)$ we denote the Stirling numbers of the second kind. In this paper, we first establish a convolution identity of the Stirling numbers of…