The months of the year are written on cards and dropped into a box. Remington selects a card without looking.
2 answers:
You might be interested in
Let
In order to prove this by induction, we first need to prove the base case, i.e. prove that P(1) is true:
So, the base case is ok. Now, we need to assume and prove
.
states that
Since we're assuming , we can substitute the sum of the first n terms with their expression:
Which terminates the proof, since we showed that
as required
Answer:
The correct option is x=3 , y=2
Step-by-step explanation:
According to the HL theorem if the hypotenuse and one leg of a right triangle are congruent to the hypotenuse and one leg of another right triangle then the triangles are congruent.
By using this theorem we can set up the system of equations as follows:
x=y+1 ...(1)
2x+3= 3y + 3 ..(2)
Now we will plug the value y+1 of equation 1 in equation 2.
2x+3 = 3y+3
2(y+1)+3=3y+3
2y+2+3=3y+3
2y+5=3y+3
Now combine the like terms:
5-3=3y-2y
2=y
y=2
Now plug the value y=2 in equation 1.
x=y+1
x=2+1
x=3
Thus the values of(x.y) are{(2,3)}
Therefore the correct option is x=3 , y=2 .....
