Data Structures and Algorithms

    

Classification of Composite Numbers and Proof of the Binary Goldbach Conjecture

Authors: Samuel Bonaya Buya

This research introduces a novel classification system for composite numbers based on their least common prime factor (LCPF). The goal is to develop an efficient sieve for distinguishing prime numbers from composite numbers. A mathematical framework is presented to define logical formulae for different subsets of composite numbers. Additionally, a new formula for estimating the number of primes up to a given value is proposed. The paper also explores a graphical approach to factorization,providing an alternative method for decomposing composite numbers into their prime components.Several examples are presented to illustrate the classification system in action. Finally the new classification system of composite numbers will be used to prove the Binary Goldbach conjecture.

Comments: 34 Pages.

Download: PDF

Submission history

[v1] 2025-02-18 21:20:45
[v2] 2025-02-20 23:35:08
[v3] 2025-03-13 21:14:31

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