Question

Return true if the given non-negative number is a multiple of 3 or 5, but not both. Use the % "mod" operator -- see Introduction to Mod

A old35(3) → true
B old35(10) → true
C old35(15) → false

Answer 1

To determine if a non-negative number is exclusively a multiple of 3 or 5, use the mod operator to check if it's divisible by either, but not both, returning true only if it meets this criterion.

Step-by-step explanation:

The question asks for a function to return true if a given non-negative number is a multiple of 3 or 5, but not both. The % mod operator is used to determine if a number is divisible by another.

If a number n gives a remainder of 0 when divided by 3 (n % 3 == 0) or by 5 (n % 5 == 0), it is a multiple of that number. However, we only want numbers that are multiples of either 3 or 5, but not both, which would make them multiples of 15 (n % 15 == 0). Therefore, we return true only when (n % 3 == 0) XOR (n % 5 == 0), where XOR is the exclusive OR operator.