Find out equation is a function, Mathematics

Assignment Help:

Example: Find out which of the following equations functions are & which are not functions.

                           y= 5x + 1

Solution

The "working" definition of function is saying is that if we take all of possible values of x & plug them in the equation & solve for y we will get accurately one value for each value of x.  At this stage it can be pretty hard to actually illustrate that an equation is a function thus we'll mostly talk our way through it. Conversely it's frequently quite easy to show that an equation isn't a function.

So, we need to illustrate that no matter what x we plug in the equation & solve for y we will only obtain a single value of y.  Note as well that the value of y will probably be different for each value of x, although it doesn't have to be.

Let's begin by plugging in some of the values of x and see what happens.

x= -4 : y= 5 ( -4) + 1 = -20 + 1 = -19

x= 0: y= 5 (0)+ 1 = 0 + 1 = 1

x= 10 : y= 5 (10) + 1 = 50 + 1= 51

Thus, for each value of x we obtained a single value of y out of the equation.  Now, it isn't enough to claim that this is a function.  To officially prove that it is a function we have to illustrates that this will work no matter that value of x we plug into the equation.

Certainly we can't plug all possible value of x in the equation. That just isn't possible physically.  For each x, on plugging in, first we multiplied the x by 5 and after that added 1 onto it.  Now, if we multiply any number by 5 we will obtain a single value from the multiplication.  Similarly, we will only get a single value if we add 1 onto a number. So, it seems plausible that depend on the operations involved with plugging x into the equation that we will just get a single value of y out of the equation.

Hence, this equation is a function.


Related Discussions:- Find out equation is a function

Invariant lines, What lines are invariant under the transformation [(103)(0...

What lines are invariant under the transformation [(103)(01-4)(001)]? I do not know where to even begin to solve this. Please help!!

Prove that the poset has a unique least element, Prove that the Poset has a...

Prove that the Poset has a unique least element Prove that if (A, ) has a least element, then (A,≤)  has a unique least element. Ans: Let (A, ≤) be a poset. Suppose the po

Binary to decimal, 01010011 01100101 01101101 01110000 01100101 01110010 00...

01010011 01100101 01101101 01110000 01100101 01110010 00100000 01000110 01101001 00100001

Determine the permutation, There are 6 contestants for the post of chairman...

There are 6 contestants for the post of chairman secretary and treasurer. These positions can be filled by any of the 6. Find the possible no. of ways whether the 3 positions may b

Calculate the score of contestant on a tv game show, Danny is a contestant ...

Danny is a contestant on a TV game show. If he gets a question right, the points for that question are added to his score. If he gets a question wrong, the points for that question

What is equivalence relation, What is equivalence relation?  Prove that rel...

What is equivalence relation?  Prove that relation  'congruence modulo' (  ≡mod m) is an equivalence relation.  Ans: A relation R illustrated on a nonempty set A is said to be

#title., Julia must do a 70:30 split of all of her profits with the Departm...

Julia must do a 70:30 split of all of her profits with the Department of Athletics. Julia also has the ability to sell soft drinks. If she decide to sell soft drinks, she must agre

Homomorphism, Let G be a group acting on a set X. The action is called fait...

Let G be a group acting on a set X. The action is called faithful if for any g ≠ 1 ∈ G there exists an x ∈ X such that gx ≠ x. That is, only the identity fi xes everything. Prov

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd