Intereting Posts

Prove the inequality $\sqrt\frac{a}{a+8} + \sqrt\frac{b}{b+8} +\sqrt\frac{c}{c+8} \geq 1$ with the constraint $abc=1$
How to define Homology Functor in an arbitrary Abelian Category?
Minimizing $\sum_{i=1}^n \max(|x_i – x|, |y_i – y|)$ – Sum of Max of Absolute Values
Contour integral – $\int_C \frac{\log z}{z-z_0} dz$ – Contradiction
Is a trigonometric function applied to a rational multiple of $\pi$ always algebraic?
Estimate the size of a set from which a sample has been equiprobably drawn?
Estimate variance given a sample of size one (7th Kolmogorov Student Olympiad)
irrationality of $\sqrt{2}^{\sqrt{2}}$.
How to evaluate these integrals by hand
For which values this integral converge?
How do I evaluate this integral?
Calculating the limit of the derivative of a sum of digamma functions
Proving Cantor's theorem
Finding the Total Curvature of Plane Curves
Minimum of $n$? $123456789x^2 – 987654321y^2 =n$ ($x$,$y$ and $n$ are positive integers)

If the product of $x$ positive integers is $n!$ What is the smallest

possible value their sum can have?

I was wondering what could be the most efficient strategy to solve this problem for sufficiently small values of $x$ and $n$.

For example, if $x=4$ and $n = 10$,the smallest sum would be that of $40,45,48,42$ such that $$40 \times 45 \times 48 \times 42 = 10!$$ and hence that required answer is $$40+45+48+42=175$$However,I used pure brute-force approach to get this result,I am inquisitive about a general strategy for this problem.

- Prove: $\cot x=\sin x\,\sin\left(\frac{\pi}{2}-x\right)+\cos^2x\,\cot x$
- How many ways to arrange the flags?
- proof using the mathematical induction
- Find the sum of the series $\sum^{\infty}_{n=1} \frac{1}{(n+1)(n+2)(n+3) \cdots (n+k)}$
- Proving $ { 2n \choose n } = 2^n \frac{ 1 \cdot 3 \cdot 5 \cdots (2n-1)}{n!} $
- A hyperbola as a constant difference of distances

- Is there a “nice” formula for $\sum_{d|n}\mu(d)\phi(d)$?
- Origin of well-ordering proof of uniqueness in the FToArithmetic
- Prove that $x^3 \equiv x \bmod 6$ for all integers $x$
- Non-additive asymptotic upper density: $\mathsf{d}^\star(A\cup B) \neq \mathsf{d}^\star(A)+\mathsf{d}^\star(B)$
- I need some help with a GCD and LCM's Problem
- Proving $ { 2n \choose n } = 2^n \frac{ 1 \cdot 3 \cdot 5 \cdots (2n-1)}{n!} $
- Divisibility Rules for Bases other than $10$
- Calculating the Modular Multiplicative Inverse without all those strange looking symbols
- Prove that all even integers $n \neq 2^k$ are expressible as a sum of consecutive positive integers
- Why does this inequality hold: $\sum\limits_{cyc}\frac{1}{{{a^3} + {b^3} + abc}} \le \frac{1}{{abc}}$

Well, the general idea is maybe not so bad. Just as a d-dimensional cube has the minimal surface area for a given volume of d-dimensional parallelopipeds (rectangular d-prisms in particular), we would want our numbers to be as close in value as possible.

The likely idea is that you would still take the prime factorization of $n!$, and then try to group the primes into $x$ different stacks that all have as close to the same product as possible.

One might ask: how does one go about finding out which primes are in which stacks? That’s a great question. It sounds to me to be roughly as computationally challenging as the knapsack problem (e.g. wiki), which is NP-complete. But that might not be true. The advantage is that factorials behave sort of nicely, so ‘most’ factors should be able to be divided fairly equally for large n, low x. It’s the few ‘large’ primes in the factorization that can mess everything up.

But at least this gives the brute forcing a direction of attack. This started as a comment but grew to an incomplete answer. But I’ll think more on it and see what comes up.

- Show $2(x+y+z)-xyz\leq 10$ if $x^2+y^2+z^2=9$
- Zero image of an element in the direct limit of modules
- Complex analysis prerequisites
- The Riesz representation theorem on locally compact Hausdorff spaces-alternate proof
- Geometric visualization of covector?
- Prove that the additive group $ℚ$ is not isomorphic with the multiplicative group $ℚ^*$.
- Semi-partition or pre-partition
- Funny identities
- How a principal bundle and the associated vector bundle determine each other
- finding a function with given boundary conditions
- Is $0.1010010001000010000010000001 \ldots$ transcendental?
- How do I transform the equation based on this condition?
- Primitive Permutation Group with Subdegree 3
- Proving $|\sin x – \sin y| < |x – y|$
- A problem For the boundary value problem, $y''+\lambda y=0$, $y(-π)=y(π)$ , $y’(-π)=y’(π)$