* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
		
			
				
	
	
	
		
			986 B
		
	
	
	
	
	
	
	
			
		
		
	
	
			986 B
		
	
	
	
	
	
	
	
id, challengeType, title
| id | challengeType | title | 
|---|---|---|
| 5900f52c1000cf542c51003f | 5 | Problem 448: Average least common multiple | 
Description
Let S(n)=∑A(k) for 1≤k≤n. S(100)=122726.
Find S(99999999019) mod 999999017.
Instructions
Tests
tests:
  - text: <code>euler448()</code> should return 106467648.
    testString: assert.strictEqual(euler448(), 106467648, '<code>euler448()</code> should return 106467648.');
Challenge Seed
function euler448() {
  // Good luck!
  return true;
}
euler448();
Solution
// solution required