Question

Find the prime factorisation of the smallest numbers of 3-digits​

Answer 1

$\huge\mathbb{\underline{Answer:-}}$

➢Approach:

• Check if the number is divisible by 2 or not.
• Iterate from i = 3 to sqrt(N) and making a jump of 2.
• If any of the numbers divide N then it is the smallest prime divisor.
• If none of them divide, then N is the answer.

Answer 2

Answer:

plz mark it as brainliest answer soon