Answer:
Does the answer help you?
The binary connective of implication ⇒ is defined as (A ⇒ B) ⇔ ((¬ A) ∨ B). It can be read « A implies B », « A is a sufficient condition for B », or « B is a necessary condition for A ».
What is connective?
Connective is function, or the symbol representing a function, which corresponds to English conjunctions such as "and," "or," "not," etc. that takes one or more truth values as input and returns a single truth value as output.
What is logical connective?
A Logical Connective is a symbol which is used to connect two or more propositional or predicate logics in such a manner that resultant logic depends only on the input logics and the meaning of the connective used.
Generally there are five connectives which are −
OR (∨)
AND (∧)
Negation/ NOT (¬)
Implication / if-then (→)
If and only if (⇔).
connective of implication ⇒ is defined as (A ⇒ B) ⇔ ((¬ A) ∨ B).
To know more about logical connective, visit:
brainly.com/question/28258509
#SPJ9
One method is to round 997 up to 1000, multiply by 8, and then subtract 8 times 3. This would give you the solution of 7976.
Another method (Which I personally wouldn't use) is to recursively double 997. This is more difficult, although effective. After you double 997, double the resulting number, and then double the resulting number from that, you have the solution. This is because 2^3 is 8.
Answer:
The line passes through (4, -7) and (5, -10).
Step-by-step explanation:
When x = 4, y = 5 - 3(4), or 5 - 12, or -7. Thus the point (4, -7) lies on the graph. Similarly y = 5 - 3(5) = -10 when x = 5. Thus, the line also goes through (5, -10). Plot these two points and draw a line through them. Doing this will result in the desired graph.
