* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
		
			
				
	
	
	
		
			1.0 KiB
		
	
	
	
	
	
	
	
			
		
		
	
	
			1.0 KiB
		
	
	
	
	
	
	
	
id, challengeType, title
| id | challengeType | title | 
|---|---|---|
| 5900f4fd1000cf542c51000f | 5 | Problem 401: Sum of squares of divisors | 
Description
Let sigma2(n) represent the sum of the squares of the divisors of n. Thus sigma2(6)=50.
Let SIGMA2 represent the summatory function of sigma2, that is SIGMA2(n)=∑sigma2(i) for i=1 to n. The first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.
Find SIGMA2(1015) modulo 109.
Instructions
Tests
tests:
  - text: <code>euler401()</code> should return 281632621.
    testString: assert.strictEqual(euler401(), 281632621, '<code>euler401()</code> should return 281632621.');
Challenge Seed
function euler401() {
  // Good luck!
  return true;
}
euler401();
Solution
// solution required