Number Theory

    

Why Was that Difficult to Prove the Goldbach Conjecture?

Authors: Óscar E. Chamizo Sánchez

An ancient conjecture, named after its discoverer as Goldbach conjecture [1][2], that is to say, every even number greater than 2 can be represented by the sum of two primes, is a simple and intractable statement that has been torturing mathematicians for more than 250 years. We wonder if the divide et impera method, so useful in programming and algorithmics, could provide some service here. The goal is simplify and separate the whole problem into three independent and fairly manegeable subproblems. An approach that, as far as I know, has not been tested before

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2026-02-18 13:18:57

Unique-IP document downloads: 133 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