
BIG IDEAS MATH Integrated Math 1: Student Edition 2016
16th Edition
ISBN: 9781680331127
Author: HOUGHTON MIFFLIN HARCOURT
Publisher: Houghton Mifflin Harcourt
expand_more
expand_more
format_list_bulleted
Question
Chapter 3.6, Problem 43E
To determine
The transformations from the graph of f to the graph of h.
Expert Solution & Answer

Answer to Problem 43E
The graph of f is vertically stretched by 4 units followed by a reflection on x-axis and vertical translation by 4 units down.
Explanation of Solution
Given:
The given functions are:
f(x)=x;h(x)=−3x−4
Calculation:
The graph of f is vertically stretched by 4 units followed by a reflection on x-axis and vertical translation by 4 units down.
Chapter 3 Solutions
BIG IDEAS MATH Integrated Math 1: Student Edition 2016
Ch. 3.1 - Prob. 1ECh. 3.1 - Prob. 2ECh. 3.1 - Prob. 3ECh. 3.1 - Prob. 4ECh. 3.1 - Prob. 5ECh. 3.1 - Prob. 6ECh. 3.1 - Prob. 7ECh. 3.1 - Prob. 8ECh. 3.1 - Prob. 9ECh. 3.1 - Prob. 10E
Ch. 3.1 - Prob. 11ECh. 3.1 - Prob. 12ECh. 3.1 - Prob. 13ECh. 3.1 - Prob. 14ECh. 3.1 - Prob. 15ECh. 3.1 - Prob. 16ECh. 3.1 - Prob. 17ECh. 3.1 - Prob. 18ECh. 3.1 - Prob. 19ECh. 3.1 - Prob. 20ECh. 3.1 - Prob. 21ECh. 3.1 - Prob. 22ECh. 3.1 - Prob. 23ECh. 3.1 - Prob. 24ECh. 3.1 - Prob. 25ECh. 3.1 - Prob. 26ECh. 3.1 - Prob. 27ECh. 3.1 - Prob. 28ECh. 3.1 - Prob. 29ECh. 3.1 - Prob. 30ECh. 3.1 - Prob. 31ECh. 3.1 - Prob. 32ECh. 3.1 - Prob. 33ECh. 3.1 - Prob. 34ECh. 3.1 - Prob. 35ECh. 3.1 - Prob. 36ECh. 3.1 - Prob. 37ECh. 3.1 - Prob. 38ECh. 3.1 - Prob. 39ECh. 3.1 - Prob. 40ECh. 3.1 - Prob. 41ECh. 3.1 - Prob. 42ECh. 3.1 - Prob. 43ECh. 3.1 - Prob. 44ECh. 3.1 - Prob. 45ECh. 3.1 - Prob. 46ECh. 3.1 - Prob. 47ECh. 3.1 - Prob. 48ECh. 3.1 - Prob. 49ECh. 3.1 - Prob. 50ECh. 3.1 - Prob. 51ECh. 3.2 - Prob. 1ECh. 3.2 - Prob. 2ECh. 3.2 - Prob. 3ECh. 3.2 - Prob. 4ECh. 3.2 - Prob. 5ECh. 3.2 - Prob. 6ECh. 3.2 - Prob. 7ECh. 3.2 - Prob. 8ECh. 3.2 - Prob. 9ECh. 3.2 - Prob. 10ECh. 3.2 - Prob. 11ECh. 3.2 - Prob. 12ECh. 3.2 - Prob. 13ECh. 3.2 - Prob. 14ECh. 3.2 - Prob. 15ECh. 3.2 - Prob. 16ECh. 3.2 - Prob. 17ECh. 3.2 - Prob. 18ECh. 3.2 - Prob. 19ECh. 3.2 - Prob. 20ECh. 3.2 - Prob. 21ECh. 3.2 - Prob. 22ECh. 3.2 - Prob. 23ECh. 3.2 - Prob. 24ECh. 3.2 - Prob. 25ECh. 3.2 - Prob. 26ECh. 3.2 - Prob. 27ECh. 3.2 - Prob. 28ECh. 3.2 - Prob. 29ECh. 3.2 - Prob. 30ECh. 3.2 - Prob. 31ECh. 3.2 - Prob. 32ECh. 3.2 - Prob. 33ECh. 3.2 - Prob. 34ECh. 3.2 - Prob. 35ECh. 3.2 - Prob. 36ECh. 3.2 - Prob. 37ECh. 3.2 - Prob. 38ECh. 3.2 - Prob. 39ECh. 3.2 - Prob. 40ECh. 3.2 - Prob. 41ECh. 3.2 - Prob. 42ECh. 3.2 - Prob. 43ECh. 3.2 - Prob. 44ECh. 3.2 - Prob. 45ECh. 3.2 - Prob. 46ECh. 3.2 - Prob. 47ECh. 3.2 - Prob. 48ECh. 3.2 - Prob. 49ECh. 3.2 - Prob. 50ECh. 3.2 - Prob. 51ECh. 3.2 - Prob. 52ECh. 3.2 - Prob. 53ECh. 3.2 - Prob. 54ECh. 3.2 - Prob. 55ECh. 3.2 - Prob. 56ECh. 3.2 - Prob. 57ECh. 3.2 - Prob. 58ECh. 3.2 - Prob. 59ECh. 3.2 - Prob. 60ECh. 3.2 - Prob. 61ECh. 3.3 - Prob. 1ECh. 3.3 - Prob. 2ECh. 3.3 - Prob. 3ECh. 3.3 - Prob. 4ECh. 3.3 - Prob. 5ECh. 3.3 - Prob. 6ECh. 3.3 - Prob. 7ECh. 3.3 - Prob. 8ECh. 3.3 - Prob. 9ECh. 3.3 - Prob. 10ECh. 3.3 - Prob. 11ECh. 3.3 - Prob. 12ECh. 3.3 - Prob. 13ECh. 3.3 - Prob. 14ECh. 3.3 - Prob. 15ECh. 3.3 - Prob. 16ECh. 3.3 - Prob. 17ECh. 3.3 - Prob. 18ECh. 3.3 - Prob. 19ECh. 3.3 - Prob. 20ECh. 3.3 - Prob. 21ECh. 3.3 - Prob. 22ECh. 3.3 - Prob. 23ECh. 3.3 - Prob. 24ECh. 3.3 - Prob. 25ECh. 3.3 - Prob. 26ECh. 3.3 - Prob. 27ECh. 3.3 - Prob. 28ECh. 3.3 - Prob. 29ECh. 3.3 - Prob. 30ECh. 3.3 - Prob. 31ECh. 3.3 - Prob. 32ECh. 3.3 - Prob. 33ECh. 3.3 - Prob. 34ECh. 3.3 - Prob. 35ECh. 3.3 - Prob. 36ECh. 3.3 - Prob. 37ECh. 3.3 - Prob. 38ECh. 3.3 - Prob. 39ECh. 3.3 - Prob. 40ECh. 3.3 - Prob. 41ECh. 3.3 - Prob. 42ECh. 3.3 - Prob. 1QCh. 3.3 - Prob. 2QCh. 3.3 - Prob. 3QCh. 3.3 - Prob. 4QCh. 3.3 - Prob. 5QCh. 3.3 - Prob. 6QCh. 3.3 - Prob. 7QCh. 3.3 - Prob. 8QCh. 3.3 - Prob. 9QCh. 3.3 - Prob. 10QCh. 3.3 - Prob. 11QCh. 3.3 - Prob. 12QCh. 3.3 - Prob. 13QCh. 3.3 - Prob. 14QCh. 3.3 - Prob. 15QCh. 3.3 - Prob. 16QCh. 3.4 - Prob. 1ECh. 3.4 - Prob. 2ECh. 3.4 - Prob. 3ECh. 3.4 - Prob. 4ECh. 3.4 - Prob. 5ECh. 3.4 - Prob. 6ECh. 3.4 - Prob. 7ECh. 3.4 - Prob. 8ECh. 3.4 - Prob. 9ECh. 3.4 - Prob. 10ECh. 3.4 - Prob. 11ECh. 3.4 - Prob. 12ECh. 3.4 - Prob. 13ECh. 3.4 - Prob. 14ECh. 3.4 - Prob. 15ECh. 3.4 - Prob. 16ECh. 3.4 - Prob. 17ECh. 3.4 - Prob. 18ECh. 3.4 - Prob. 19ECh. 3.4 - Prob. 20ECh. 3.4 - Prob. 21ECh. 3.4 - Prob. 22ECh. 3.4 - Prob. 23ECh. 3.4 - Prob. 24ECh. 3.4 - Prob. 25ECh. 3.4 - Prob. 26ECh. 3.4 - Prob. 27ECh. 3.4 - Prob. 28ECh. 3.4 - Prob. 29ECh. 3.4 - Prob. 30ECh. 3.4 - Prob. 31ECh. 3.4 - Prob. 32ECh. 3.4 - Prob. 33ECh. 3.4 - Prob. 34ECh. 3.4 - Prob. 35ECh. 3.4 - Prob. 36ECh. 3.4 - Prob. 37ECh. 3.4 - Prob. 38ECh. 3.4 - Prob. 39ECh. 3.4 - Prob. 40ECh. 3.4 - Prob. 41ECh. 3.4 - Prob. 42ECh. 3.5 - Prob. 1ECh. 3.5 - Prob. 2ECh. 3.5 - Prob. 3ECh. 3.5 - Prob. 4ECh. 3.5 - Prob. 5ECh. 3.5 - Prob. 6ECh. 3.5 - Prob. 7ECh. 3.5 - Prob. 8ECh. 3.5 - Prob. 9ECh. 3.5 - Prob. 10ECh. 3.5 - Prob. 11ECh. 3.5 - Prob. 12ECh. 3.5 - Prob. 13ECh. 3.5 - Prob. 14ECh. 3.5 - Prob. 15ECh. 3.5 - Prob. 16ECh. 3.5 - Prob. 17ECh. 3.5 - Prob. 18ECh. 3.5 - Prob. 19ECh. 3.5 - Prob. 20ECh. 3.5 - Prob. 21ECh. 3.5 - Prob. 22ECh. 3.5 - Prob. 23ECh. 3.5 - Prob. 24ECh. 3.5 - Prob. 25ECh. 3.5 - Prob. 26ECh. 3.5 - Prob. 27ECh. 3.5 - Prob. 28ECh. 3.5 - Prob. 29ECh. 3.5 - Prob. 30ECh. 3.5 - Prob. 31ECh. 3.5 - Prob. 32ECh. 3.5 - Prob. 33ECh. 3.5 - Prob. 34ECh. 3.5 - Prob. 35ECh. 3.5 - Prob. 36ECh. 3.5 - Prob. 37ECh. 3.5 - Prob. 38ECh. 3.5 - Prob. 39ECh. 3.5 - Prob. 40ECh. 3.5 - Prob. 41ECh. 3.5 - Prob. 42ECh. 3.5 - Prob. 43ECh. 3.5 - Prob. 44ECh. 3.5 - Prob. 45ECh. 3.5 - Prob. 46ECh. 3.5 - Prob. 47ECh. 3.5 - Prob. 48ECh. 3.5 - Prob. 49ECh. 3.5 - Prob. 50ECh. 3.5 - Prob. 51ECh. 3.5 - Prob. 52ECh. 3.5 - Prob. 53ECh. 3.5 - Prob. 54ECh. 3.5 - Prob. 55ECh. 3.5 - Prob. 56ECh. 3.5 - Prob. 57ECh. 3.5 - Prob. 58ECh. 3.5 - Prob. 59ECh. 3.5 - Prob. 60ECh. 3.6 - Prob. 1ECh. 3.6 - Prob. 2ECh. 3.6 - Prob. 3ECh. 3.6 - Prob. 4ECh. 3.6 - Prob. 5ECh. 3.6 - Prob. 6ECh. 3.6 - Prob. 7ECh. 3.6 - Prob. 8ECh. 3.6 - Prob. 9ECh. 3.6 - Prob. 10ECh. 3.6 - Prob. 11ECh. 3.6 - Prob. 12ECh. 3.6 - Prob. 13ECh. 3.6 - Prob. 14ECh. 3.6 - Prob. 15ECh. 3.6 - Prob. 16ECh. 3.6 - Prob. 17ECh. 3.6 - Prob. 18ECh. 3.6 - Prob. 19ECh. 3.6 - Prob. 20ECh. 3.6 - Prob. 21ECh. 3.6 - Prob. 22ECh. 3.6 - Prob. 23ECh. 3.6 - Prob. 24ECh. 3.6 - Prob. 25ECh. 3.6 - Prob. 26ECh. 3.6 - Prob. 27ECh. 3.6 - Prob. 28ECh. 3.6 - Prob. 29ECh. 3.6 - Prob. 30ECh. 3.6 - Prob. 31ECh. 3.6 - Prob. 32ECh. 3.6 - Prob. 33ECh. 3.6 - Prob. 34ECh. 3.6 - Prob. 35ECh. 3.6 - Prob. 36ECh. 3.6 - Prob. 37ECh. 3.6 - Prob. 38ECh. 3.6 - Prob. 39ECh. 3.6 - Prob. 40ECh. 3.6 - Prob. 41ECh. 3.6 - Prob. 42ECh. 3.6 - Prob. 43ECh. 3.6 - Prob. 44ECh. 3.6 - Prob. 45ECh. 3.6 - Prob. 46ECh. 3.6 - Prob. 47ECh. 3.6 - Prob. 48ECh. 3.6 - Prob. 49ECh. 3.6 - Prob. 50ECh. 3.6 - Prob. 51ECh. 3.6 - Prob. 52ECh. 3.6 - Prob. 53ECh. 3.6 - Prob. 54ECh. 3.6 - Prob. 55ECh. 3.6 - Prob. 56ECh. 3.6 - Prob. 57ECh. 3.6 - Prob. 58ECh. 3.6 - Prob. 59ECh. 3.6 - Prob. 60ECh. 3.6 - Prob. 61ECh. 3.6 - Prob. 62ECh. 3.6 - Prob. 63ECh. 3.6 - Prob. 64ECh. 3.6 - Prob. 65ECh. 3.6 - Prob. 66ECh. 3.6 - Prob. 67ECh. 3.6 - Prob. 68ECh. 3.6 - Prob. 69ECh. 3.6 - Prob. 70ECh. 3.6 - Prob. 71ECh. 3.6 - Prob. 72ECh. 3.6 - Prob. 73ECh. 3.6 - Prob. 74ECh. 3 - Prob. 1CRCh. 3 - Prob. 2CRCh. 3 - Prob. 3CRCh. 3 - Prob. 4CRCh. 3 - Prob. 5CRCh. 3 - Prob. 6CRCh. 3 - Prob. 7CRCh. 3 - Prob. 8CRCh. 3 - Prob. 9CRCh. 3 - Prob. 10CRCh. 3 - Prob. 11CRCh. 3 - Prob. 12CRCh. 3 - Prob. 13CRCh. 3 - Prob. 14CRCh. 3 - Prob. 15CRCh. 3 - Prob. 16CRCh. 3 - Prob. 17CRCh. 3 - Prob. 18CRCh. 3 - Prob. 19CRCh. 3 - Prob. 20CRCh. 3 - Prob. 21CRCh. 3 - Prob. 22CRCh. 3 - Prob. 23CRCh. 3 - Prob. 24CRCh. 3 - Prob. 25CRCh. 3 - Prob. 26CRCh. 3 - Prob. 27CRCh. 3 - Prob. 28CRCh. 3 - Prob. 1CTCh. 3 - Prob. 2CTCh. 3 - Prob. 3CTCh. 3 - Prob. 4CTCh. 3 - Prob. 5CTCh. 3 - Prob. 6CTCh. 3 - Prob. 7CTCh. 3 - Prob. 8CTCh. 3 - Prob. 9CTCh. 3 - Prob. 10CTCh. 3 - Prob. 11CTCh. 3 - Prob. 12CTCh. 3 - Prob. 13CTCh. 3 - Prob. 14CTCh. 3 - Prob. 15CTCh. 3 - Prob. 16CTCh. 3 - Prob. 1CACh. 3 - Prob. 2CACh. 3 - Prob. 3CACh. 3 - Prob. 4CACh. 3 - Prob. 5CACh. 3 - Prob. 6CACh. 3 - Prob. 7CACh. 3 - Prob. 8CACh. 3 - Prob. 9CACh. 3 - Prob. 10CA
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Select all solids for which the formula V = Bh applies. A. a triangular prism B. a triangular pyramid C. a square pyramid D. a rectangular prism E. a cone F. a cylinderarrow_forward1. For the following subsets of R3, explain whether or not they are a subspace of R³. (a) (b) 1.1 0.65 U = span -3.4 0.23 0.4 -0.44 0 (})} a V {(2) | ER (c) Z= the points in the z-axisarrow_forwardShow that i cote +1 = cosec 20 tan 20+1 = sec² O २ cos² + sin 20 = 1 using pythagon's theoremarrow_forward
- This is my h/w ,Required to find the region of shaded sector ,I don't really know how to deal with this tasks ,so if someone could help me to understand them it would be awesome,and sorry for my poor Englisharrow_forwardThe U.S. Postal Service will ship a Priority Mail® Large Flat Rate Box (12" 3 12" 3 5½") any where in the United States for a fixed price, regardless of weight. The weights (ounces) of 20 ran domly chosen boxes are shown below. (a) Make a stem-and-leaf diagram. (b) Make a histogram. (c) Describe the shape of the distribution. Weights 72 86 28 67 64 65 45 86 31 32 39 92 90 91 84 62 80 74 63 86arrow_forward(a) What is a bimodal histogram? (b) Explain the difference between left-skewed, symmetric, and right-skewed histograms. (c) What is an outlierarrow_forward
- △DEF△DEF has vertices D(0, 2) and F(6, 2). If △DEF△DEF has an area of 12 square units, select all the possible coordinates for E.arrow_forward2. In a computer network some pairs of computers are connected by network cables. Your goal is to set up the computers so that messages can be sent quickly from any computer to any other computer. For this you have identified each of the n com- puters uniquely with a number between 1 and n, and have decided that a message should consist of two such numbers, identifying the sender and the recipient, fol- lowed by the content of the message. As cables are relatively short, you can assume that sending a message across a single cable takes an amount of time that is the same irrespective of the length of the cable. You can further assume that at most one message travels between computer at any point, so that you don't have to worry about inference among messages. (a) Define a graph or network that models the computer network and allows you to answer the remaining parts of this question. (b) Consider two computers, a sender and a recipient. Using the graph or network you have defined,…arrow_forward3. A spreadsheet consists of cells indexed by a row and a column. Each cell contains either a value or a formula that depends on the values of other cells. (a) Describe a graph, digraph, or network that models an arbitrary spreadsheet and allows you to answer the remaining parts of this question. (b) Explain, by referring to the graph, digraph, or network, when it is possible to change the value of cell x without changing the value of cell y. (c) Explain, by referring to the graph, digraph, or network, when it is possible to calculate the values of all cells in the spreadsheet. Consider the following spreadsheet with 5 rows, 7 columns, and 35 cells. For exam- ple, cell el contains a value, whereas cell al contains a formula that depends on the values cells el and 95. a b с 1 el+g5 al-c5 110 d al+cl 180 e f g f5-el c1+c2 2 al+b1 a2+c4 240 a2+c2 120 f5-e2 e3+e5 3 a2+b2 a3-c3 100 a3+c1 200 f5-e3 f1+f2 4 a3+b3 a4+c2 220 a4+c2 100 f5-e4 f3+f4 5 a4+b4 a5-c1 130 a5+c5 120 g3+g4 g1+g2 (d) Can…arrow_forward
- 1. Let W, U, and S be graphs defined as follows: • V(W) is the set of countries in the world; • V(U) is the set of countries in the European Union; V(S) is the set of countries in the Schengen Area; ● for X = {W,U,S}, E(X) is the set of pairs of countries in V(X) that share a land border. Recall that land borders between countries in the Schengen Area are special in that they can be crossed without a passport. (a) The notions of a country and a land border are somewhat ambiguous. Explain the notions you will use to get a precise definition of the graphs W, U, and S. (b) Is S a subgraph of U? Is U an induced subgraph of W? Justify your answers. (c) Using non-mathematical language, explain what it means for a country x if VEV(S) and dw (v) = 0. Give all such countries. Let A = {v Є V(W) \V(S) such that |Nw(v)| > 0 and Nw (v) ≤ V(S)}. (d) Using non-mathematical language, explain what the set A represents in terms of countries and land borders. Give a specific element of A or explain why A…arrow_forward3. A spreadsheet consists of cells indexed by a row and a column. Each cell contains either a value or a formula that depends on the values of other cells. (a) Describe a graph, digraph, or network that models an arbitrary spreadsheet and allows you to answer the remaining parts of this question. (b) Explain, by referring to the graph, digraph, or network, when it is possible to change the value of cell x without changing the value of cell y. (c) Explain, by referring to the graph, digraph, or network, when it is possible to calculate the values of all cells in the spreadsheet. Consider the following spreadsheet with 5 rows, 7 columns, and 35 cells. For exam- ple, cell el contains a value, whereas cell al contains a formula that depends on the values cells el and 95. a b с d e f g 1 el+g5 al-c5 110 al+cl 180 f5-el c1+c2 2 al+bl a2+c4 240 a2+c2 120 f5-e2 e3+e5 3 a2+b2 a3-c3 100 a3+c1 200 f5-e3 f1+f2 4 a3+b3 a4+c2 220 a4+c2 100 f5-e4 f3+f4 5 a4+b4 a5-c1 130 a5+c5 120 g3+g4 gl+g2 (d) Can…arrow_forwardt 56 65 33arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill EducationMathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
- Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSONDiscrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education

Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education

Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON


Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON

Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,

Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education
Orthogonality in Inner Product Spaces; Author: Study Force;https://www.youtube.com/watch?v=RzIx_rRo9m0;License: Standard YouTube License, CC-BY
Abstract Algebra: The definition of a Group; Author: Socratica;https://www.youtube.com/watch?v=QudbrUcVPxk;License: Standard Youtube License