Whatâ€™s the time complexity of checking if a number is prime using the trial division method?
The time complexity is O(sqrt(n)) because you only need to check divisibility up to the square root of the number.
Great! Youâ€™ve correctly identified the time complexity of the trial division method.
Can you think of an alternative method that could improve the efficiency of prime number checking?