相关论文: There are no Collatz-m-Cycles with $m\leq 91$

Singmaster's conjecture asserts that every natural number greater than one occurs at most a bounded number of times in Pascal's triangle; that is, for any natural number $t \geq 2$, the number of solutions to the equation $\binom{n}{m} = t$…

In this paper, we will introduce an extension to the Collatz's conjecture. This conjecture may be seen as a general conjecture that unifies the Collatz one together with many other similar conjectures. For instance, we propose our new…

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

Y. Manoussakis (J. Graph Theory 16, 1992, 51-59) proposed the following conjecture. \noindent\textbf{Conjecture}. {\it Let $D$ be a 2-strongly connected digraph of order $n$ such that for all distinct pairs of non-adjacent vertices $x$, $y$…

We show a $n^2 \cdot 2^{n/2}$ upper bound on the number of $(132,213)$ avoiding cyclic permutations. This is the first nontrivial upper bound on the number of such permutations. We also construct an algorithm to determine whether a…

This paper presents an algorithmic method that, given a positive integer $j$, generates the $j$-th convergence stair containing all natural numbers from where the Collatz conjecture holds by exactly $j$ applications of the Collatz function.…

In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial generalizations for three problems in discrete geometry, one of which being the Dirac conjecture. According to this conjecture, any set of $n$…

We show that for any positive integer $r$ there exists an integer $k$ and a $k$-colouring of the edges of $K_{2^{k}+1}$ with no monochromatic odd cycle of length less than $r$. This makes progress on a problem of Erd\H{o}s and Graham and…

We show that, for each real number $\alpha > 0$ and odd integer $k\ge 5$ there is an integer $c$ such that, if $M$ is a simple binary matroid with $|M| \ge \alpha 2^{r(M)}$ and with no $k$-element circuit, then $M$ has critical number at…

The Collatz process is defined on natural numbers by iterating the map $T(x) = T_0(x) = x/2$ when $x\in\mathbb{N}$ is even and $T(x)=T_1(x) =(3x+1)/2$ when $x$ is odd. In an effort to understand its dynamics, and since Generalised Collatz…

I investigate structural limitations of Presburger-arithmetic-based approaches to the Collatz problem. I show that the Collatz cycle equation admits a unique solution in the $2$-adic integers, which I term a \emph{ghost cycle}. These ghost…

We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture is easier to explore because certain…

The ternary Goldbach conjecture, or three-primes problem, asserts that every odd integer $n$ greater than $5$ is the sum of three primes. The present paper proves this conjecture. Both the ternary Goldbach conjecture and the binary, or…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.

In this paper, we make significant progress on a conjecture proposed by Dan Archdeacon on the existence of integer Heffter arrays $H(m,n;s,k)$ whenever the necessary conditions hold, that is, $3\leqslant s \leqslant n$, $3\leqslant…

The Legendre conjecture has resisted analysis over a century, even under assumption of the Riemann Hypothesis. We present, a significant improvement on previous results by greatly reducing the assumption to a more modest statement called…

Let $q$ be an odd prime, and let $T_{q}:\mathbb{Z}\rightarrow\mathbb{Z}$ be the Shortened $qx+1$ map, defined by $T_{q}\left(n\right)=n/2$ if $n$ is even and $T_{q}\left(n\right)=\left(qn+1\right)/2$ if $n$ is odd. The study of the dynamics…

This paper explores special arrangements of clues in $m \times n$ Numbrix puzzles. The maximum number of clues which fails to define an $m \times n$ puzzle is demonstrated for all $m$ and $n$. In addition, a small upper bound on the minimum…