Related papers: A New Way to Proof 3x+1 Problem

A class theorem is presented and proved: the complex Fourier transforms of a certain class of exponential functions have all their zeros on the real line. A class of basis functions is first considered, and the class is then extended via…

We study decompositions of natural numbers into triangular summands. For instance, we prove that any natural number can be represented as a sum of four triangular numbers, two of them having even indices and the other two having odd…

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…

The $3x+1$ map $T$ is defined on the $2$-adic integers $\mathbb{Z}_2$ by $T(x)=x/2$ for even $x$ and $T(x)=(3x+1)/2$ for odd $x$. It is still unproved that under iteration of $T$ the trajectory of any rational $2$-adic integer is eventually…

In this note, we prove that every non-complete $(k+1)$-critical graph contains cycles of all lengths modulo $k$, where $k=4,5$.

We give a cycle-theoretic proof of the Gross-Zagier conjecture in weight four for several modular curves of genus zero.

Suppose that $ m\equiv 1\mod 4 $ is a prime and that $ n\equiv 3\mod 4 $ is a primitive root modulo $ m $. In this paper we obtain a relation between the class number of the imaginary quadratic field $ \Q(\sqrt{-nm}) $ and the digits of the…

It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…

In this article, we are interested in whether a product of three consecutive integers $a (a+1) (a+2)$ divides another such product $b (b+1) (b+2)$. If this happens, we prove that there is some gaps between them, namely $b \gg \frac{a \log…

We prove the undecidability of the third order pattern matching problem in typed lambda-calculi with dependent types and in those with type constructors by reducing the second order unification problem to them.

In this paper, we show that if $k\geq 6$ and $k \equiv 2 \pmod 4$, then there exists an almost resolvable $k$-cycle system of order $2kt+1$ for all $t\ge 1$ except possibly for $t=2$ and $k\geq 14$. Thus we give a partial solution to an…

We give a new proof Tverberg's famous theorem: For every set $X \subset \R^d$ with $|X|=(r-1)(d+1)+1$, there is a partition of $X$ into $r$ sets $X_1,\ldots,X_r$ such that $\bigcap_{p=1}^r \conv X_p\ne \emptyset$. The new proof uses linear…

With help of $q$-congruence, we prove the divisibility of some binomial sums. For example, for any integers $\rho,n\geq 2$, $$\sum_{k=0}^{n-1}(4k+1) \binom{2k}{k}^\rho \cdot (-4)^{\rho(n-1-k)} \equiv 0\pmod{2^{\rho-2}n\binom{2n}{n}}.$$

The one way function based on the Collatz problem is proposed. It is based on the problem's conditional branching structure which is not considered as important even the 3x+1 question is quite famous. The analysis shows why the problem is…

For $k\geq 2$, we derive an asymptotic formula for the number of zeros of the forms $\prod_{i=1}^{k}(x_{2i-1}^2+x_{2i}^2)+\prod_{i=1}^{k}(x_{2k+2i-1}^2+x_{2k+2i}^2)-x_{4k+1}^{2k}$ and…

We study the factorization of the numbers $N = X^2+c$, where $c$ is a fixed constant, and this independently of the value of gcd$(X,c)$. We prove the existence of a family of sequences with arithmetic difference $(U_n, Z_n)$ generating…

In this paper, we establish a bijection between the set of mutation classes of mutation-cyclic skew-symmetric integral 3x3-matrices and the set of triples of integers (a,b,c) which are all greater than 1 and where the product of the two…

Given integers $k,l\geq 2$, where either $l$ is odd or $k$ is even, let $n(k,l)$ denote the largest integer $n$ such that each element of $A_n$ is a product of $k$ many $l$-cycles. In 2008, M. Herzog, G. Kaplan and A. Lev proved that if…

We are interested in solving the congruences $f^3+g^3+1\equiv 0\pmod{fg}$ and $f^4-4g^2+4\equiv 0\pmod{fg}$ in polynomials $f, g$ with rational coefficients. Moreover, we present results of computations of all integer points on certain one…

For a perfect field $k$, we construct a triangulated category of mixed motives over $k[t]/{(t^{m+1})}$. The ext groups in this category are given by higher Chow groups, and additive higher Chow groups.