Number Theory

    

Proof of Goldbach Conjecture

Authors: Toshihiko Ishiwata

This paper is a trial to prove Goldbach conjecture according to the following process.1. We make the function lu2032(n) regarding n. When an even number n is divided into 2 odd numbers, lu2032(n) ≤ l(n) holds true. l(n) : the total number of ways to divide an even number n into 2 primenumbers. 2. We find that 0 < lu2032(n) holds true in 4∗1018 ≤ n. 3. Goldbach conjecture is already confirmed to be true up to n = 4∗1018. 4. Goldbach conjecture is true from the above item 1. — 3.

Comments: 10 Pages.

Download: PDF

Submission history

[v1] 2024-12-30 21:22:47
[v2] 2025-01-13 03:14:43
[v3] 2025-04-25 06:13:59
[v4] 2025-06-16 01:36:25
[v5] 2026-02-27 21:43:44

Unique-IP document downloads: 701 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus