62 lines
		
	
	
		
			1.8 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			62 lines
		
	
	
		
			1.8 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ---
 | |
| id: 5900f38a1000cf542c50fe9d
 | |
| challengeType: 5
 | |
| title: 'Problem 30: Digit n powers'
 | |
| videoUrl: ''
 | |
| localeTitle: 'Problema 30: dígitos y potencias'
 | |
| ---
 | |
| 
 | |
| ## Description
 | |
| <section id="description"> Sorprendentemente, solo hay tres números que pueden escribirse como la suma de las cuartas potencias de sus dígitos: 1634 = 1 <sup>4</sup> + 6 <sup>4</sup> + 3 <sup>4</sup> + 4 <sup>4</sup> 8208 = 8 <sup>4</sup> + 2 <sup>4</sup> + 0 <sup>4</sup> + 8 <sup>4</sup> 9474 = 9 <sup>4</sup> + 4 <sup>4</sup> + 7 <sup>4</sup> + 4 <sup>4</sup> Como 1 = 1 <sup>4</sup> no es una suma que no está incluida. La suma de estos números es 1634 + 8208 + 9474 = 19316. Encuentra la suma de todos los números que se pueden escribir como la suma de n potencias de sus dígitos. </section>
 | |
| 
 | |
| ## Instructions
 | |
| <section id="instructions">
 | |
| </section>
 | |
| 
 | |
| ## Tests
 | |
| <section id='tests'>
 | |
| 
 | |
| ```yml
 | |
| tests:
 | |
|   - text: <code>digitnPowers(2)</code> debe devolver 0.
 | |
|     testString: 'assert(digitnPowers(2) == 0, "<code>digitnPowers(2)</code> should return 0.");'
 | |
|   - text: <code>digitnPowers(3)</code> debe devolver 1301.
 | |
|     testString: 'assert(digitnPowers(3) == 1301, "<code>digitnPowers(3)</code> should return 1301.");'
 | |
|   - text: <code>digitnPowers(4)</code> debe devolver 19316.
 | |
|     testString: 'assert(digitnPowers(4) == 19316, "<code>digitnPowers(4)</code> should return 19316.");'
 | |
|   - text: <code>digitnPowers(5)</code> debe devolver 443839.
 | |
|     testString: 'assert(digitnPowers(5) == 443839, "<code>digitnPowers(5)</code> should return 443839.");'
 | |
| 
 | |
| ```
 | |
| 
 | |
| </section>
 | |
| 
 | |
| ## Challenge Seed
 | |
| <section id='challengeSeed'>
 | |
| 
 | |
| <div id='js-seed'>
 | |
| 
 | |
| ```js
 | |
| function digitnPowers(n) {
 | |
|   // Good luck!
 | |
|   return n;
 | |
| }
 | |
| 
 | |
| digitnPowers(5);
 | |
| 
 | |
| ```
 | |
| 
 | |
| </div>
 | |
| 
 | |
| 
 | |
| 
 | |
| </section>
 | |
| 
 | |
| ## Solution
 | |
| <section id='solution'>
 | |
| 
 | |
| ```js
 | |
| // solution required
 | |
| ```
 | |
| </section>
 |