* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
		
			
				
	
	
	
		
			1.3 KiB
		
	
	
	
	
	
	
	
			
		
		
	
	
			1.3 KiB
		
	
	
	
	
	
	
	
id, challengeType, title
| id | challengeType | title | 
|---|---|---|
| 5900f4371000cf542c50ff49 | 5 | Problem 202: Laserbeam | 
Description
Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.
In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?
Instructions
Tests
tests:
  - text: <code>euler202()</code> should return 1209002624.
    testString: assert.strictEqual(euler202(), 1209002624, '<code>euler202()</code> should return 1209002624.');
Challenge Seed
function euler202() {
  // Good luck!
  return true;
}
euler202();
Solution
// solution required