From a5840f57a4225212d773e481d5440dd535362cb4 Mon Sep 17 00:00:00 2001
From: Jeremy L Thompson <25011573+jeremylt@users.noreply.github.com>
Date: Sat, 16 Jan 2021 12:57:38 -0700
Subject: [PATCH] Update Description of Stern-Brocot Challenge (#40686)

* fix: update description of target function

* fix: include note about 1 based indexing
---
 .../rosetta-code/stern-brocot-sequence.md                       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
index e8acb84c3c..219db4002c 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/stern-brocot-sequence.md
@@ -36,7 +36,7 @@ For this task, the Stern-Brocot sequence is to be generated by an algorithm simi
 
 # --instructions--
 
-Create a function that returns the $ n^{th} $ member of the sequence using the method outlined above.
+Create a function that returns the position in the Stern-Brocot sequence at which $ n $ is first encountered, where the sequence is generated with the method outlined above. Note that this sequence uses 1 based indexing.
 
 # --hints--