[4] **viXra:1111.0059 [pdf]**
*submitted on 17 Nov 2011*

**Authors:** Chun-Xuan Jiang

**Comments:** 90 pages

Using Jiang function we are able to prove almost all prime problems in prime distribution. This is
the Book proof. No great mathematicians study prime problems and prove Riemann hypothesis in
AIM, CLAYMA, IAS, THES, MPIM, MSRI. In this paper using Jiang function J_{2} (ω) we prove
that the new prime theorems (1291)-(1340) contain infinitely many prime solutions and no prime
solutions. From (6) we are able to find the smallest solution π_{k}(N_{0},2) ≥ 1. This is the Book
theorem.

**Category:** Number Theory

[3] **viXra:1111.0040 [pdf]**
*submitted on 10 Nov 2011*

**Authors:** Chun-Xuan Jiang

**Comments:** 90 pages

Using Jiang function we are able to prove almost all prime problems in prime distribution. This is
the Book proof. No great mathematicians study prime problems and prove Riemann hypothesis in
AIM, CLAYMA, IAS, THES, MPIM, MSRI. In this paper using Jiang function J_{2} (ω) we prove
that the new prime theorems (1241)-(1290) contain infinitely many prime solutions and no prime
solutions. From (6) we are able to find the smallest solution π_{k}(N_{0},2) ≥ 1. This is the Book
theorem.

**Category:** Number Theory

[2] **viXra:1111.0038 [pdf]**
*submitted on 10 Nov 2011*

**Authors:** Guangsheng Chen

**Comments:** 8 pages

In this paper, by using the Euler-Maclaurin expansion for the zeta function
and estimating the weight function effectively, we derive a strengthenment of a Hardy-Hilbert's
type inequality proved by W.Y. Zhong. As applications, some particular results are considered.
work.

**Category:** Number Theory

[1] **viXra:1111.0002 [pdf]**
*submitted on 1 Nov 2011*

**Authors:** Chun-Xuan Jiang

**Comments:** 90 Pages.

Using Jiang function we are able to prove almost all prime problems in prime distribution. This is
the Book proof. No great mathematicians study prime problems and prove Riemann hypothesis in
AIM, CLAYMA, IAS, THES, MPIM, MSRI. In this paper using Jiang function J_{2} (ω) we prove
that the new prime theorems (1191)-(1240) contain infinitely many prime solutions and no prime
solutions. From (6) we are able to find the smallest solution π_{k}(N_{0},2) ≥ 1. This is the Book
theorem.

**Category:** Number Theory