For the sequence 2, 6, 18, 54, ..., the explicit formula is: an = a1 ! rn"1 = 2 ! 3n"1 , and the recursive formula is: a1 = 2, an+1 = an ! 3 . In each case, successively replacing n by 1, 2, 3, ... will yield the terms of the sequence. See the examples below.
(Hard) A composite number n is called a Carmichael number bn−1 ≡ 1 (mod n) for every number b such ... Base case: When n = 2 the formula a + c ≡ b + d (mod m) was already given. ... The sequence goes 1, 3, 7, 15, 31,... guess that it is equal to 2n+1 − 1. ... Prove (now using induction on n) that fm|fmn for all n ≥ 1.
Here is the answer to the given question above. Given that there are a total of 18 students and 5/9 of the students have pets, let us divide 18 by 9 to see how many students have pets. So the answer would be 2. Since it is 5 out of 9, we multiply 2 by 5 and we get 10. Therefore, the answer is 10 students. Hope this answer helps.
Answer:
38 + 14 = 52
52 x 16 = 832
832 divided by 2 = 416
Formula of a trapezoid:
B1(base 1) + B2(base 2) x H(height) x 1/2(basically just dividing by 2)
