From 42e88ac281494346686bdf6df6e492f4645c329e Mon Sep 17 00:00:00 2001 From: Alan Luo Date: Thu, 23 Sep 2021 23:48:31 -0700 Subject: [PATCH] fix(curriculum): Fix a typo (#43554) --- .../project-euler/problem-119-digit-power-sum.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md index 72ed8397d7..1db001481a 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-119-digit-power-sum.md @@ -10,7 +10,7 @@ dashedName: problem-119-digit-power-sum The number 512 is interesting because it is equal to the sum of its digits raised to some power: $5 + 1 + 2 = 8$, and $8^3 = 512$. Another example of a number with this property is $614656 = 28^4$. -We shall define an to be the $n-th$ term of this sequence and insist that a number must contain at least two digits to have a sum. +We shall define $a_n$ to be the $n-th$ term of this sequence and insist that a number must contain at least two digits to have a sum. You are given that $a_2 = 512$ and $a_{10} = 614656$.