Answer:
3.43 hours
Step-by-step explanation:
A castle has to be guarded 24 hours a day. 7 knights are ordered to split each day guard duty equally. How long will each knight spend on guard duty in one day?
From the above question:
7 knights = 24 hours
1 knight = x hours
Cross Multiply
7 knights × x hours = 1 knight × 24 hours
x hours = 1 knight × 24 hours/ 7 knights
x hours = 3.4285714286 hours
Approximately = 3.43 hours
Therefore, each knight would spend 3.43 hours on guard duty in one day
Answer:
Ques 1 - 
Ques 2 - 
Step-by-step explanation:
Ques 1: From the table, we see the relation,
5 = 2 × 2 + 1
9 = 2 × 4 + 1
13 = 2 × 6 + 1
17 = 2 × 8 + 1
21 = 2 × 10 + 1
That is, the relation from the table is given by,
, where x is the input and y is the output.
Hence, the required equation is
.
Ques 2: From the table, we see that,
2 = 12 × 0 + 2
14 = 12 × 1 + 2
26 = 12 × 2 + 2
38 = 12 × 3 + 2
50= 12 × 4 + 2
That is, the relation from the table is given by,
, where x is the input and y is the output.
Hence, the required equation is
.
Answer:
The reason for the decreasing sequence is 
the sum of the sequence is -243
Step-by-step explanation:
Note that the numbers are decreasing so we will use the following formula to find the sum:
S∞=
,
where t1 is equal to the first number of the sequence and q is the reason that gives the following results.
to find q this form is used;
q= 
then we replace in the formula of the sum to find the total
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:
HELOOOOOOOOOOO the answer is, 545.32
Step-by-step explanation: