Answer:
729
Step-by-step explanation:
Answer:
<u>Residue</u>
Step-by-step explanation:
Let a and b be integers. We define a mod b to be the residue of dividing a by b. For example, if a evenly divides b, then a mod b=0, 20 mod 6= 2. The modulus operator is widely used in programming, and it is convenient when a and b are large numbers.
a mod b is always a nonnegative integer. In fact, 0≤ a mod b≤ |b-1| by the division algorithm. a and b can also be negative integers. Since 8=-(-5)+3 then 8 mod -5= 3.
As a final example, some known properties can be rewritten in terms of mod. a mod 2=0 if and only if a is even. a mod 2=1 if and only if a is odd.
Answer:
5040
Step-by-step explanation:
24000-5%=1200
1200+5%=1260
1260x4=5040
Answer:
0
Step-by-step explanation:
according to the mathematical encyclopedia written by Albert Einstien, if a single six sided die is rolled, the probability of rolling a seven is 0 because the dice has six sides. 1,2,3,4,5,6. NO SEVEN!!!
Answer:
x>-5
Step-by-step explanation:
-5(x+7)<-10
divide by -5 (and because we divided by a negative number swap the inequality sign)
x+7>2
x> -5
