gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(curriculum): typo in the description in Problem 29: Distinct powers (#44243)

Browse Source 
* Typo fixed in problem 29 Distinct

* Typo fixed using MathJax

* Update curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md

Co-authored-by: Krzysztof G. <60067306+gikf@users.noreply.github.com>

Co-authored-by: Krzysztof G. <60067306+gikf@users.noreply.github.com>
This commit is contained in:
David Rivera Morales
2021-11-24 12:10:54 -06:00
committed by GitHub
parent d409194dd8
commit cf9f06918a
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-29-distinct-powers.md
View File

@ -8,7 +8,7 @@ dashedName: problem-29-distinct-powers
# --description-- # --description--
Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5: Consider all integer combinations of $a^b$ for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
<div style='padding-left: 4em;'> <div style='padding-left: 4em;'>
2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br> 2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32 <br>
@ -23,7 +23,7 @@ If they are then placed in numerical order, with any repeats removed, we get the
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125 4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
</div> </div>
How many distinct terms are in the sequence generated by `ab` for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`? How many distinct terms are in the sequence generated by $a^b$ for 2 ≤ `a` ≤ `n` and 2 ≤ `b` ≤ `n`?
# --hints-- # --hints--