Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $(a_n)$ be the sequence of minimum values of the expression (depending on $\ell$):

\begin{equation*} a_n=\arg\min \bigg\lbrace ((\ell+1)j-n)!\,(n-\ell j)!\quad \text{for}\; \,\bigg\lceil\frac{n}{\ell+1}\bigg\rceil\le j\le \bigg\lfloor\frac{n}{\ell}\bigg\rfloor \bigg\rbrace % \min \big\lbrace (2j-n)!\,(n- j)!,\; \mathrm{ceil}\,\frac{n}{2}\le j\le n \big\rbrace, .\end{equation*}

My questions is two fold:

Is there a closed-form expression for $(a_n)_{n\ge \ell}$ (for a fixed $\ell$), or a way to characterize its entries? Why?

share|cite|improve this question
So, $l$ is fixed in the definition of $a_n$, and only $j$ varies? – Thomas Andrews Aug 8 '12 at 18:22
Yes, that is correct. – daniel birmajer Aug 8 '12 at 18:59
You mean closeD formula. – Mariano Suárez-Alvarez Aug 9 '12 at 16:40
@dbir The values you give for $a_n$ above look more like values of $j$. Did you mean "arg min" rather than "min"? Are there possibly ties? If so, how are you defining $j$ to be chosen? – Erick Wong Aug 9 '12 at 16:45
Also posted, without acknowledgement here or there, to MO:… – Gerry Myerson Aug 9 '12 at 23:48

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.