Write 12 as a product of three primes
2 answers:
You might be interested in
<h3>Refer to the diagram below</h3>
- Draw one smaller circle inside another larger circle. Make sure the circle's edges do not touch in any way. Based on this diagram, you can see that any tangent of the smaller circle cannot possibly intersect the larger circle at exactly one location (hence that inner circle tangent cannot be a tangent to the larger circle). So that's why there are no common tangents in this situation.
- Start with the drawing made in problem 1. Move the smaller circle so that it's now touching the larger circle at exactly one point. Make sure the smaller circle is completely inside the larger one. They both share a common point of tangency and therefore share a common single tangent line.
- Start with the drawing made for problem 2. Move the smaller circle so that it's partially outside the larger circle. This will allow for two different common tangents to form.
- Start with the drawing made for problem 3. Move the smaller circle so that it's completely outside the larger circle, but have the circles touch at exactly one point. This will allow for an internal common tangent plus two extra external common tangents.
- Pull the two circles completely apart. Make sure they don't touch at all. This will allow us to have four different common tangents. Two of those tangents are internal, while the others are external. An internal tangent cuts through the line that directly connects the centers of the circles.
Refer to the diagram below for examples of what I mean.
Answer:
(i) A truth table shows how the truth or falsity of a compound statement depends on the truth or falsity of the simple statements from which it's constructed.
Since A ∧ B (the symbol ∧ means A and B) is true only when both A and B are true, its negation A NAND B is true as long as one of A or B is false.
Since A ∨ B (the symbol ∨ means A or B) is true when one of A or B is true, its negation A NOR B is only true when both A and B are false.
Below are the truth tables for NAND and NOR connectives.
(ii) To show that (A NAND B)∨(A NOR B) is equivalent to (A NAND B) we build the truth table.
Since the last column (A NAND B)∨(A NOR B) is equal to (A NAND B) it follows that the statements are equivalent.
(iii) To show that (A NAND B)∧(A NOR B) is equivalent to (A NOR B) we build the truth table.
Since the last column (A NAND B)∧(A NOR B) is equal to (A NOR B) it follows that the statements are equivalent.
