Question: 
Write a python function to find the index of smallest triangular number with n digits.


Model's Code:
def find_Index(n):
    triangular_number_index = 1
    triangular_number = 1
    
    while True:
        triangular_number = (triangular_number_index * (triangular_number_index + 1)) // 2
        if len(str(triangular_number)) >= n:
            return triangular_number_index
        triangular_number_index += 1



Sample Correct Code:
import math 
def find_Index(n): 
    x = math.sqrt(2 * math.pow(10,(n - 1))); 
    return round(x); 


Asserts:
assert find_Index(2) == 4
assert find_Index(3) == 14
assert find_Index(4) == 45


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 739 of 974: 560/739 (75.77807848443842%): success