1.3 KiB
1.3 KiB
id | challengeType | title |
---|---|---|
5900f5231000cf542c510034 | 5 | Problem 438: Integer part of polynomial equation's solutions |
Description
Consider the following two conditions: x1, ..., xn are all real. If x1, ..., xn are sorted, ⌊xi⌋ = i for 1 ≤ i ≤ n. (⌊·⌋: floor function.)
In the case of n = 4, there are 12 n-tuples of integers which satisfy both conditions. We define S(t) as the sum of the absolute values of the integers in t. For n = 4 we can verify that ∑S(t) = 2087 for all n-tuples t which satisfy both conditions.
Find ∑S(t) for n = 7.
Instructions
Tests
tests:
- text: <code>euler438()</code> should return 2046409616809.
testString: assert.strictEqual(euler438(), 2046409616809, '<code>euler438()</code> should return 2046409616809.');
Challenge Seed
function euler438() {
// Good luck!
return true;
}
euler438();
Solution
// solution required