All categories

3 years ago

2. The number of nickels that Christine has is

Mathematics

1 answer:

aev [14]3 years ago

7 0

Answer:

The number of nickels is 15

The number of Dimes is 3

Step-by-step explanation:

Let the number of dimes Christine has be d

The number of nickels with christine be n

Then the number of Nickels Christine has will be

n = 5d ----------------------------------(1)

Now The total value of both dimes and nickels is = $1.05

This can be represented as

5n +10d = 105 (in cents)

From eq(1)

5(5d) + 10d = 105

25d+10d = 105

35d = 105

$d = \frac{105}{35}$

d = 3----------------------------------(2)

Substituting (2) in (1), we get

n = 5(3)

n = 15

You might be interested in

A plane takes off from an airport and flies at a speed of 400km/h on a course of 120° for 2 hours. the plane then changes its co

butalik [34]

Answer:

Distance from the airport = 894.43 km

Step-by-step explanation:

Displacement and Velocity

The velocity of an object assumed as constant in time can be computed as

$\displaystyle \vec{v}=\frac{\vec{x}}{t}$

Where $\vec x$ is the displacement. Both the velocity and displacement are vectors. The displacement can be computed from the above relation as

$\displaystyle \vec{x}=\vec{v}.t$

The plane goes at 400 Km/h on a course of 120° for 2 hours. We can compute the components of the velocity as

$\displaystyle \vec{v_1}=$

$\displaystyle \vec{v_1}=\ km/h$

The displacement of the plane in 2 hours is

$\displaystyle \vec{x_1}=\vec{v_1}.t_1=.(2)$

$\displaystyle \vec{x_1}=km$

Now the plane keeps the same speed but now its course is 210° for 1 hour. The components of the velocity are

$\displaystyle \vec{v_2}=$

$\displaystyle \vec{v_2}=km/h$

The displacement in 1 hour is

$\displaystyle \vec{x_2}=\vec{v_2}.t_2=.(1)$

$\displaystyle \vec{x_2}=km$

The total displacement is the vector sum of both

$\displaystyle \vec{x_t}=\vec{x_1}+\vec{x_2}=+$

$\displaystyle \vec{x_t}=km$

$\displaystyle \vec{x_t}=$

The distance from the airport is the module of the displacement:

$\displaystyle |\vec{x_t}|=\sqrt{(-746.41)^2+492.82^2}$

$\displaystyle |\vec{x_t}|=894.43\ km$

8 0

3 years ago

Simplify the following expression:

nalin [4]

-2/2 I think probably

3 0

3 years ago

Which pair of statements describes the end behavior of the graph of the function f(x) = x3 + 2x2 − 5x − 6?

notka56 [123]

A function assigns the values. The correct option is D.

<h3>What is a Function?</h3>

A function assigns the value of each element of one set to the other specific element of another set.

The complete question is:

Which pair of statements describe the end behavior of the graph of the function f(x) = x³ + 2x² − 5x − 6?

A.) As x approaches negative infinity, f(x) approaches infinity. As x approaches infinity, f(x) approaches infinity.

B.) As x approaches negative infinity, f(x) approaches infinity. As x approaches infinity, f(x) approaches negative infinity.

C.) As x approaches negative infinity, f(x) approaches negative infinity. As x approaches infinity, f(x) approaches negative infinity.

D.) As x approaches negative infinity, f(x) approaches negative infinity. As x approaches infinity, f(x) approaches infinity.

If we draw the graph of the given function f(x) = x³ + 2x² − 5x − 6, then it can be observed that as x approaches -∞, f(x) approaches -∞. As x approaches ∞, f(x) approaches infinity.

Hence, the correct option is D.

Learn more about Function:

brainly.com/question/5245372

#SPJ1

3 0

2 years ago

Sari has 3 times as many pencil erasers asSam. Together they have 28 erasers. How many erasers does Sari have?

wel

3x +x = 28

4x = 28

x = 28/4 = 7

7x3 = 21

Sari has 21 erasers

4 0

3 years ago

1. Let L be a list of numbers in non-decreasing order, and x be a given number. Describe an algorithm that counts the number of

e-lub [12.9K]

Answer:

Algorithm

Start

Int n // To represent the number of array

Input n

Int countsearch = 0

float search

Float [] numbers // To represent an array of non decreasing number

// Input array elements but first Initialise a counter element

Int count = 0, digit

// Check if element to be inserted is the first element

If(count == 0) Then

Input numbers[count]

Else

lbl: Input digit

If(digit > numbers[count-1]) then

numbers[count] = digit

Else

Output "Number must be greater than the previous number"

Goto lbl

Endif

count = count + 1

While(count<n)

count = 0

// Input element to count

input search

// Begin searching and counting

if(numbers [count] == search)

countsearch = countsearch+1;

End if

While (count < n)

Output count

Program to illustrate the above

// Written in C++

// Comments are used for explanatory purpose

#include<iostream>

using namespace std;

int main()

{

// Variable declaration

float [] numbers;

int n, count;

float num, searchdigit;

cout<<"Number of array elements: ";

cin>> n;

// Enter array element

for(int I = 0; I<n;I++)

{

if(I == 0)

{

cin>>numbers [0]

}

else

{

lbl: cin>>num;

if(num >= numbers [I])

{

numbers [I] = num;

}

else

{

goto lbl;

}

// Search for a particular number

int search;

cin>>searchdigit;

for(int I = 0; I<n; I++)

{

if(numbers[I] == searchdigit

search++

}

// Print result

cout<<search;

return 0;

}

8 0

3 years ago