Quick question about surjective functions

In summary, The function f(a/b) = 2^a * 3^b, where (a/b) is in lowest terms, is onto because for every natural number y, there exists (a/b) such that f(x) = y. However, this does not hold true for all rational numbers and it is not injective.
  • #1
jaejoon89
195
0
Question Details:
f(a/b) = 2^a * 3^b where (a/b) is in lowest terms.

Show f is surjective (onto).

Note: f maps positive integers to natural numbers


---

Is it sufficient to say that...

It is onto because for every natural number y there is (a/b) s.t. f(x) = y.
 
Physics news on Phys.org
  • #2
I think you have misunderstood the question.
f(a/b) suggests that f maps from rational numbers and not positive integers. If it mapped from positive integers we would have b=1 always. However even then f isn't surjective. Can you find an a/b in lowest terms such that 2^a * 3^b = 5?

It is onto because for every natural number y there is (a/b) s.t. f(x) = y.
No. Here you just state the definition of a surjective function. You never show that y actually exists.

Perhaps you're really supposed to show it's injective as a function from the rational numbers to the natural numbers?
 

1. What is a surjective function?

A surjective function is a type of function in mathematics where every element in the output set has at least one corresponding element in the input set. This means that every element in the output set is mapped to by at least one element in the input set.

2. How is a surjective function different from an injective function?

A surjective function is different from an injective function because an injective function maps each element in the input set to a unique element in the output set, while a surjective function can map multiple elements in the input set to the same element in the output set.

3. Can a function be both surjective and injective?

Yes, a function can be both surjective and injective. This type of function is called a bijective function. In a bijective function, each element in the input set is mapped to a unique element in the output set, and every element in the output set has at least one corresponding element in the input set.

4. How do you prove that a function is surjective?

To prove that a function is surjective, you need to show that every element in the output set has at least one corresponding element in the input set. This can be done by assuming an arbitrary element in the output set and then finding the element in the input set that maps to it.

5. Can a surjective function have an infinite number of elements in its input set?

Yes, a surjective function can have an infinite number of elements in its input set. As long as every element in the output set has at least one corresponding element in the input set, the function is considered surjective, regardless of the size of the input set.

Similar threads

  • Calculus and Beyond Homework Help
Replies
1
Views
505
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
9
Views
2K
  • Calculus and Beyond Homework Help
Replies
24
Views
3K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
550
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Precalculus Mathematics Homework Help
Replies
4
Views
2K
  • Calculus and Beyond Homework Help
Replies
7
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
287
Back
Top