* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
		
			
				
	
	
	
		
			981 B
		
	
	
	
	
	
	
	
			
		
		
	
	
			981 B
		
	
	
	
	
	
	
	
id, challengeType, title
| id | challengeType | title | 
|---|---|---|
| 5900f4531000cf542c50ff66 | 5 | Problem 231: The prime factorisation of binomial coefficients | 
Description
Find the sum of the terms in the prime factorisation of 20000000C15000000.
Instructions
Tests
tests:
  - text: <code>euler231()</code> should return 7526965179680.
    testString: assert.strictEqual(euler231(), 7526965179680, '<code>euler231()</code> should return 7526965179680.');
Challenge Seed
function euler231() {
  // Good luck!
  return true;
}
euler231();
Solution
// solution required