Answer:
11 13 15 17 19
Step-by-step explanation:
We will solve this word problem using 2k+1 which is one of the general forms of an odd integer.
Let 2k+1 be the first odd integer.
(2k+1) + (2k+3) + (2k +5) = (2k+7) + (2k +9) + 3 (the +3 is to accommodate for the left side being 3 more than the right)
Solve for k
6k + 9 = 4k + 19
6k - 4k + 9 = 4k-4k + 19
2k + 9 = 19
2k + 9 - 9 = 19 - 9
2k = 10
2k/2 = 10/2
k = 5
To get the first digit in the series plug in 5 for k
2k+1
2(5) + 1
10 + 1 = 11
So our series is 11, 13, 15, 17, 19
Let's test it.
11 + 13 +15 = 39
17 + 19 = 36
So we are correct, the first 3 integers are 3 more that the sum of the last 2.
Answer:
x=8
Step-by-step explanation:
Because 8 times 3 equals 24 and 12 equals 36
Can i be brianliest please
Answer:
2/3
Step-by-step explanation:
= 3/4 * 8/9
= 24/36
simplify by 4
= 6/9
simplify by 3
= 2/3
Answer:
The negation to the given statement "At least one gift in the bag is wrapped - true" is "
At least one gift in the bag is not wrapped" - False
-
At least one gift in the bag is not wrapped - False
-
Not every gift in the bag is wrapped-True
- Every gift in the bag is wrapped-False
- None of the gifts in the bag are wrapped-False
Step-by-step explanation:
Given statement is At least one gift in the bag is wrapped is true
The negation to the given statement is "
At least one gift in the bag is not wrapped" - False
<u>To determine whether the statement is a negation of the given statement is True or False :</u>
<h3>
At least one gift in the bag is not wrapped - False
</h3><h3>
Not every gift in the bag is wrapped-True </h3><h3>
Every gift in the bag is wrapped-False
</h3><h3>
None of the gifts in the bag are wrapped-False</h3>
Answer:
8 in each row
Step-by-step explanation:
