Any number to the power '0' equals '1'. Proof ; Let a^(n) = b Then dividing a^(n) / a^(n) = b/b a^(n-n) = b/b a^(0) = 1
A=0 b=0 c=0
well the only answer i can so far come up with is: a=1 b= -1 c=0 so then (a+b)=(c*c)=(a*c) ...............(0)=(0)=(0) ......................0 ok if that is what your looking for Great! just know that i am not a math wiz. :)
A=B , A-B=B-B , A-B =0 B=C , B-B=C-B, 0=C-B So A-B=0 but also C-B=0 A-B=C-B ...add +b ...A-B+B=C-B+B , A=C
Two: one is 0, the other is -b/a ax2 + bx + c = 0, but c = 0 ⇒ ax2 + bx + 0 = 0 ⇒ ax2 + bx = 0 ⇒ x(ax + b) = 0 ⇒ x = 0 or (ax + b) = 0 ⇒ x = -b/a
Yes because if 1+0=1 than 0 plus b equals b
Because if input A *and* input B is true, then the output is true! Truth table of AND gate: ┌─┬─╥───────┐ │A│B║Q (Output)│ ├─┼─╫───────┤ │0│0║0..............│ ├─┼─╫───────┤ │0│1║0............. │ ├─┼─╫───────┤ │1│0║0............. │ ├─┼─╫───────┤ │1│1║1............. │ └─┴─╨───────┘
Here is the truth table for a 2 input AND gate. A & B are inputs. Y is the output. A B Y 0 0 0 0 1 0 1 0 0 1 1 1 As you can see, the output of an AND gate is only 1 when all of the inputs are 1.
OR gate is an electronic circuit that takes 2 or more input signal bt produces one 1 output signal. the output is true(ie: 1) if any of the 2 input is true, else the output is false(ie: 0). eg:- A B A+B 0 0 0 0 1 1 1 0 1 1 1 1 here '+' sign indicates the OR gate.
a = 0, b = 0.
The XOR (Exclusive Or) gate has a true output when the two inputs are different. When one input is true, the output is the inversion of the other. When one input is false, the output is the non-inversion of the other. A B R 0 0 0 0 1 1 1 0 1 1 1 0 Look at the last two lines. You see that R is NOT B, but only when A is true. The same can be said of A; R is NOT A, but only when B is true.
The difference is in their truth tables.AND gate: The output is true when inputs 'A' AND'B' are both true.A | B | Output0 | 0 | 00 | 1 | 01 | 0 | 01 | 1 | 1OR gate: The output is true when either input 'A' OR input 'B' is true.A | B | Output0 | 0 | 00 | 1 | 11 | 0 | 11 | 1 | 1
xor logic because A B output 0 0 0 0 1 1 1 0 1 1 1 1
That factors to (a + 1)(a + b) a = -1, -b b = -a
Any number to the power '0' equals '1'. Proof ; Let a^(n) = b Then dividing a^(n) / a^(n) = b/b a^(n-n) = b/b a^(0) = 1
A+A*b does not mean A plus Ab the operation signified by "+" is called "or" the operation signified by "*" is called "and" there are four possible outcomes of a+a*b if a=1 and b=1 the result is 1 if a=1 and b=0 the result is 1 if a=0 and b=1 the result is 0 if a=0 and b=0 the result is 0 a+a*b is 1 if a is 1 and a+a*b is 0 if a is 0 regardless of the value of b thus a+a*b=a Q.E.D.
A=0 b=0 c=0