A museum gives free entry to visitors who are students or under 12. A 10-year-old student gets in free, so does a 20-year-old student, and so does a 9-year-old who isn't in school. Only someone who is neither a student nor under 12 pays. The rule is S∨U, and it fails in exactly one situation: when both parts are false.
In a truth table with four rows, P∨Q is true in three of them, TT, TF and FT; only FF makes it false. That is the mirror image of 'and', which is true in a single row. Each extra 'or' adds ways to be true: 'n is divisible by 2 or by 3' holds for 2, 3, 4, 6, 8, 9 and 10 among the numbers 1 to 10, more than either condition alone.
Everyday speech often uses an exclusive 'or'. 'The meal comes with soup or salad' means one, not both. That is a different connective, exclusive or (XOR), which is false in the TT row. Mathematics uses the inclusive 'or' by default, so '6 is even or 6 is divisible by 3' is true even though both parts are true. If a problem means 'exactly one', it has to say so.
Think of it like this. An inclusive 'or' is a room light with two switches wired in parallel: the light is on if either switch is up, and still on if both are. The room is dark only when both switches are down. An exclusive 'or' behaves like a staircase light, where flipping both switches turns it off again.
Core idea. A disjunction P or Q is false only when both parts are false.