Function proof as one to one

  • Thread starter cue928
  • Start date
  • #1
130
0
I am being asked to prove the following:
f: Z --> Z by f(n) = |2n-1| is not one to one and g:{n element of Z|n>=10} --> Z with g(n) = |2n-1| is one to one. Can anyone help me get started on this? The example done in class involved substituting in and finding out if the values were equal. Maybe it's the absolute value bars, not sure how to prove this in this instance.

Incidentally, can you have a discussion about functions without having discussed cartesian products of sets and also relations?
 

Answers and Replies

  • #2
SammyS
Staff Emeritus
Science Advisor
Homework Helper
Gold Member
11,388
1,044
A graph should help you see what's going on -- even if you can't use it in your formal solution.
 
  • #3
912
19
see when function is one to one it means that whenever you have f(x1)=f(x2) it implies x1=x2....

so to prove that a function is NOT one to one, you have to come up with a counterexample where f(x1)=f(x2) is true and x1=x2 is false.
now for function f , what can you tell about the ordered pairs (0,1) and (1,1) ?
 

Related Threads on Function proof as one to one

  • Last Post
Replies
4
Views
1K
  • Last Post
Replies
1
Views
984
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
7
Views
3K
  • Last Post
Replies
5
Views
1K
Replies
2
Views
4K
  • Last Post
Replies
8
Views
4K
  • Last Post
Replies
8
Views
2K
  • Last Post
Replies
7
Views
1K
  • Last Post
Replies
2
Views
3K
Top