Solomon Needs To Justify The Formula

Introduction: Why Solomon Must Justify the Formula

When a mathematician or scientist presents a new relationship, the credibility of the formula hinges on a clear, logical justification. And in the case of Solomon’s formula—a powerful tool used in combinatorial optimization and game theory—providing a rigorous proof is not just an academic exercise; it is essential for building trust, enabling practical application, and guiding further research. This article explains what Solomon’s formula is, why justification matters, and walks you through the step‑by‑step process of constructing a solid proof. Whether you are a student, researcher, or industry professional, understanding how to justify the formula will empower you to apply it confidently and explain it convincingly to others.

What Is Solomon’s Formula?

Solomon’s formula appears in several contexts, but the most widely referenced version is the expected waiting time for the “secretary problem” (also known as the optimal stopping problem). The formula states that the optimal stopping rule is to reject the first r = ⌊n/e⌋ candidates and then select the next candidate who is better than all previous ones. The probability of selecting the best candidate under this rule is:

[ P_{\text{optimal}}(n)=\frac{r}{n}\sum_{k=r+1}^{n}\frac{1}{k-1} \approx \frac{1}{e} ]

where n is the total number of applicants and e is Euler’s number (≈ 2.71828). The justification of this formula involves probability theory, combinatorics, and asymptotic analysis.

Why Justification Is Crucial

Establishes Validity – A formula without proof is a conjecture. Formal justification confirms that the result holds for all admissible values of n.
Enables Extension – Once the core proof is understood, researchers can adapt the method to variations (e.g., multiple hires, unknown n, or weighted preferences).
Builds Confidence in Decision‑Making – Practitioners using the formula for hiring, online auctions, or real‑time bidding need assurance that the underlying mathematics is sound.
Facilitates Teaching – Clear justification provides a teaching roadmap, helping students see how abstract concepts translate into concrete results.

Step‑by‑Step Justification of Solomon’s Formula

Step 1: Define the Decision Process

Let the set of applicants be ( {1,2,\dots ,n} ) where a higher number indicates a better rank.
The decision maker observes candidates sequentially and must either accept the current candidate or reject and continue.
The goal: maximise the probability of selecting the absolute best candidate (rank = n).

Step 2: Introduce the Stopping Rule

The rule “reject the first r candidates, then pick the first subsequent candidate who beats all previous ones” can be expressed mathematically:

[ \text{Select candidate } i \text{ if } i>r \text{ and } X_i = \max{X_1,\dots ,X_i} ]

where ( X_i ) denotes the rank of the i‑th candidate.

Step 3: Compute the Success Probability

For the rule to succeed, two events must occur simultaneously:

The best candidate appears after the observation window (i.e., its position (k) satisfies (k>r)).
All candidates before position k are worse than the best, which is automatically true because the best is unique.
The best candidate is the first record after r, meaning no earlier candidate after r outperforms all preceding ones.

The probability that the best candidate is at position k is (1/n). Think about it: conditional on this, the probability that it is the first record after r equals the probability that among the first k‑1 candidates, the highest rank is among the first r positions. This probability is (r/(k-1)).

[ P(r,n)=\sum_{k=r+1}^{n}\frac{1}{n}\cdot\frac{r}{k-1} =\frac{r}{n}\sum_{k=r+1}^{n}\frac{1}{k-1} ]

which is precisely Solomon’s formula.

Step 4: Optimise r

To maximise (P(r,n)) with respect to r, treat r as a continuous variable and differentiate the asymptotic approximation. Replace the sum by an integral:

[ \sum_{k=r+1}^{n}\frac{1}{k-1}\approx\int_{r}^{n}\frac{dx}{x}= \ln\frac{n}{r} ]

Thus

[ P(r,n)\approx\frac{r}{n}\ln\frac{n}{r} ]

Set the derivative with respect to r to zero:

[ \frac{d}{dr}\Bigl(\frac{r}{n}\ln\frac{n}{r}\Bigr)=\frac{1}{n}\Bigl(\ln\frac{n}{r}-1\Bigr)=0 ]

which yields (\ln\frac{n}{r}=1) → (\frac{n}{r}=e) → (r\approx\frac{n}{e}). Since r must be an integer, we take (r=\lfloor n/e\rfloor).

Step 5: Show Asymptotic Success Rate

Substituting (r=n/e) into the approximation:

For more on this topic, read our article on world war ii mobilization affected women by or check out why was a stain added to the cheek cells.

[ P_{\text{optimal}}(n)\approx\frac{1}{e}\ln e =\frac{1}{e}\approx0.3679 ]

Hence, no strategy can exceed a success probability of about 36.79 %, and Solomon’s rule attains this bound asymptotically.

Step 6: Verify Edge Cases

Small n: Direct calculation for (n=1,2,3) confirms the formula matches exhaustive enumeration.
Large n: Monte‑Carlo simulations (e.g., 10⁶ trials) converge to the theoretical 1/e value, reinforcing the asymptotic argument.

Scientific Explanation Behind the Formula

Probability Theory Perspective

The problem is a classic example of order statistics. This leads to the event “the best candidate is the first record after a given cutoff” hinges on the distribution of record times, which follow a harmonic series—hence the appearance of the sum (\sum 1/(k-1)). This series grows logarithmically, linking directly to the natural logarithm in the continuous approximation.

Information Theory Angle

Choosing a stopping point r partitions the information stream into “exploration” and “exploitation” phases. The optimal split balances the entropy (uncertainty) of the unseen portion against the gain from having observed enough data to set a reliable benchmark. The factor (1/e) emerges as the point where the marginal benefit of waiting equals the marginal cost of losing future opportunities—mirroring the e‑folding time concept in exponential decay.

Game‑Theoretic Insight

From a game‑theoretic standpoint, the decision maker faces a zero‑sum game against nature, which randomly orders the candidates. The Nash equilibrium strategy is exactly Solomon’s stopping rule, guaranteeing the highest guaranteed payoff (probability of success) regardless of nature’s randomisation.

Frequently Asked Questions

Q1: Does Solomon’s formula work if the number of candidates n is unknown?
A1: The classic proof assumes a known n. For unknown n, a relative‑threshold strategy—stopping when a candidate exceeds a fixed proportion of observed ranks—approximates the same 1/e success rate, but the exact formula changes.

Q2: Can the formula be extended to select the top‑k candidates?
A2: Yes. The “multiple‑choice secretary problem” modifies the stopping rule to allow k selections. The success probability involves binomial coefficients and the harmonic series, but the optimal cutoff still scales with n/e for each selection.

Q3: How sensitive is the success probability to rounding r to the nearest integer?
A3: The probability curve is relatively flat around the optimum; rounding up or down changes the success rate by less than 0.5 % for typical values of n (≥ 50).

Q4: Is there a closed‑form expression for the sum (\sum_{k=r+1}^{n} 1/(k-1))?
A4: The sum equals the difference of harmonic numbers: (H_{n-1} - H_{r}), where (H_m = \sum_{i=1}^{m} 1/i). This representation is useful for exact calculations.

Q5: What practical fields use Solomon’s formula?
A5: Human resources (online hiring), financial trading (optimal order execution), real‑time bidding for ad placements, and even animal foraging models employ the same stopping‑rule logic.

Common Pitfalls When Justifying the Formula

Pitfall	Why It Happens	How to Avoid
Treating the sum as a simple arithmetic series	Overlooking the harmonic nature	Recognise the series as harmonic and use (H_n) notation
Ignoring integer constraints on r	Assuming continuous optimisation only	After finding (r\approx n/e), explicitly round and test both floor and ceiling values
Skipping edge‑case verification	Confidence in asymptotics leads to neglect of small n	Perform brute‑force enumeration for (n\le5) to confirm the formula holds
Misinterpreting “record”	Confusing “record high” with “absolute best”	Emphasise that a record after the cutoff must be the global maximum for success
Over‑reliance on simulation	Simulations can mislead if sample size is low	Combine analytical proof with large‑scale Monte‑Carlo checks for robustness

Conclusion: Mastering the Justification Strengthens Application

Solomon’s formula is more than a neat probability result; it encapsulates a principled strategy for optimal stopping under uncertainty. By defining the decision process, deriving the success probability, optimising the cutoff, and validating through both analytical and empirical means, you produce a rigorous justification that stands up to academic scrutiny and real‑world demands.

Remember that a solid proof does three things simultaneously:

Confirms correctness – eliminates doubt about the formula’s validity.
Enables adaptation – provides a template for extending the result to new scenarios.
Builds credibility – gives stakeholders confidence when the formula guides critical decisions.

Whether you are writing a research paper, preparing a lecture, or implementing an algorithm in a hiring platform, the ability to justify Solomon’s formula will distinguish your work as reliable, insightful, and ready for impact. Embrace the logical steps outlined above, and you’ll not only understand the mathematics but also convey its power to anyone who needs to trust the numbers.