Answers:
Lower bound = 41.3
Upper bound = 41.5
===========================================================
Explanation:
49.15 is the smallest f can be while 49.24 is the largest it can be. Well technically we could have something like 49.2499 or 49.24999 and so on. We slowly approach 49.25 but never actually get there
So the variable f is between 49.15 and 49.25 inclusive of the first value but excluding the second value. We can write it as 
For similar reasoning, 
-----------------
If we wanted to subtract those variables and get the smallest result possible, then we need to pick values that are closest together. It might help to set up a number line.
This means we'd go for f = 49.15 and g = 7.85
The lower bound for f-g is f-g = 49.15-7.85 = 41.3
In contrast, the upper bound is when the two variables are spaced as far apart as possible. The upper bound is f-g = 49.25 - 7.75 = 41.5
Answer:
6: 230
Step-by-step explanation:
14*32=448
(10*20)+18=
448-218=230
Answer:
x=55.5
Step-by-step explanation:
First add 94 and 17 to get 111
Then subtract 111 from 180 and get 69 for the third angle on the triangle on the right.
69 is a vertical angle so the other angle is 69 as well.
180-69 is 111 and 111/2 is 55.5 because x is equal to the other angle on the triangle.
Answer:
What is an inverse?
Recall that a number multiplied by its inverse equals 1. From basic arithmetic we know that:
The inverse of a number A is 1/A since A * 1/A = 1 (e.g. the inverse of 5 is 1/5)
All real numbers other than 0 have an inverse
Multiplying a number by the inverse of A is equivalent to dividing by A (e.g. 10/5 is the same as 10* 1/5)
What is a modular inverse?
In modular arithmetic we do not have a division operation. However, we do have modular inverses.
The modular inverse of A (mod C) is A^-1
(A * A^-1) ≡ 1 (mod C) or equivalently (A * A^-1) mod C = 1
Only the numbers coprime to C (numbers that share no prime factors with C) have a modular inverse (mod C)
Step-by-step explanation:
Please check image.
