All categories

2 years ago

There are 16 cookies and 4 friends. How many cookies will each friend will have?

Mathematics

1 answer:

Anestetic [448]2 years ago

8 0

Each friend will have 4 cookies.

You might be interested in

PLEASEEE SOMEBODYY HELP MEEE ANYBODY STILL DOING MATH???????

AURORKA [14]

-1 only (this is to to reach the character limit)

7 0

3 years ago

Read 2 more answers

Subtract: 7 7/10 -3 4/5 =

andrey2020 [161]

Answer:

3 9/10

Step-by-step explanation:

in first step convert mix fraction into simple fraction then take LCM and then subtract it.

6 0

3 years ago

The sum of two numbers is 73.if one of them is 40,find the other.

ICE Princess25 [194]

Answer:

Step-by-step explanation:

Let the other number = x

x + 40 = 73

Subtract 40 from both sides

x + 40 - 40 = 73 - 40

x = 33

6 0

2 years ago

Read 2 more answers

For each of the following, use logic laws to decide whether the statement is a tautology contradiction, or neither. a (a) (A B)

spayn [35]

Answer:

The statement $(A\rightarrow \lnot B)\land (B\rightarrow A)$ is a contingency.

The statement $(P\rightarrow \lnot P)\land P$ is a contradiction.

Step-by-step explanation:

A tautology is a proposition that is always true.

A contradiction is a proposition that is always false.

A contingency is a proposition that is neither a tautology nor a contradiction.

a) To classify the statement $(A\rightarrow \lnot B)\land (B\rightarrow A)$ , you need to use the logic laws as follows:

$(A\rightarrow \lnot B)\land (B\rightarrow A) \equiv$

$\equiv (\lnot A \lor\lnot B)\land(\lnot B \lor A)$ by the logical equivalence involving conditional statement.

$\equiv (\lnot B\lor \lnot A )\land(\lnot B \lor A)$ by the Commutative law.

$\equiv \lnot B \lor (\lnot A \land A)$ by Distributive law.

$\equiv \lnot B \lor (A \land \lnot A)$ by the Commutative law.

$\equiv \lnot B \lor F$ by the Negation law.

Therefore the statement $(A\rightarrow \lnot B)\land (B\rightarrow A)$ is a contingency.

b) To classify the statement $(P\rightarrow \lnot P)\land P$ , you need to use the logic laws as follows:

$(P\rightarrow \lnot P)\land P \equiv$

$\equiv (\lnot P \lor \lnot P)\land P$ by the logical equivalence involving conditional statement.

$\equiv P \land (\lnot P \lor \lnot P)$ by the Commutative law.

$\equiv (P \land \lnot P) \lor (P \land \lnot P)$ by Distributive law.

$\equiv F \lor F \equiv F$ by the Negation law.

Therefore the statement $(P\rightarrow \lnot P)\land P$ is a contradiction.

8 0

3 years ago

A line has slope

loris [4]

Y = mx+b
-1 = 13/4 (-1) +b
-4/4 + 13/4 = b
9/4 = b

3 0

2 years ago