中文
相关论文

相关论文: The 3x+1 Problem: An Annotated Bibliography, II (2…

200 篇论文

The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n -> p\_n), where p\_n denotes the (n+1)-th prime, are open questions. As a possible approach, we extend the latter theory by adding some…

逻辑 · 数学 2007-05-23 Patrick Cegielski , Denis Richard , Maxim Vsemirnov

In this paper, we first prove that given a nonnegative integer $m$ and an odd number $t$ not divisible by $3$, there exists a unique Collatz's Sequence \[ S_{c}(m,t)=\{n_{0}(m,t),n_{1}(m,t),n_{2}(m,t),\ldots,n_{m}(m,t),n_{m+1}(m,t)\} \]…

综合数学 · 数学 2026-01-13 Shan-Guang Tan

P. Arnoux and A. Marin showed that any triangulation of $\mathbb{RP}^n$ contains more than $\frac{(n+1)(n+2)}{2}$ vertices if $n \geq 3$. We construct some natural triangulation of $\mathbb{RP}^n$ with $\frac{n(n+5)}{2}-1$ vertices for all…

几何拓扑 · 数学 2015-04-16 Soumen Sarkar

This paper introduces a new method to find the next prime number after a given prime ${P}$. The proposed method is used to derive a system of inequalities, that serve as constraints which should be satisfied by all primes whose successor is…

综合数学 · 数学 2020-05-07 Reema Joshi

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…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

综合数学 · 数学 2023-07-31 Mbakiso Fix Mothebe

For any integer $m\ge0$, we recall that triangular numbers are those $\mathbf{T}(m)=\frac{m(m+1)}{2}$. A conjecture of Sun Zhi-Wei states that an integer $2^n\pm n$ with any $n>2$ can not be a triangular number. The motivation of this work…

数论 · 数学 2022-02-18 Wang Jia-Hui , Zhu Hui-Lin

Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and…

We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of{a_n})_{n\ge 1}$ or the form $(\root{n+1}\of{a_{n+1}}/\root n\of{a_n})_{n\ge1}$, where $(a_n)_{n\ge 1}$ is a…

组合数学 · 数学 2013-11-01 Zhi-Wei Sun

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…

数论 · 数学 2014-01-20 H. A. Helfgott

We state, discuss, provide evidence for, and prove in special cases the conjecture that the probability that a random tiling by rhombi of a hexagon with side lengths $2n+a,2n+b,2n+c,2n+a,2n+b,2n+c$ contains the (horizontal) rhombus with…

组合数学 · 数学 2007-05-23 Christian Krattenthaler

A multipermutation with $k$ copies each of $1\ldots n$ is Carlitz if neighbours are different. We enumerate these objects for $k=2,3,4$ and derive recurrences. In particular, we prove and improve a conjectured recurrence for $k=3$, stated…

组合数学 · 数学 2017-02-20 Henrik Eriksson , Alexis Martin

The Diophantine equation 4/n=1/x+1/y+1/z for a Pythagorean prime n is split into two independent Diophantine equations, which correspond to two different types of solution. The solvability of these equations forces certain restrictions on…

综合数学 · 数学 2025-03-18 Bernd R. Schuh

A survey of recent progress in three areas of algebraic combinatorics: (1) the Saturation Conjecture for Littlewood-Richardson coefficients, (2) the n! and (n+1)^{n-1} conjectures, and (3) longest increasing subsequences of permutations.

组合数学 · 数学 2007-05-23 Richard P. Stanley

An integer of the form $T_x=\frac{x(x+1)}2$ for some positive integer $x$ is called a triangular number. A ternary triangular form $aT_{x}+bT_{y}+cT_{z}$ for positive integers $a,b$ and $c$ is called regular if it represents every positive…

数论 · 数学 2019-03-11 Mingyu Kim , Byeong-Kweon Oh

Fix $\gamma \in \mathbb{Z}_{>0}^{odd}$ and $n\in\mathbb{Z}_{>0}$. We define the function $C_\gamma:{\mathbb Z}_{>0}\to {\mathbb Z}_{>0}$ such that if $n$ is odd, $C_\gamma(n)=3n+\gamma$; and if $n$ is even, $C_\gamma(n)=n/2$. We define the…

综合数学 · 数学 2023-10-12 Benjamin Bairrington

In the 3+1 framework of the Einstein equations for the case of vanishing shift vector and arbitrary lapse, we calculate explicitly the four boundary equations arising from the vanishing of the projection of the Einstein tensor along the…

广义相对论与量子宇宙学 · 物理学 2009-11-10 Simonetta Frittelli , Roberto Gomez

Given a positive integer $n$, a sufficient condition on a field is given for bounding its Pythagoras number by $2^n+1$. The condition is satisfied for $n=1$ by function fields of curves over iterated formal power series fields over…

数论 · 数学 2024-02-13 Karim Johannes Becher , Marco Zaninelli

Three years after the completion of the next-to-leading order calculation, the status of the theoretical estimates of $\epsilon'/\epsilon$ is reviewed. In spite of the theoretical progress, the prediction of $\epsilon'/\epsilon$ is still…

高能物理 - 唯象学 · 物理学 2016-09-06 Marco Ciuchini

A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…

组合数学 · 数学 2017-05-17 Moshe White