Please help as soon as possible
1 answer:
You might be interested in
Answer:
Step-by-step explanation:
q is TFTF
~q use negation, not q so is the opposite of q : FTFT
p↔~q use biconditional ,and will be True only is both statements are T or both are F
p values are TTFF ↔~q values are FTFT : FTTF
(p↔~q )∧~q use conjunction, that is True only if both statements are T
(p↔~q ) values are FTTF ∧~q values are FTFT : FTFF
(p↔~q )∧~q → p use a conditional statement, where only True False will give a F
(p↔~q )∧~q values are FTFF → p values are TTFF : TTTT
Answer:
There are 199 pairs of consecutive natural numbers whose product is less than 40000.
Step-by-step explanation:
We notice that such statement can be translated into this inequation:
Now we solve this inequation to the highest value of that satisfy the inequation:
The Quadratic Formula shows that roots are:
Only the first root is valid source to determine the highest possible value of , which is
. Each natural number represents an element itself and each pair represents an element as a function of the lowest consecutive natural number. Hence, there are 199 pairs of consecutive natural numbers whose product is less than 40000.