A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
what is a function? just a simple question. who can answer?
anonymous
 5 years ago
what is a function? just a simple question. who can answer?

This Question is Closed

amistre64
 5 years ago
Best ResponseYou've already chosen the best response.0a function is defined as for any one input; there is only one output that can be produced

amistre64
 5 years ago
Best ResponseYou've already chosen the best response.0a relation exists between any given sets of data; but a function is useful in that we can use it to predict events

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Let A and B be sets of numbers. A function f is a rule that assigns each element of A to a unique element of B.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0what if B has infinitely many element from A ., is that can be called as a function?

amistre64
 5 years ago
Best ResponseYou've already chosen the best response.0If A results in many B's then a relation exists; but not a function

amistre64
 5 years ago
Best ResponseYou've already chosen the best response.0If B results from multiple A's, then a function can be determined to best match the results

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0give all the functions. A={1,2,3} B={d,f}

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0There are infinitely many.

amistre64
 5 years ago
Best ResponseYou've already chosen the best response.0are you mapping A into B?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Let A={x: x=1,2 or 3} and B={d or f}. Then\[f:A \rightarrow B \] where f can be any function.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Can you show it for me all the functions?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0No. And here are some corrections: B={g(x): g(x)=d or f} and g: A > B.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Suppose that the set C containing all g such that g: x > g(x) (where x is in A and g(x) is in B) is finite. Then there exists a h in C such that h: x > h(x), where h(x) is in B. But h1= h(x)+11 is also in C, and so is h2=h1+11, and so is h3=h2+11, . . . Therefore, C is infinite. This is a contradiction. Therefore, C must be infinite.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0And therefore there are infinitely many g.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0No: wait. I have made an error. Two function are the same if their domains (A in this case), codomains (B), and effects are the same. Thus h=h1=h2= . . . However, I still cannot list all functions g by the same argument as in the above comment. Can you see why?
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.