Logicmedium
0:00.0

A set SS contains all integers nn such that 1≤n≤1001 \leq n \leq 100. Let A={n∈S∣n is divisible by 2}A = \{n \in S \mid n \text{ is divisible by } 2\} and B={n∈S∣n is divisible by 3}B = \{n \in S \mid n \text{ is divisible by } 3\}. How many elements are in A∪BA \cup B?