All categories

2 years ago

Given h(x)=-3x-4h(x)=−3x−4, find h(0)

Mathematics

1 answer:

bogdanovich [222]2 years ago

7 0

Answer:

h(0) = -4

Step-by-step explanation:

Put the value where the variable is and do the arithmetic.

h(x) = -3x -4

h(0) = -3·0 -4 = 0 -4

h(0) = -4

_____

Additional comment

In general, a polynomial function evaluated when the variable is zero will have the value of any added constant. All of the variable terms will be zero. Since the constant in this function is -4, we know immediately that h(0) = -4.

You might be interested in

In a bag, Gary has 3 red marbles, 4 blue marbles, 7 yellow marbles, 5 green marbles, 6 purple marbles, and 8 clear marbles. What

miskamm [114]

Answer:

2220

Step-by-step explanation:

gcd of all numbers

3,4,7,5,6,8

2 = 3,2,7,5,3,4

2 = 3,1,7,6,3,2

2 = 3,1,7,5,3,1

3 = 1,1,7,5,1,1

6 0

2 years ago

Using the Breadth-First Search Algorithm, determine the minimum number of edges that it would require to reach

jekas [21]

Answer:

The algorithm is given below.

#include <iostream>

#include <vector>

#include <utility>

#include <algorithm>

using namespace std;

const int MAX = 1e4 + 5;

int id[MAX], nodes, edges;

pair <long long, pair<int, int> > p[MAX];

void initialize()

{

for(int i = 0;i < MAX;++i)

id[i] = i;

}

int root(int x)

{

while(id[x] != x)

{

id[x] = id[id[x]];

x = id[x];

}

return x;

}

void union1(int x, int y)

{

int p = root(x);

int q = root(y);

id[p] = id[q];

}

long long kruskal(pair<long long, pair<int, int> > p[])

{

int x, y;

long long cost, minimumCost = 0;

for(int i = 0;i < edges;++i)

{

// Selecting edges one by one in increasing order from the beginning

x = p[i].second.first;

y = p[i].second.second;

cost = p[i].first;

// Check if the selected edge is creating a cycle or not

if(root(x) != root(y))

{

minimumCost += cost;

union1(x, y);

}

return minimumCost;

}

int main()

{

int x, y;

long long weight, cost, minimumCost;

initialize();

cin >> nodes >> edges;

for(int i = 0;i < edges;++i)

{

cin >> x >> y >> weight;

p[i] = make_pair(weight, make_pair(x, y));

}

// Sort the edges in the ascending order

sort(p, p + edges);

minimumCost = kruskal(p);

cout << minimumCost << endl;

return 0;

}

8 0

3 years ago

Mike runs for the president of the student government and is interested to know whether the proportion of the student body in fa

Alik [6]

Answer:

We conclude that the proportion of student body in favor of him is significantly less than or equal to 50%.

Step-by-step explanation:

We are given that Mike runs for the president of the student government and is interested to know whether the proportion of the student body in favor of him is significantly more than 50 percent.

A random sample of 100 students was taken. Fifty-five of them favored Mike.

Let p = proportion of the students who are in favor of Mike.

So, Null Hypothesis, $H_0$ : p $\leq$ 50% {means that the proportion of student body in favor of him is significantly less than or equal to 50%}

Alternate Hypothesis, $H_A$ : p > 50% {means that the proportion of student body in favor of him is significantly more than 50%}

The test statistics that would be used here One-sample z proportion statistics;

T.S. = $\frac{\hat p-p}{\sqrt{\frac{\hat p(1-\hat p)}{n} } }$ ~ N(0,1)

where, $\hat p$ = sample proportion of students body in favor of Mike = $\frac{55}{100}$ = 0.55

n = sample of students taken = 100

So, test statistics = $\frac{0.55-0.50}{\sqrt{\frac{0.55(1-0.55)}{100} } }$

= 1.01

The value of z test statistics is 1.01.

Now, at 0.05 significance level the z table gives critical value of 1.645 for right-tailed test.

Since our test statistic is less than the critical value of z as 1.01 < 1.645, so we have insufficient evidence to reject our null hypothesis as it will not fall in the rejection region due to which we fail to reject our null hypothesis.

Therefore, we conclude that the proportion of student body in favor of him is significantly less than or equal to 50% or proportion of the students in favor of Mike is not significantly greater than 50 percent.

4 0

3 years ago

Order these numbers from least to greatest. −3.12 , −3.2 , 8 , −5216

trapecia [35]

From the least to the greatest.

The one with the biggest size and has a negative sign is the least

-5216, -3.2, -3.12, 8

8 0

3 years ago

HAPPY B DAY TOO meeeeeee

stich3 [128]

Answer:

happy birthday may god bless you

3 0

2 years ago

Read 2 more answers