* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
		
			
				
	
	
		
			73 lines
		
	
	
		
			1.8 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			73 lines
		
	
	
		
			1.8 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ---
 | |
| id: 5900f5461000cf542c510058
 | |
| challengeType: 5
 | |
| title: 'Problem 473: Phigital number base'
 | |
| ---
 | |
| 
 | |
| ## Description
 | |
| <section id='description'>
 | |
| Let $\varphi$ be the golden ratio: $\varphi=\frac{1+\sqrt{5}}{2}.$
 | |
| Remarkably it is possible to write every positive integer as a sum of powers of $\varphi$ even if we require that every power of $\varphi$ is used at most once in this sum.
 | |
| Even then this representation is not unique.
 | |
| We can make it unique by requiring that no powers with consecutive exponents are used and that the representation is finite.
 | |
| E.g:
 | |
| $2=\varphi+\varphi^{-2}$ and $3=\varphi^{2}+\varphi^{-2}$
 | |
| 
 | |
| 
 | |
| To represent this sum of powers of $\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start.
 | |
| We call this the representation in the phigital numberbase.
 | |
| So $1=1_{\varphi}$, $2=10.01_{\varphi}$, $3=100.01_{\varphi}$ and $14=100100.001001_{\varphi}$.
 | |
| The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not. (the phigital point is not the middle character).
 | |
| 
 | |
| 
 | |
| The sum of the positive integers not exceeding 1000 whose phigital representation is palindromic is 4345.
 | |
| 
 | |
| 
 | |
| Find the sum of the positive integers not exceeding $10^{10}$ whose phigital representation is palindromic.
 | |
| </section>
 | |
| 
 | |
| ## Instructions
 | |
| <section id='instructions'>
 | |
| 
 | |
| </section>
 | |
| 
 | |
| ## Tests
 | |
| <section id='tests'>
 | |
| 
 | |
| ```yml
 | |
| tests:
 | |
|   - text: <code>euler473()</code> should return 35856681704365.
 | |
|     testString: assert.strictEqual(euler473(), 35856681704365, '<code>euler473()</code> should return 35856681704365.');
 | |
| 
 | |
| ```
 | |
| 
 | |
| </section>
 | |
| 
 | |
| ## Challenge Seed
 | |
| <section id='challengeSeed'>
 | |
| 
 | |
| <div id='js-seed'>
 | |
| 
 | |
| ```js
 | |
| function euler473() {
 | |
|   // Good luck!
 | |
|   return true;
 | |
| }
 | |
| 
 | |
| euler473();
 | |
| ```
 | |
| 
 | |
| </div>
 | |
| 
 | |
| 
 | |
| 
 | |
| </section>
 | |
| 
 | |
| ## Solution
 | |
| <section id='solution'>
 | |
| 
 | |
| ```js
 | |
| // solution required
 | |
| ```
 | |
| </section>
 |