<?xml version="1.0" encoding="UTF-8"?>

<record version="2" id="10735">
 <title>table of differences between $\lceil \sqrt{n!} \rceil^2$ and $n!$ for $0 < n < 26$</title>
 <name>TableOfDifferencesBetweenLceilSqrtnRceil2AndNFor0N26</name>
 <created>2008-07-01 19:05:55</created>
 <modified>2008-07-02 18:17:35</modified>
 <type>Data Structure</type>
<parent id="10727">Brocard's problem</parent>
 <creator id="13766" name="PrimeFan"/>
 <author id="13766" name="PrimeFan"/>
 <classification>
	<category scheme="msc" code="11A25"/>
 </classification>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here
</preamble>
 <content>There are only three known solutions to Brocard's problem, and the near misses all seem to occur early on. Notice how, for example, 3! is just 3 shy of a square (compared to 1 shy of a square which is what Brocard's problem asks for). Still, the differences between a factorial and the next higher perfect square don't make for a consistently ascending order sequence. For a few values of $n$, (such as 4, 7, 10, 24, 26, 42, 117, 135) this difference is smaller than the previous difference. In general, however, the difference between a factorial and the next perfect square widens as $n$ gets larger.

The following table gives the square root of $n!$ to six decimal places, and then the difference between the factorial and the next higher square (obtained by taking the ceiling of the square root of $n!$ and squaring that integer).

\begin{tabular}{|r|r|r|}
$n$ &amp; $\sqrt{n!}$ &amp; $\lceil \sqrt{n!} \rceil^2 - n!$ \\
1 &amp; 1.000000 &amp; 0 \\ 
2 &amp; 1.414214 &amp; 2 \\ 
3 &amp; 2.449489 &amp; 3 \\ 
4 &amp; 4.898979 &amp; 1 \\ 
5 &amp; 10.954451 &amp; 1 \\ 
6 &amp; 26.832816 &amp; 9 \\ 
7 &amp; 70.992957 &amp; 1 \\ 
8 &amp; 200.798406 &amp; 81 \\ 
9 &amp; 602.395219 &amp; 729 \\ 
10 &amp; 1904.940944 &amp; 225 \\ 
11 &amp; 6317.974359 &amp; 324 \\ 
12 &amp; 21886.105181 &amp; 39169 \\ 
13 &amp; 78911.474451 &amp; 82944 \\ 
14 &amp; 295259.701280 &amp; 176400 \\ 
15 &amp; 1143535.905864 &amp; 215296 \\ 
16 &amp; 4574143.623456 &amp; 3444736 \\ 
17 &amp; 18859677.306253 &amp; 26167684 \\ 
18 &amp; 80014834.285449 &amp; 114349225 \\ 
19 &amp; 348776576.634429 &amp; 255004929 \\ 
20 &amp; 1559776268.628498 &amp; 1158920361 \\ 
21 &amp; 7147792818.185865 &amp; 11638526761 \\ 
22 &amp; 33526120082.371712 &amp; 42128246889 \\ 
23 &amp; 160785623545.405884 &amp; 191052974116 \\ 
24 &amp; 787685471322.938354 &amp; 97216010329 \\ 
25 &amp; 3938427356614.691406 &amp; 2430400258225 \\
\end{tabular}</content>
</record>
