Citizendia
Your Ad Here

Brocard's problem asks to find integer values of n for which

n! + 1 = m2,

where n! is the factorial. The integers (from the Latin integer, literally "untouched" hence "whole" the word entire comes from the same origin but via French Definition The factorial function is formally defined by n!=\prod_{k=1}^n k It was posed by H. Brocard in a pair of articles in 1876 and 1885, and independently in 1913 by Ramanujan.

Contents

Brown numbers

Pairs of the numbers (m, n) that solve Brocard's problem are called Brown numbers. There are only three known pairs of Brown numbers:

(4,5), (5,11), and (7,71).

Paul Erdős conjectured that no other solutions exist. Paul Erdős ( Hungarian: Erdős Pál, in English occasionally Paul Erdos or Paul Erdös, March 26, 1913 &ndash Most recently Berndt & Galway (2000) performed calculations for n up to 109 and found no further solutions.

Variants of the problem

Dabrowski (1996) has shown that it would follow from the abc conjecture that

n! + A = k2

has only finitely many solutions, for any given integer A. The abc conjecture is a Conjecture in Number theory. It was first proposed by Joseph Oesterlé and David Masser in 1985

References

External links

This number theory-related article is a stub. Number theory is the branch of Pure mathematics concerned with the properties of Numbers in general and Integers in particular as well as the wider classes You can help Wikipedia by expanding it.

© 2009 citizendia.org; parts available under the terms of GNU Free Documentation License, from http://en.wikipedia.org
Dapyx Software network: MP3 Explorer | Ebook Manager | Zenithic