Update Description of Stern-Brocot Challenge (#40686)
* fix: update description of target function * fix: include note about 1 based indexing
This commit is contained in:
		
				
					committed by
					
						
						GitHub
					
				
			
			
				
	
			
			
			
						parent
						
							bab54ad619
						
					
				
				
					commit
					a5840f57a4
				
			@@ -36,7 +36,7 @@ For this task, the Stern-Brocot sequence is to be generated by an algorithm simi
 | 
				
			|||||||
 | 
					
 | 
				
			||||||
# --instructions--
 | 
					# --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--
 | 
					# --hints--
 | 
				
			||||||
 | 
					
 | 
				
			||||||
 
 | 
				
			|||||||
		Reference in New Issue
	
	Block a user