All categories

3 years ago

Evaluate f(8) =(8-5)2 for f(8) X=8

Mathematics

1 answer:

emmasim [6.3K]3 years ago

6 0

Answer: f(8) = 9

Step-by-step explanation:

PEMDAS: Solve for parenthesis first.

f(8)= (8-5)^2

(3)^2

Square that, you get 9.

You might be interested in

Please I need to get this done by tomorrow

Alenkinab [10]

Answer:

i think it is 8

4 0

3 years ago

Read 2 more answers

The least common multiply of 2, 5, 6 and 9 is

Lady bird [3.3K]

Answer:

The LCM of 5, 6, and 9 is the product of all prime numbers on the left, i.e. LCM(5, 6, 9) by division method = 2 × 3 × 3 × 5 = 90.

8 0

3 years ago

Read 2 more answers

Write an equation in slope-intercept form for each of these representations.

PtichkaEL [24]

Answer:

1. y= -1/4x +2

2. y= -2x -1

Step-by-step explanation:

7 0

3 years ago

Lola is making greeting cards, which she will sell by the box at an arts fair. She paid $50 for a booth at the fair, and the mat

Schach [20]

At some point, she will sell enough cards so that her sales cover her expenditures. So, the correct answer is ($40)

<h3> How did we figure this out?</h3>

Lola is making greeting cards, which she will sell by the box at an arts fair. She paid $50 for a booth at the fair, and the materials for each box of cards cost $8. She will sell the cards for $10 per box of cards.

We are going to use 50, 8 and 10 to find are answer.

Therefore, we are going to divide the numbers:

$\boxed{50/10}$

Division problem
50/10
8 x ? = 40

<h3 /><h3>What is the missing number?</h3>

First, we need to figure out 50/10:

$\boxed{50/10=5}$

$\boxed{8x5=40}$

$5=40\\(50/10=5=8x5=40)$

Therefore, at some point, she will sell enough cards so that her sales cover her expenditures. So, the correct answer is ($40)

8 0

1 year ago

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 (124 and 244) and (4424 and 2111) are 4 and 1 respectively.

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

def gcd(a, b):

#initialize a function named gcd which takes in two parameters

if a>b:

#checks if a is greater than b

return gcd (b, a)

#if true interchange the Parameters and Recall the function

elif a == 0:

return b

elif a == 1:

return 1

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

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

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

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

#checks if a is odd and B is even

return gcd(a, b/2)

else :

return gcd(a, b-a)

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

print(gcd(124, 244))

print()

#leaves a space after the first output

print(gcd(4424, 2111))

Learn more :brainly.com/question/25506437

6 0

2 years ago