Finite Mathematics
7th Edition
ISBN: 9781337280426
Author: Stefan Waner, Steven Costenoble
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter A, Problem 24E
To determine
The statement
Statement p: Willis is a good teacher.
Statement q: Carla is a good teacher.
Statement r: Willis’ students hate math.
Statement s: Carla’s students hate math.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Example: For what odd primes p is 11 a quadratic residue modulo p?
Solution:
This is really asking "when is (11 | p) =1?"
First, 11 = 3 (mod 4). To use LQR, consider two cases p = 1 or 3 (mod 4):
p=1 We have 1 = (11 | p) = (p | 11), so p is a quadratic residue modulo 11. By
brute force:
121, 224, 3² = 9, 4² = 5, 5² = 3 (mod 11)
so the quadratic residues mod 11 are 1,3,4,5,9.
Using CRT for p = 1 (mod 4) & p = 1,3,4,5,9 (mod 11).
p = 1
(mod 4)
&
p = 1
(mod 11
gives p
1
(mod 44).
p = 1
(mod 4)
&
p = 3
(mod 11)
gives p25
(mod 44).
p = 1
(mod 4)
&
p = 4
(mod 11)
gives p=37
(mod 44).
p = 1
(mod 4)
&
p = 5
(mod 11)
gives p
5
(mod 44).
p = 1
(mod 4)
&
p=9
(mod 11)
gives p
9
(mod 44).
So p =1,5,9,25,37 (mod 44).
Can you answer this question and give step by step and why and how to get it. Can you write it (numerical method)
Jamal wants to save $48,000 for a down payment on a home. How much will he need to invest in an
account with 11.8% APR, compounding daily, in order to reach his goal in 10 years? Round to the
nearest dollar.
Chapter A Solutions
Finite Mathematics
Ch. A - Which of Exercises 110 are statements? Comment on...Ch. A - Which of Exercises 110 are statements? Comment on...Ch. A - Prob. 3ECh. A - Prob. 4ECh. A - Prob. 5ECh. A - Prob. 6ECh. A - Prob. 7ECh. A - Prob. 8ECh. A - Prob. 9ECh. A - Prob. 10E
Ch. A - Prob. 11ECh. A - Prob. 12ECh. A - Prob. 13ECh. A - Prob. 14ECh. A - Prob. 15ECh. A - Prob. 16ECh. A - Prob. 17ECh. A - Let p: Willis is a good teacher, q: Carla is a...Ch. A - Prob. 19ECh. A - Prob. 20ECh. A - Let p: Willis is a good teacher, q: Carla is a...Ch. A - Prob. 22ECh. A - Prob. 23ECh. A - Prob. 24ECh. A - Prob. 25ECh. A - Prob. 26ECh. A - Prob. 27ECh. A - Prob. 28ECh. A - Prob. 29ECh. A - Prob. 30ECh. A - Prob. 31ECh. A - Prob. 32ECh. A - Prob. 33ECh. A - Prob. 34ECh. A - Prob. 35ECh. A - Prob. 36ECh. A - Prob. 37ECh. A - Prob. 38ECh. A - Prob. 39ECh. A - Prob. 40ECh. A - Prob. 41ECh. A - Prob. 42ECh. A - Prob. 43ECh. A - Prob. 44ECh. A - Find the truth value of each of the statements in...Ch. A - Prob. 46ECh. A - Prob. 47ECh. A - Prob. 48ECh. A - Prob. 49ECh. A - Prob. 50ECh. A - Prob. 51ECh. A - Prob. 52ECh. A - Prob. 53ECh. A - Prob. 54ECh. A - Prob. 55ECh. A - Prob. 56ECh. A - Prob. 57ECh. A - Prob. 58ECh. A - Prob. 59ECh. A - Prob. 60ECh. A - Prob. 61ECh. A - Construct the truth tables for the statements in...Ch. A - Prob. 63ECh. A - Prob. 64ECh. A - Use truth tables to verify the logical...Ch. A - Prob. 66ECh. A - Prob. 67ECh. A - Prob. 68ECh. A - Prob. 69ECh. A - Prob. 70ECh. A - Prob. 71ECh. A - Use truth tables to verify the logical...Ch. A - Prob. 73ECh. A - Prob. 74ECh. A - Prob. 75ECh. A - Prob. 76ECh. A - Prob. 77ECh. A - Prob. 78ECh. A - Prob. 79ECh. A - Prob. 80ECh. A - Prob. 81ECh. A - Prob. 82ECh. A - Prob. 83ECh. A - Prob. 84ECh. A - In Exercises 8588, use the given logical...Ch. A - In Exercises 8588, use the given logical...Ch. A - Prob. 87ECh. A - Prob. 88ECh. A - Prob. 89ECh. A - Give the contrapositive and converse of each of...Ch. A - Prob. 91ECh. A - Prob. 92ECh. A - Prob. 93ECh. A - Prob. 94ECh. A - Prob. 95ECh. A - Prob. 96ECh. A - Prob. 97ECh. A - Prob. 98ECh. A - Prob. 99ECh. A - Prob. 100ECh. A - Prob. 101ECh. A - In Exercises 93102, write the given argument in...Ch. A - Prob. 103ECh. A - Prob. 104ECh. A - Prob. 105ECh. A - Prob. 106ECh. A - Prob. 107ECh. A - Prob. 108ECh. A - Prob. 109ECh. A - Prob. 110ECh. A - Prob. 111ECh. A - Prob. 112ECh. A - Prob. 113ECh. A - Prob. 114ECh. A - Prob. 115E
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
- r nt Use the compound interest formula, A (t) = P(1 + 1)". An account is opened with an intial deposit of $7,500 and earns 3.8% interest compounded semi- annually. Round all answers to the nearest dollar. a. What will the account be worth in 10 years? $ b. What if the interest were compounding monthly? $ c. What if the interest were compounded daily (assume 365 days in a year)? $arrow_forwardKyoko has $10,000 that she wants to invest. Her bank has several accounts to choose from. Her goal is to have $15,000 by the time she finishes graduate school in 7 years. To the nearest hundredth of a percent, what should her minimum annual interest rate be in order to reach her goal assuming they compound daily? (Hint: solve the compound interest formula for the intrerest rate. Also, assume there are 365 days in a year) %arrow_forwardTest the claim that a student's pulse rate is different when taking a quiz than attending a regular class. The mean pulse rate difference is 2.7 with 10 students. Use a significance level of 0.005. Pulse rate difference(Quiz - Lecture) 2 -1 5 -8 1 20 15 -4 9 -12arrow_forward
- There are three options for investing $1150. The first earns 10% compounded annually, the second earns 10% compounded quarterly, and the third earns 10% compounded continuously. Find equations that model each investment growth and use a graphing utility to graph each model in the same viewing window over a 20-year period. Use the graph to determine which investment yields the highest return after 20 years. What are the differences in earnings among the three investment? STEP 1: The formula for compound interest is A = nt = P(1 + − − ) n², where n is the number of compoundings per year, t is the number of years, r is the interest rate, P is the principal, and A is the amount (balance) after t years. For continuous compounding, the formula reduces to A = Pert Find r and n for each model, and use these values to write A in terms of t for each case. Annual Model r=0.10 A = Y(t) = 1150 (1.10)* n = 1 Quarterly Model r = 0.10 n = 4 A = Q(t) = 1150(1.025) 4t Continuous Model r=0.10 A = C(t) =…arrow_forwardThe following ordered data list shows the data speeds for cell phones used by a telephone company at an airport: A. Calculate the Measures of Central Tendency from the ungrouped data list. B. Group the data in an appropriate frequency table. C. Calculate the Measures of Central Tendency using the table in point B. D. Are there differences in the measurements obtained in A and C? Why (give at least one justified reason)? I leave the answers to A and B to resolve the remaining two. 0.8 1.4 1.8 1.9 3.2 3.6 4.5 4.5 4.6 6.2 6.5 7.7 7.9 9.9 10.2 10.3 10.9 11.1 11.1 11.6 11.8 12.0 13.1 13.5 13.7 14.1 14.2 14.7 15.0 15.1 15.5 15.8 16.0 17.5 18.2 20.2 21.1 21.5 22.2 22.4 23.1 24.5 25.7 28.5 34.6 38.5 43.0 55.6 71.3 77.8 A. Measures of Central Tendency We are to calculate: Mean, Median, Mode The data (already ordered) is: 0.8, 1.4, 1.8, 1.9, 3.2, 3.6, 4.5, 4.5, 4.6, 6.2, 6.5, 7.7, 7.9, 9.9, 10.2, 10.3, 10.9, 11.1, 11.1, 11.6, 11.8, 12.0, 13.1, 13.5, 13.7, 14.1, 14.2, 14.7, 15.0, 15.1, 15.5,…arrow_forwardA tournament is a complete directed graph, for each pair of vertices x, y either (x, y) is an arc or (y, x) is an arc. One can think of this as a round robin tournament, where the vertices represent teams, each pair plays exactly once, with the direction of the arc indicating which team wins. (a) Prove that every tournament has a direct Hamiltonian path. That is a labeling of the teams V1, V2,..., Un so that vi beats Vi+1. That is a labeling so that team 1 beats team 2, team 2 beats team 3, etc. (b) A digraph is strongly connected if there is a directed path from any vertex to any other vertex. Equivalently, there is no partition of the teams into groups A, B so that every team in A beats every team in B. Prove that every strongly connected tournament has a directed Hamiltonian cycle. Use this to show that for any team there is an ordering as in part (a) for which the given team is first. (c) A king in a tournament is a vertex such that there is a direct path of length at most 2 to any…arrow_forward
- Use a graphing utility to find the point of intersection, if any, of the graphs of the functions. Round your result to three decimal places. (Enter NONE in any unused answer blanks.) y = 100e0.01x (x, y) = y = 11,250 ×arrow_forwardhow to construct the following same table?arrow_forwardThe following is known. The complete graph K2t on an even number of vertices has a 1- factorization (equivalently, its edges can be colored with 2t - 1 colors so that the edges incident to each vertex are distinct). This implies that the complete graph K2t+1 on an odd number of vertices has a factorization into copies of tK2 + K₁ (a matching plus an isolated vertex). A group of 10 people wants to set up a 45 week tennis schedule playing doubles, each week, the players will form 5 pairs. One of the pairs will not play, the other 4 pairs will each play one doubles match, two of the pairs playing each other and the other two pairs playing each other. Set up a schedule with the following constraints: Each pair of players is a doubles team exactly 4 times; during those 4 matches they see each other player exactly once; no two doubles teams play each other more than once. (a) Find a schedule. Hint - think about breaking the 45 weeks into 9 blocks of 5 weeks. Use factorizations of complete…arrow_forward
- . The two person game of slither is played on a graph. Players 1 and 2 take turns, building a path in the graph. To start, Player 1 picks a vertex. Player 2 then picks an edge incident to the vertex. Then, starting with Player 1, players alternate turns, picking a vertex not already selected that is adjacent to one of the ends of the path created so far. The first player who cannot select a vertex loses. (This happens when all neighbors of the end vertices of the path are on the path.) Prove that Player 2 has a winning strategy if the graph has a perfect matching and Player 1 has a winning strategy if the graph does not have a perfect matching. In each case describe a strategy for the winning player that guarantees that they will always be able to select a vertex. The strategy will be based on using a maximum matching to decide the next choice, and will, for one of the cases involve using the fact that maximality means no augmenting paths. Warning, the game slither is often described…arrow_forwardLet D be a directed graph, with loops allowed, for which the indegree at each vertex is at most k and the outdegree at each vertex is at most k. Prove that the arcs of D can be colored so that the arcs entering each vertex must have distinct colors and the arcs leaving each vertex have distinct colors. An arc entering a vertex may have the same color as an arc leaving it. It is probably easiest to make use of a known result about edge coloring. Think about splitting each vertex into an ‘in’ and ‘out’ part and consider what type of graph you get.arrow_forward3:56 wust.instructure.com Page 0 Chapter 5 Test Form A of 2 - ZOOM + | Find any real numbers for which each expression is undefined. 2x 4 1. x Name: Date: 1. 3.x-5 2. 2. x²+x-12 4x-24 3. Evaluate when x=-3. 3. x Simplify each rational expression. x²-3x 4. 2x-6 5. x²+3x-18 x²-9 6. Write an equivalent rational expression with the given denominator. 2x-3 x²+2x+1(x+1)(x+2) Perform the indicated operation and simplify if possible. x²-16 x-3 7. 3x-9 x²+2x-8 x²+9x+20 5x+25 8. 4.x 2x² 9. x-5 x-5 3 5 10. 4x-3 8x-6 2 3 11. x-4 x+4 x 12. x-2x-8 x²-4 ← -> Copyright ©2020 Pearson Education, Inc. + 5 4. 5. 6. 7. 8. 9. 10. 11. 12. T-97arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL
Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Elementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher:Cengage,
Elementary Geometry for College StudentsGeometryISBN:9781285195698Author:Daniel C. Alexander, Geralyn M. KoeberleinPublisher:Cengage Learning
Holt Mcdougal Larson Pre-algebra: Student Edition...
Algebra
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
Elementary Geometry For College Students, 7e
Geometry
ISBN:9781337614085
Author:Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:Cengage,
Elementary Geometry for College Students
Geometry
ISBN:9781285195698
Author:Daniel C. Alexander, Geralyn M. Koeberlein
Publisher:Cengage Learning
Propositional Logic, Propositional Variables & Compound Propositions; Author: Neso Academy;https://www.youtube.com/watch?v=Ib5njCwNMdk;License: Standard YouTube License, CC-BY
Propositional Logic - Discrete math; Author: Charles Edeki - Math Computer Science Programming;https://www.youtube.com/watch?v=rL_8y2v1Guw;License: Standard YouTube License, CC-BY
DM-12-Propositional Logic-Basics; Author: GATEBOOK VIDEO LECTURES;https://www.youtube.com/watch?v=pzUBrJLIESU;License: Standard Youtube License
Lecture 1 - Propositional Logic; Author: nptelhrd;https://www.youtube.com/watch?v=xlUFkMKSB3Y;License: Standard YouTube License, CC-BY
MFCS unit-1 || Part:1 || JNTU || Well formed formula || propositional calculus || truth tables; Author: Learn with Smily;https://www.youtube.com/watch?v=XV15Q4mCcHc;License: Standard YouTube License, CC-BY