* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
		
			
				
	
	
	
		
			1.1 KiB
		
	
	
	
	
	
	
	
			
		
		
	
	
			1.1 KiB
		
	
	
	
	
	
	
	
id, challengeType, title
| id | challengeType | title | 
|---|---|---|
| 5900f4931000cf542c50ffa5 | 5 | Problem 294: Sum of digits - experience #23 | 
Description
For a positive integer n, define S(n) as the number of positive integers k < 10n with the following properties : k is divisible by 23 and d(k) = 23.
You are given that S(9) = 263626 and S(42) = 6377168878570056.
Find S(1112) and give your answer mod 109.
Instructions
Tests
tests:
  - text: <code>euler294()</code> should return 789184709.
    testString: assert.strictEqual(euler294(), 789184709, '<code>euler294()</code> should return 789184709.');
Challenge Seed
function euler294() {
  // Good luck!
  return true;
}
euler294();
Solution
// solution required