Answer:
1) f(g(0)) = 0
2) g(f(2)) = 2
3) g(g(0)) = 8
Step-by-step explanation:
Here, the given functions are:
g(x) = 3 x +2 and f(x)= (x-2)/3
1. Now, f(g(x)) = f(3x+2)
Also, f(3x+2) = (3x+2 -2) /3 = x
So, f(g(x)) = x
⇒ f(g(0)) = 0
2. g(f(x)) = g((x-2)/3) = 3((x-2)/3) +2
or, g(f(x)) = x
⇒ g(f(2)) = 3((2)-2/3) +2 = 2
or, g(f(2)) = 2
3. g(g(0)= g( 3 (0) +2) = g(2)
Now, g(2) = 3(2) + 2 = 6 + 2 = 8
or, g(g(0)) = 8
Answer:
441 seats are being used :]
Step-by-step explanation:
There 7 blocks of hundreds which means each such block is equivalent to 100.
There are 5 blocks of tens, which means each such block is equivalent to 10.
There are 8 blocks of ones, which means each such block is equivalent to 1.
The total of these blocks will be = 7(100) + 5(10) + 8(10) = 758
We can make several two 3-digit numbers from these blocks. An example is listed below:
Example:
Using 3 hundred block, 2 tens blocks and 4 ones block to make one number and remaining blocks to make the other number. The remaining blocks will be 4 hundred blocks, 3 tens blocks and 4 ones blocks
The two numbers we will make in this case are:
1st number = 3(100) + 2(10) + 4(1) = 324
2nd number = 4(100) + 3(10) + 4(1) = 434
The sum of these two numbers is = 324 + 434 = 758
i.e. equal to the original sum of all blocks.
This way changing the number of blocks in each place value, different 3 digit numbers can be generated.
Answer:
a) 4,096
b) 0.000244
Step-by-step explanation:
a)
By the Fundamental rule of counting, there are
4*4*4*4*4*4 = 4,096
ways of forming six-digit arrangements where each position has 4 possibilities (1 to 4)
b)
The probability of entering the correct code on the first try, assuming that the owner does not remember the code is
1/4096 = 0.000244
