4. Let F : A --> B, g : B --> C, and h : B --> C be functions, and suppose that f is onto. Prove or disprove the following statement: If g (f) = h (f) then g = h 4a. Prove that for any natural number n > 3, at least one for the three numbers n, n+2, n+4 is not prime. (for example, if n = 7, the numbers are 7, 9, 11, and 9 is not prime. If n =21, the numbers are 21, 23, 25, and both 21 and 25 are not prime)

4. Let F : A --> B, g : B --> C, and h : B --> C be functions, and suppose that f is onto. Prove or disprove the following statement: If g (f) = h (f) then g = h 4a. Prove that for any natural number n > 3, at least one for the three numbers n, n+2, n+4 is not prime. (for example, if n = 7, the numbers are 7, 9, 11, and 9 is not prime. If n =21, the numbers are 21, 23, 25, and both 21 and 25 are not prime)

Elements Of Modern Algebra

8th Edition

ISBN:9781285463230

Author:Gilbert, Linda, Jimmie

Publisher:Gilbert, Linda, Jimmie

Chapter1: Fundamentals

Section1.4: Binary Operations

Problem 9E: 9. The definition of an even integer was stated in Section 1.2. Prove or disprove that the set of...

See similar textbooks

Similar questions

30. Prove statement of Theorem : for all integers .
Let a and b be constant integers with a0, and let the mapping f:ZZ be defined by f(x)=ax+b. Prove that f is one-to-one. Prove that f is onto if and only if a=1 or a=1.
Prove that if f is a permutation on A, then (f1)1=f.
21. A relation on a nonempty set is called irreflexive if for all. Which of the relations in Exercise 2 are irreflexive? 2. In each of the following parts, a relation is defined on the set of all integers. Determine in each case whether or not is reflexive, symmetric, or transitive. Justify your answers. a. if and only if b. if and only if c. if and only if for some in . d. if and only if e. if and only if f. if and only if g. if and only if h. if and only if i. if and only if j. if and only if. k. if and only if.
2. In each of the following parts, a relation is defined on the set of all integers. Determine in each case whether or not is reflexive, symmetric or transitive. Justify your answers. a. if and only if . b. if and only if . c. if and only if for some in . d. if and only if . e. if and only if . f. if and only if . g. if and only if . h. if and only if . i. if and only if . j. if and only if . k. if and only if .
9. The definition of an even integer was stated in Section 1.2. Prove or disprove that the set of all even integers is closed with respect to a. addition defined on . b. multiplication defined on .
6. Prove that if is a permutation on , then is a permutation on .
Let f(x),g(x),h(x)F[x] where f(x) and g(x) are relatively prime. If h(x)f(x), prove that h(x) and g(x) are relatively prime.
Let be as described in the proof of Theorem. Give a specific example of a positive element of .