freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-418-factorisation-triples.english.md

id, challengeType, title

id	challengeType	title
5900f50f1000cf542c510021	5	Problem 418: Factorisation triples

Description

Let n be a positive integer. An integer triple (a, b, c) is called a factorisation triple of n if: 1 ≤ a ≤ b ≤ c a·b·c = n.

Define f(n) to be a + b + c for the factorisation triple (a, b, c) of n which minimises c / a. One can show that this triple is unique.

For example, f(165) = 19, f(100100) = 142 and f(20!) = 4034872.

Find f(43!).

Instructions

Tests

tests:
  - text: <code>euler418()</code> should return 1177163565297340400.
    testString: assert.strictEqual(euler418(), 1177163565297340400, '<code>euler418()</code> should return 1177163565297340400.');

Challenge Seed

function euler418() {
  // Good luck!
  return true;
}

euler418();

Solution

// solution required