None of those describe this function.
It's not a constant function, because it is not equal to a constant (something that isn't a variable)
It doesn't show direct variation, because it can't be represented in the form
y = kx.
It isn't an absolute value function because the absolute value isn't taken anywhere.
If it was an absolute value function it would look something like this:

It isn't a greatest integer function, because the greatest integer isn't taken anywhere.
If it was a greatest integer function it would look something like this:

Are you sure you typed that question right?
Answer:
AAA
Step-by-step explanation:
Question 11= B
Question 13= C
I don't know how to do question 12
To find out how many students voted, you just add the 2 numbers up and you'll get 98. So 98 students voted.
Answer:
.
Step-by-step explanation:
Since repetition isn't allowed, there would be
choices for the first donut,
choices for the second donut, and
choices for the third donut. If the order in which donuts are placed in the bag matters, there would be
unique ways to choose a bag of these donuts.
In practice, donuts in the bag are mixed, and the ordering of donuts doesn't matter. The same way of counting would then count every possible mix of three donuts type
times.
For example, if a bag includes donut of type
,
, and
, the count
would include the following
arrangements:
Thus, when the order of donuts in the bag doesn't matter, it would be necessary to divide the count
by
to find the actual number of donut combinations:
.
Using combinatorics notations, the answer to this question is the same as the number of ways to choose an unordered set of
objects from a set of
distinct objects:
.