No
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
⠀
Okay why not?
To disprove an “all” statement in math, you only need one counterexample. If we can find an integer that is simultaneously divisible by 2 and prime, then we can disprove the entire statement.
Since 2 is divisible by 2 AND is prime, then we can say the statement “All Integers Divisible by 2 Are NOT Prime” is FALSE.
Carson Conjectures 
Leave a comment