From 1b8f006669441436ee0a40f7ece2f3785a80449a Mon Sep 17 00:00:00 2001
From: Dhananjay Mahajan
 <78074728+Dhananjaymahajan2001@users.noreply.github.com>
Date: Tue, 30 Nov 2021 01:27:41 +0530
Subject: [PATCH] fix(curriculum): separate tag into two (#44281)

---
 .../project-euler/problem-124-ordered-radicals.md               | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
index 5376e15f598..08779282a3d 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-124-ordered-radicals.md
@@ -8,7 +8,7 @@ dashedName: problem-124-ordered-radicals
 
 # --description--
 
-The radical of $n, rad(n)$, is the product of the distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$.
+The radical of $n$, $rad(n)$, is the product of the distinct prime factors of $n$. For example, $504 = 2^3 × 3^2 × 7$, so $rad(504) = 2 × 3 × 7 = 42$.
 
 If we calculate $rad(n)$ for $1 ≤ n ≤ 10$, then sort them on $rad(n)$, and sorting on $n$ if the radical values are equal, we get: