39 lines
		
	
	
		
			640 B
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			39 lines
		
	
	
		
			640 B
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ---
 | |
| id: 5900f41f1000cf542c50ff32
 | |
| title: 'Problem 179: Consecutive positive divisors'
 | |
| challengeType: 5
 | |
| forumTopicId: 301814
 | |
| dashedName: problem-179-consecutive-positive-divisors
 | |
| ---
 | |
| 
 | |
| # --description--
 | |
| 
 | |
| Find the number of integers 1 < n < 107, for which n and n + 1 have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15.
 | |
| 
 | |
| # --hints--
 | |
| 
 | |
| `euler179()` should return 986262.
 | |
| 
 | |
| ```js
 | |
| assert.strictEqual(euler179(), 986262);
 | |
| ```
 | |
| 
 | |
| # --seed--
 | |
| 
 | |
| ## --seed-contents--
 | |
| 
 | |
| ```js
 | |
| function euler179() {
 | |
| 
 | |
|   return true;
 | |
| }
 | |
| 
 | |
| euler179();
 | |
| ```
 | |
| 
 | |
| # --solutions--
 | |
| 
 | |
| ```js
 | |
| // solution required
 | |
| ```
 |