recall that n = {1,2,3….}. let f: n -> n be defined by f(x) = x+1. give a counterexample to the claim that f is onto.
also, let g: r -> r be defined by g(x)=x2. give a counterexample to the claim that g is one to one.

 The examples are given below.

Step-by-step explanation:  Given that N = {1, 2, 3, . . .}. A function f : N --> N is defined by

f(x) = x + 1.

We are to give a counterexample to the claim that f is onto.

Let us consider the element 1 in he co domain N such that

Since 0 does not belong to N, so there exists an element in the domain whose image does not exist in the co domain.

Therefore, the given function is NOT onto.

We are given another function g : R --> R defined by

g(x) = x².

We are to give a counterexample to the claim that g is one to one.

Let us consider the element 1 in the co domain R.

We see that

So, there exists two elements 1 and -1 in the domain having the same image 1 in the co domain.

Therefore, the function g(x) is not one to one.