freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-3-largest-prime-factor.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f36f1000cf542c50fe82	5	Problem 3: Largest prime factor

Description

undefined

Instructions

undefined

Tests

tests:
  - text: ''
    testString: 'assert.strictEqual(largestPrimeFactor(2), 2, "<code>largestPrimeFactor(2)</code> should return 2.");'
  - text: ''
    testString: 'assert.strictEqual(largestPrimeFactor(3), 3, "<code>largestPrimeFactor(3)</code> should return 3.");'
  - text: ''
    testString: 'assert.strictEqual(largestPrimeFactor(5), 5, "<code>largestPrimeFactor(5)</code> should return 5.");'
  - text: ''
    testString: 'assert.strictEqual(largestPrimeFactor(7), 7, "<code>largestPrimeFactor(7)</code> should return 7.");'
  - text: ''
    testString: 'assert.strictEqual(largestPrimeFactor(13195), 29, "<code>largestPrimeFactor(13195)</code> should return 29.");'
  - text: ''
    testString: 'assert.strictEqual(largestPrimeFactor(600851475143), 6857, "<code>largestPrimeFactor(600851475143)</code> should return 6857.");'

Challenge Seed

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

largestPrimeFactor(13195);

Solution

// solution required