Answer:
b. 3.775
Step-by-step explanation:
The question is worded incorrectly since the sum of the first 100 counting numbers is actually greater than the sum of the first 50 counting numbers.
The sum of any set of consecutive numbers of size 'n' is given by:
Where A1 is the first number on the set and An is the last number.
The sum of the first 100 counting numbers (1 through 100) is:
The sum of the first 50 counting numbers (1 through 50) is:
The difference between those two values is:
Therefore, the sum of the first 100 counting numbers is 3,775 greater than the sum of the first 50 counting numbers.
Given:
Total number of marbles = 15
Probability of randomly selecting a green marble = 
.
Probability of randomly selecting a green marble, replacing it, and then randomly selecting a blue marble = 
.
To find:
The number of blue marbles.
Solution:
Let the number of blue marbles be x.
It is given that,
Probability of randomly selecting a green marble, replacing it, and then randomly selecting a blue marble is . So,
Multiply both sides by 75.
Therefore, the number of blue marbles in the bag is 6.
The given expression is
=ab+cd+ef+gh
The meaning of expression is equal to terms which contains variables and constants and operation between them is Addition, Subtraction, Multiplication and Division.
→The expression consists of four terms which are, ab, cd, ef, and gh.
→Each term contains
Two factors.
plz mark as brainliest
Answer:
rational
Step-by-step explanation:
is not an Irrational number because it can be expressed as the quotient of two integers: 91÷ 1
Hope this Helps :)
B
To solve for the inverse, just swap the x and y and solve for the new y.
Then inspect both functions for the domain.
In the original function, x has to be greater than or equal to 0 or else you would have a negative square root which is impossible.
The inverse function has no limitations as any x could make that true.
The main things that will limit domain is square root of negative or divide by zero.
Therefore, x>=0 is the only domain restriction.
