1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Basile [38]
2 years ago
15

Write the domain and rang of h using interval notation

Mathematics
1 answer:
34kurt2 years ago
3 0

We can write the domain and range in interval notation, which uses values within brackets to describe a set of numbers. In interval notation, we use a square bracket [ when the set includes the endpoint and a parenthesis ( to indicate that the endpoint is either not included or the interval is unbounded.

You might be interested in
A sporting goods store sells 2 fishing reels and 4 fishing rods for $362. Later they sell 8 fishing reels and 2 fishing rods for
mixas84 [53]
Sorry about all the arrows, but hope this helps! Reels=$21 and rods=$80. All my work is shown.

7 0
3 years ago
Please explain in simple language how to complete the square.
dsp73

Answer:

Step 1 Divide all terms by a (the coefficient of x2).

Step 2 Move the number term (c/a) to the right side of the equation.

Step 3 Complete the square on the left side of the equation and balance this by adding the same value to the right side of the equation.

Step-by-step explanation:

hope i helped

3 0
3 years ago
"3. When we have two sorted lists of numbers in non-descending order, and we need to merge them into one sorted list, we can sim
iren [92.7K]

Answer:

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

Step-by-step explanation:

To understand better how we arrived at the aforementioned algorithm, we take it step by step

a, Construct a min-heap of the minimum elements from each of "k" lists.

The creation of this min-heap will cost O (k) time.

b) Next we run delete Minimum and move the minimum element to the output array.

Each extraction takes O (log k) time.

c) Then insert into the heap the next element from the list from which the element was extracted.

Now, we note that  since we extract n elements in total, the running time is

O (n log k+ k) = O (n log k).

So we can conclude that :

Since we extract n elements in total, the algorithm for the running time for K sorted list is O (n log k+ k) = O (n log k)

5 0
3 years ago
Solve for j.
gavmur [86]

Answer:

( J - 6 ) × (J + 6 )

Step-by-step explanation:

j^2 -6^2

( J - 6 ) × ( j + 6 )

5 0
3 years ago
ReWaRding brainliest
bogdanovich [222]

Answer:

9

hope this helps

have a good day :)

Step-by-step explanation:

3 0
2 years ago
Read 2 more answers
Other questions:
  • The Rockville Recruitment Agency just placed Howard Jacobson in a job as an assistant pharmacist. The job pays $51.2K. The agenc
    10·1 answer
  • If the product of two consecutive integers is 156 what type of equation do you create to solve this problem
    14·2 answers
  • What is the slope of a line parallel to a line with equation 2x - 5y = 9
    6·1 answer
  • Ray BA and BC are opposite rays, and Ray BE bisects
    10·1 answer
  • I don’t understand the polynomials
    9·1 answer
  • Y = x2 – 3x + 10, find f(–2)
    5·1 answer
  • Please due tomorrow!
    8·2 answers
  • Find the measure of<br> А<br> E<br> 103°<br> 270<br> 50°<br> 35°<br> D<br> B<br> C
    9·1 answer
  • [10 points] [ASAP]
    11·1 answer
  • In dogs, there is a hereditary deafness caused by a recessive gene, “d." A kennel owner
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!