Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1306.0795

Matrix Online Characteristic Number and Its applications in Goldbach Conjecture,Polignac Conjecture,the Twin Prime Conjecture

Baoshan Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article consists of three chapters.In Chapter 1, it is determined by the consecutive odd numbers, and study to the intrinsic properties of a class of matrix sequence. Through the establishment of matrix online number concept, characteristics and the online number column use mathematical induction to prove the some properties of this kind of matrix on the number of online features (Theorem 1). Finally, it is given a trial to prove the Goldbach conjecture (Theorem 6). This is the author in the years to explore prime properties in the process of research and discovery, and believe that this finding is of great significance.In Chapter 2, it is defined the concepts of matrix master characteristic number and the Matrix Master Characteristic Sequence (Definition 1). Firstly, we prove that any even number can be expressed as for the difference of two odd prime numbers at least two groups (Theorem 4). Secondly, we prove that there are infinitely many odd prime numbers separated by four (Theorem 9). Finally, we prove that if there is greater than 1 in the intersection by S(3) and s(2m+3) for any natural number m, so that there are infinitely many odd prime numbers separated by 2m(Theorem11). The results will undoubtedly promote the research for Polignac conjecture.In Chapter 3, mainly as a result of any odd natural number a, the intersection by S(a) and s(a+2) is not empty number set, and there are far more than 1 number in the set, where S(a)={k,If 2k+a be prime as k be natural number},and P is a prime number set, N is natural number set. we prove that there are an infinite number of twin prime, and then solve the problem of the twin primes in number theory.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Baoshan Zhang. 2013-06-04. Matrix Online Characteristic Number and Its applications in Goldbach Conjecture,Polignac Conjecture,the Twin Prime Conjecture. https://arxiv.org/abs/1306.0795

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗