Answer:
7
Step-by-step explanation:
The number of hard puzzles solved by Tina using a system of equations is 15
Using the relation :
The system of equation representing the scenario can be written thus :
a + b = 50 - - - - - (1)
30a + 60b = 1950 - - - - (2)
From (1)
a = 50 - b - - - - - - (3)
Substitutea = 50 - b in (2)
30(50 - b) + 60b = 1950
1500 - 30b + 60b = 1950
1500 + 30b = 1950
30b = 1950 - 1500
b = 450 / 30
b = 15
Therefore, the Number of hard puzzles solved is 15
Learn more :brainly.com/question/18796573
This is a system of equations. We can solve it by recognizing the two linear equalities we've given to solve this equation.
First, let's start off by recognizing two variables: x and y. x will be our number of hard puzzles, and y will be our number of easy puzzles. We're given that the number of hard puzzles and easy puzzles sum to 50, so we can rewrite that as:
Next, we're given that the sum of the points gained from the hard puzzles (60x), and the number of points gained from the easy puzzles (30y), sum to 1950. We can rewrite that as:
Now, we have our two linear equations, and we must solve for the hard puzzles, so x. Solving for the hard puzzles means eliminating the easy puzzles from our systems, so we can multiply our first equation by 30, and subtract it from the first equation. This is a technique called elimination.
Since x=15, Tina has solved 15 hard puzzles.
60K
80K
????
Answer: 40K
Step-by-step explanation:
We know that the area of a regular polygon is given by :-
Given: The side of regular octagon = 10
Then, the perimeter of the regular octagon =
Now, the area of given regular octagon is given by :-
Answer:
8a+1=33
Step-by-step explanation:
you can solve 3a-2=10 by simplifying to 3a=12, so a=4. Then you replace the a in 8a+1 with 4 to get 32+1, which is 33
Answer:
33
Step-by-step explanation:
3a-2= 10
3a=12
a=4
in this equation a=4 so you substitute that value into the other equation
8(4) +1=33
Answer:
We have to use the mathematical induction to prove the statement is true for all positive integers n.
The integer is divisible by 3 for every positive integer n.
is divisible by 3.
Hence, the statement holds true for n=1.
i.e. is divisible by 3.---------(2)
i.e. is divisible by 3.
We know that:
and
Hence,
As we know that:
was divisible as by using the second statement.
Also:
is divisible by 3.
Hence, the addition:
is divisible by 3.
Hence, the statement holds true for n=k+1.
Hence by the mathematical induction it is proved that:
The integer is divisible by 3 for every positive integer n.