   Chapter 7.2, Problem 24ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
8 views

# Les S be the set of all strings of a’s and b’s, and define N : S → Z by N ( s ) = the number of a’s in s. for each s ∈ S . Is N one-to-one? Prove or given a counterexample. Is N onto? Prove or give a counterexample.

To determine

(a)

To check:

Whether N is one-to-one or not.

Explanation

Given information:

A function N:S is defined by N(s)= the number of a's in s for all sS.

Concept used:

In one-to-one function, distinct elements in domain are mapped with distinct elements in co-domain.

Calculation:

The objective is to show that N is one to one.

Suppose s1=aaabb and s2=ab

To determine

(b)

To check:

Whether N is onto or not.

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 