Answer:
Bitwise OR operation = 111011101
AND operation = 10100000
NOT operation: 01001110 (NOT A)
XOR operation: 00011101
Step-by-step explanation:
OR operation: A + B = adding the two binary numbers together, starting from the least significant bit (LSB) and moving to the Most significant bit (MSB)
AND operation: A*B, multiplying the two binary numbers together.
NOT: taking the opposite of each binary digit
XOR: if either of the two binary numbers is 1, then the result is 1, but if they are both 1 or both 0, then the result becomes 0.
Answer:
(-∞ , -6] ∪ [6 , +∞)
Step-by-step explanation:
<u>Let D be the domain of f </u>.
D = {x ∈ IR ; where x² - 36 ≥ 0}
x² - 36 ≥ 0
⇔ x² ≥ 36
⇔ x² ≥ 6²
⇔ √(x²) ≥ √(6²)
⇔ |x| ≥ 6
⇔ x ∈ (-∞ , -6] ∪ [6 , +∞)
Question 1: The y-intercept is where the line crosses the y-axis. The increments of the y-axis is by 20, and the y-intercept is at (0, 20).
The slope is the change in y over the change in x. Find two points:
(0, 20) and (2, 80)
Now:
(80 - 20)/(2 - 0) = 60/2 = 30
Slope-intercept form is y = mx + b, where m is the slope and b is the y-intercept.
So:
y = 30x + 20
Question 2: Again, look for the y-intercept, which is pretty clear. It's (0, 60).
Now find two points:
(0, 60) and (2, 40)
Find the slope:
(40 - 60)/(2 - 0) = -20/2 = -10
So, the equation is:
y = -10x + 60
And, there you go!
Numerical because its the number of assistants.
Answer:
b and c
Step-by-step explanation:
