First get everything to one side by adding 9 to 2x + 3 and you end up with 2x + 3 + 9 > 0 and you add 9 and 3 and it will be 2x + 12 > 0 and do the same for the second one but if your trying to solve for x, subtract the 3 on both sides and you will get 2x > -12 then you divide 2 by both sides and you get x which is
x > -6
Answer:
for second box 8. for third box 64 to the power 1/3. for fourth box 1 . and for fifth box 64/512 for sixth box 1/64
9, 9 is the only number that goes into all of the numbers given. there would be 3 bouquets of roses, 1 bouquet of daisies, and 4 bouquets of tulips.
1 modulo 9 is the set of numbers as follows:
(0(9) + 1), (1(9) + 1, ....)
which is:
1, 10, 19
All we have to do is divide 1000 by 9, and round down.
1000/9 = 111.111......
There are 111 numbers.
Now let us check our work.
the set is as follows:
(1,10,19, ....... (111)9 +1)
(1, 10, 19 ........ 1000)
We are within 1000.
Therefore, 111 of the 1000 smallest positive integers are congruent to 1 modulo 9.
Answer:
56$
Step-by-step explanation:
8*2=16
10*4=40
16+40=56
