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
andreev551 [17]
2 years ago
6

guests at an amusement park must be at least 48 inches tall to be able to ride the bumper cars. which graph represents the set o

f heights in inches that satisfy this requirement ​

Mathematics
2 answers:
quester [9]2 years ago
8 0

Answer:

C is the answer

Step-by-step explanation:

just took the quiz

brainlest please

julsineya [31]2 years ago
8 0

Answer: c

Step-by-step explanation:

Took i

the test

You might be interested in
5. The recursive algorithm given below can be used to compute gcd(a, b) where a and b are non-negative integer, not both zero.
s2008m [1.1K]

Implementating the given algorithm in python 3, the greatest common divisors of <em>(</em><em>124</em><em> </em><em>and</em><em> </em><em>244</em><em>)</em><em> </em>and <em>(</em><em>4424</em><em> </em><em>and</em><em> </em><em>2111</em><em>)</em><em> </em>are 4 and 1 respectively.

The program implementation is given below and the output of the sample run is attached.

def gcd(a, b):

<em>#initialize</em><em> </em><em>a</em><em> </em><em>function</em><em> </em><em>named</em><em> </em><em>gcd</em><em> </em><em>which</em><em> </em><em>takes</em><em> </em><em>in</em><em> </em><em>two</em><em> </em><em>parameters</em><em> </em>

if a>b:

<em>#checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>is</em><em> </em><em>greater</em><em> </em><em>than</em><em> </em><em>b</em>

return gcd (b, a)

<em>#if</em><em> </em><em>true</em><em> </em><em>interchange</em><em> </em><em>the</em><em> </em><em>Parameters</em><em> </em><em>and</em><em> </em><em>Recall</em><em> </em><em>the</em><em> </em><em>function</em><em> </em>

elif a == 0:

return b

elif a == 1:

return 1

elif((a%2 == 0)and(b%2==0)):

<em>#even</em><em> </em><em>numbers</em><em> </em><em>leave</em><em> </em><em>no</em><em> </em><em>remainder</em><em> </em><em>when</em><em> </em><em>divided</em><em> </em><em>by</em><em> </em><em>2</em><em>,</em><em> </em><em>checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>and</em><em> </em><em>b</em><em> </em><em>are</em><em> </em><em>even</em><em> </em>

return 2 * gcd(a/2, b/2)

elif((a%2 !=0) and (b%2==0)):

<em>#checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>is</em><em> </em><em>odd</em><em> </em><em>and</em><em> </em><em>B</em><em> </em><em>is</em><em> </em><em>even</em><em> </em>

return gcd(a, b/2)

else :

return gcd(a, b-a)

<em>#since</em><em> </em><em>it's</em><em> </em><em>a</em><em> </em><em>recursive</em><em> </em><em>function</em><em>,</em><em> </em><em>it</em><em> </em><em>recalls</em><em> </em><em>the function</em><em> </em><em>with </em><em>new</em><em> </em><em>parameters</em><em> </em><em>until</em><em> </em><em>a</em><em> </em><em>certain</em><em> </em><em>condition</em><em> </em><em>is</em><em> </em><em>satisfied</em><em> </em>

print(gcd(124, 244))

print()

<em>#leaves</em><em> </em><em>a</em><em> </em><em>space</em><em> </em><em>after</em><em> </em><em>the</em><em> </em><em>first</em><em> </em><em>output</em><em> </em>

print(gcd(4424, 2111))

Learn more :brainly.com/question/25506437

6 0
2 years ago
Add me on Playstation NathanTheSnail for 200 points! Please.
mars1129 [50]

Answer:

You aren't even giving 200 points.

Step-by-step explanation:

4 0
3 years ago
Read 2 more answers
Let n be a natural number. Show that 3 | n3 −n
Vladimir [108]
Let n=1. Then n^3-n=1^3-1=0. By convention, every non-zero integer n divides 0, so 3\vert n^3-n.

Suppose this relation holds for n=k, i.e. 3\vert k^3-k. We then hope to show it must also hold for n=k+1.

You have

(k+1)^3-(k+1)=(k^3+3k^2+3k+1)-(k+1)=(k^3-k)+3(k^2+k)

We assumed that 3\vert k^3-k, and it's clear that 3\vert 3(k^2+k) because 3(k^2+k) is a multiple of 3. This means the remainder upon divides (k+1)^3-(k+1) must be 0, and therefore the relation holds for n=k+1. This proves the statement.
4 0
3 years ago
Given the quantic solve for x . 2x⁵-6x³-4x²+2x+4​
Eva8 [605]
This problem cannot be done because it is not an equation meaning it does not have an “=“
4 0
2 years ago
Please help me!
Harman [31]

Answer:

The graph of g(x) is a vertical translation of f(x). Although both have the same x coordinates but different y coordinates.

The graph of g is a <u>vertical</u><em> </em>translation of the graph of f <u>12</u> units <u>downward</u>.

Step-by-step explanation:

The equation y=f(x)+k represents that when k is negative, the graph moves downward.

6 0
2 years ago
Read 2 more answers
Other questions:
  • Johnathan can jog 3 2/5 miles in 7/8 hour. Found his average speed in miles per hour
    7·2 answers
  • Why might you want to use the commutative property to change the integers
    8·1 answer
  • Does a two-digit number exist such that the digits sum to 9 and when the digits are reversed the resulting number is 9 greater t
    6·2 answers
  • Can you tell me the differences between assumed mean and arithmetic mean​
    14·1 answer
  • If the sales tax rate is 7.25% in California, then how much tax should a merchant charge in San Francisco for the sale of a $15
    6·2 answers
  • Helllp fast please thank
    5·2 answers
  • What number when added to 13 gives 2?​
    11·2 answers
  • The cost of a service call to fix a washing machine can be expressed by the linear function y = 45 x + 35, where y represents th
    14·1 answer
  • Marley runs 5 yards down the track from point A to point B, and then stops and runs
    10·1 answer
  • About how many 15s are there in 1525?<br>a.98<br>b.100<br>c.102​
    11·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!