Number Theory

    

Proof of Erdos Conjecture about Brocard's Problem

Authors: Babacar Gueye

This article talk about Brocard's problem. This problem consist to find the solution of the diophancian equation n! + 1 = m^2. Paul Erdos conjecture that the only solutions are the Brown numbers corresponding to the values 4, 5 and 7 of n. Using here on fondamental result of number theory and studing some fonction between whitch the neperian logarithm we proof that there are any solution corresponding to a value of n greater than 10.

Comments: 4 Pages. [Corrections are made by viXra Admin to comply with the rules of viXra.org]

Download: PDF

Submission history

[v1] 2021-07-06 19:10:17

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