You can choose multiple op tions if necessary. Which of the following relation/s is/are FUNCTION/S? = {(2, 1), (2, 2) , (3, 1), (4, 1) , (4, 2)} R = {(2,1) , (3, 1),(4, 1)} {(2,1), (3, 1), (4, 1), (4, –1)} R = |R= {(2,1), (5, 2) , (3, 2), (4, 1)} ]R= {(1,1), (2,2), (3, 3), (1, 4)} Submit You have used 0 of 2 attemp ts Save

Calculus: Early Transcendentals
8th Edition
ISBN:9781285741550
Author:James Stewart
Publisher:James Stewart
Chapter1: Functions And Models
Section: Chapter Questions
Problem 1RCC: (a) What is a function? What are its domain and range? (b) What is the graph of a function? (c) How...
icon
Related questions
Question
need the solves asap plz
You can choose multiple op tions if necessary.
Which of the following relation/s is/are FUNCTION/S?
= {(2, 1), (2, 2) , (3, 1), (4, 1) , (4, 2)}
R= {(2,1) , (3, 1) ,(4, 1)}
R =
{(2, 1), (3, 1) , (4, 1), (4, –1)}
= {(2,1), (5, 2) , (3, 2), (4, 1)}
]R= {(1,1), (2,2), (3, 3) , (1, 4)}
Submit
You have used 0 of 2 attempts
Save
Combinatorics
Suppose, you have 3 different caps, 4 different shirts, 3 different pants and 3 pairs of socks and 2 pairs of shoes. In how
many different ways can you dress up today? It's not compulsory for you to wear caps or socks. But you must wear a
shirt and a pant and a pair of shoes.
Submit
You have used 0 of 2 attemp ts
Save
Combinatorics
Consider binary strings of length 7. How many binary strings are there so that there are at most three 1's and no two 1s
are adjacent? For example, 0000000, 0101010, 0100100 etc.
Transcribed Image Text:You can choose multiple op tions if necessary. Which of the following relation/s is/are FUNCTION/S? = {(2, 1), (2, 2) , (3, 1), (4, 1) , (4, 2)} R= {(2,1) , (3, 1) ,(4, 1)} R = {(2, 1), (3, 1) , (4, 1), (4, –1)} = {(2,1), (5, 2) , (3, 2), (4, 1)} ]R= {(1,1), (2,2), (3, 3) , (1, 4)} Submit You have used 0 of 2 attempts Save Combinatorics Suppose, you have 3 different caps, 4 different shirts, 3 different pants and 3 pairs of socks and 2 pairs of shoes. In how many different ways can you dress up today? It's not compulsory for you to wear caps or socks. But you must wear a shirt and a pant and a pair of shoes. Submit You have used 0 of 2 attemp ts Save Combinatorics Consider binary strings of length 7. How many binary strings are there so that there are at most three 1's and no two 1s are adjacent? For example, 0000000, 0101010, 0100100 etc.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Calculus: Early Transcendentals
Calculus: Early Transcendentals
Calculus
ISBN:
9781285741550
Author:
James Stewart
Publisher:
Cengage Learning
Thomas' Calculus (14th Edition)
Thomas' Calculus (14th Edition)
Calculus
ISBN:
9780134438986
Author:
Joel R. Hass, Christopher E. Heil, Maurice D. Weir
Publisher:
PEARSON
Calculus: Early Transcendentals (3rd Edition)
Calculus: Early Transcendentals (3rd Edition)
Calculus
ISBN:
9780134763644
Author:
William L. Briggs, Lyle Cochran, Bernard Gillett, Eric Schulz
Publisher:
PEARSON
Calculus: Early Transcendentals
Calculus: Early Transcendentals
Calculus
ISBN:
9781319050740
Author:
Jon Rogawski, Colin Adams, Robert Franzosa
Publisher:
W. H. Freeman
Precalculus
Precalculus
Calculus
ISBN:
9780135189405
Author:
Michael Sullivan
Publisher:
PEARSON
Calculus: Early Transcendental Functions
Calculus: Early Transcendental Functions
Calculus
ISBN:
9781337552516
Author:
Ron Larson, Bruce H. Edwards
Publisher:
Cengage Learning