The Prime Breaker

Early Exit

Sometimes you don't need to finish the whole loop. If you find what you're looking for (like a number that divides perfectly), the break keyword allows you to shatter the loop and leave immediately.

The Assignment

Your function receives a parameter named target.

1. Declare a let variable divisor and initialize it to 2.
2. Write a while loop that runs as long as divisor is less than target.
3. Inside the loop:
   • Check if target is divisible by divisor (target % divisor === 0).
   • If true: Print "Composite number found, stopping." and use break.
   • Otherwise: Increment divisor by 1.
4. After the loop:
   • If divisor is equal to target, print: "Prime number."