中文
相关论文

相关论文: About Goldbach strong conjecture

200 篇论文

This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…

综合数学 · 数学 2025-03-12 Fadwa Hamdi Barakat

In this paper we prove that the binary Goldbach conjecture for sufficiently large even integers would follow under the assumption that both the Elliott-Halberstam conjecture and a variant of the Elliott-Halberstam conjecture twisted by the…

数论 · 数学 2022-08-30 Jing-Jing Huang , Huixi Li

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…

数论 · 数学 2025-04-15 Takafumi Miyazaki , István Pink

For every odd integer $n \geq 3$, we prove that there exist infinitely many number fields of degree $n$ and associated Galois group $S_n$ whose class number is odd. To do so, we study the class groups of families of number fields of degree…

数论 · 数学 2018-05-23 Wei Ho , Arul Shankar , Ila Varma

The work in this article is concerned with two different types of families of finite sets: separating families and splitting families (they are also called "systems"). These families have applications in combinatorial search, coding theory,…

组合数学 · 数学 2019-08-16 Daniel Condon , Samuel Coskey , Luke Serafin , Cody Stockdale

Consider a system \Psi of non-constant affine-linear forms \psi_1,...,\psi_t: Z^d -> Z, no two of which are linearly dependent. Let N be a large integer, and let K be a convex subset of [-N,N]^d. A famous and difficult open conjecture of…

数论 · 数学 2008-04-22 Ben Green , Terence Tao

We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…

群论 · 数学 2020-09-14 Alan R. Camina , Rachel D. Camina

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…

综合数学 · 数学 2021-10-14 Dagnachew Jenber

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

数论 · 数学 2023-05-10 Bin Wei , Trevor D. Wooley

The problem of finding provably maximal sets of mutually unbiased bases in $\mathbb{C}^d$, for composite dimensions $d$ which are not prime powers, remains completely open. In the first interesting case, $d=6$, Zauner predicted that there…

量子物理 · 物理学 2021-03-17 Gary McConnell , Harry Spencer , Afaq Tahir

Let $b$ be an integer greater than or equal to $2$. For any integer $n\in \left[b^{\lambda-1}, b^{\lambda}-1\right]$, we denote by $R_\lambda (n)$ the reverse of $n$ in base $b$, obtained by reversing the order of the digits of $n$. We…

数论 · 数学 2025-07-11 Cécile Dartyge , Joël Rivat , Cathy Swaenepoel

We study whether sufficiently large integers can be written in the form cp+T_x, where p is either zero or a prime congruent to r mod d, and T_x=x(x+1)/2 is a triangular number. We also investigate whether there are infinitely many positive…

数论 · 数学 2009-02-08 Zhi-Wei Sun

With the uniform positions we prove theorems of Landau and Hardy-Littlwood type for Goldbach, Chen, Lemoine-Levy and other binary partitions of positive integers. We also pose some new conjectures.

数论 · 数学 2012-03-27 Vladimir Shevelev

Several notions of multiplicativity are introduced for forms of degree $d\geq 3$ over a field of characteristic 0 or greater than d. Examples of multiplicative and strongly multiplicative forms of higher degree are given. Conditions…

环与代数 · 数学 2007-05-23 S. Pumpluen

We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…

逻辑 · 数学 2019-01-01 Dmytro Taranovsky

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

We reformulate the $3x+1$ conjecture by restricting attention to numbers congruent to $2$ (mod $3$). This leads to an equivalent conjecture for positive integers that reveals new aspects of the dynamics of the $3x+1$ problem. Advantages…

数论 · 数学 2020-09-24 Roger Zarnowski

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

群论 · 数学 2008-08-28 Noah Snyder

In this paper, we give new families of strong Skolem starters for $\mathbb{Z}_{p^n}$ and $\mathbb{Z}_{pq}$, for infinitely many odd primes $p,q\equiv1$ (mod 8) and $n>1$ be an integer.

组合数学 · 数学 2020-11-10 Adrián Vázquez-Ávila

In this paper, we extend recent work of the third author and Ziegler on triples of integers $(a,b,c)$, with the property that each of $(a,b,c)$, $(a+1,b+1,c+1)$ and $(a+2,b+2,c+2)$ is multiplicatively dependent, completely classifying such…

数论 · 数学 2024-11-21 Michael A. Bennett , István Pink , Ingrid Vukusic