Preptests 55 Answers and Explanations (By Ivy Global) Section 4 Logic Games
|
|
- Shona Norris
- 5 years ago
- Views:
Transcription
1 Section 4 Logic Games Questions 1 6 There aren t too many deductions we can make in this game, and it s best to just note how the rules interact and save your time for answering the questions. 1. Type of Question: Global List a) Eliminated by rule #3: G and R can t both give a final argument. b) Eliminated by rule #2: L must prepare an opening argument. c) Eliminated by rule #1: M must be with G or V. e) Eliminated by rule #3: G or R must give a final argument. 2. Type of Question: Local Could Be True If we set up the information we re given, we can fill in 3 of the 6 blanks. It s also clear that R must be in the opening position of the last team, since we can t have both G and R in the final position. This leaves with only two blanks spaces: OPEN: M L R FIN: G a) L and V could be together, but V would have to give the final in order for rule #2 to be satisfied. b) R and S could be together, but S would have to give the final in order for rule #3 to be satisfied. c) This is the correct answer, and the set-up would like this: OPEN: M L R FIN: G V S d) S and V could not be together, as per our set-up. e) S and V could not be together, as per our set-up. 3. Type of Question: Global Could Be True We can approach this question using a combination of rule sweeping and past work. a) This is the correct answer, and the set-up could look like this: OPEN: R L M FIN: G S V b) We can t put G and V together (rule #1) since one of them needs to be with M. c) This would force L into the final argument, violating rule #2. d) This violates rule #1. e) This violates rule #1. 4. Type of Question: Local Fully Determined
2 Since rule #1 tells us that M needs to be with G or V, and V is now taken, we know that the three groups with be RV, MG, and LS. We know that L must be in the opening position, so S will be in the final. The other four cannot be pinned down to a specific position. b) This is the correct answer. 5. Type of Question: Local Must Be True If L and R are together, we know that L will be in the opening position (rule #2) and so R is in closing. We can t know for sure the way the other groups will play out, but since G and R can t both be in the final position (rule #3), G will have to be in the opening. Our diagram looks like this: OPEN: L G _ FIN: R a) This could be true, but doesn t have to be (V could be on the same team as G). b) This could be true, but doesn t have to be (M could be on the same team as S). c) This could be true, but doesn t have to be (M could be on the same team as S). d) This could be true, but doesn t have to be (V could be on the same team as S). e) This is the correct answer. G must be in the opening position so as not to violate rule #3. 6. Type of Question: Local Could Be True This information tells us that L and S take up two of the opening spots. In order to satisfy rule #1, we ll have to put M on the last team. He ll have to be partnered with G in the opening position, in order to satisfy rule #3 and avoid having both R and G in the final position. OPEN: L S G FIN: M a) This isn t possible. b) This isn t possible. c) This is the correct answer. It could look like this: OPEN: L S G FIN: V R M d) This isn t possible. e) This isn t possible. Question 7 12 This is another game when there are not too many deductions we can make, precisely because we don t know the number of s actually received. This game hinges on the particular elements of each question, and so it s easiest to just set up and move on to them. It s also good to remember that we ll have either 4, 5, or 6 message (since there are 3 people, and one has to go twice.) 7. Type of Question: Global List a) Eliminated by rule #3: HJ only once b) Eliminated by rule #3: must have HJ once
3 c) Eliminated by rule #2: first and last message must be by same person e) Eliminated by rule #4: one in first three from J 8. Type of Question: Global Numbers J must fall somewhere in the first three, and since we can t make H last (first = last, and we must have one HJ chain), we can make her second last. This means L will fall twice between J and H: J L L H J c) This is the correct answer. 9. Type of Question: Local Must Be True Since L can t be in position 1, the first and last must be occupied by either H or J. Once we slot in our single HJ chain, we get two options: H J L H or J L H J a) This is the correct answer she can t be in first/last based on rule #1, so she can only occur once. b) This is possible, but doesn t have to be true (H J L H). c) This is possible, but doesn t have to be true (H J L H). d) This is not possible. e) This is possible, but doesn t have to be true (H J L H). 10. Type of Question: Global Cannot Be True L can t be first, and so can t be last. The only way we could know when L can t for sure be is in position 1, and in position 6 if it exists. If we re given any other position, we can t be sure if it will be the last position or not. e) This is the correct answer. 11. Type of Question: Local Must Be True Putting L in 5 limits who can take the 1/6 positions. Since we need an HJ, we can t put J in the 1/6 (J _ L J) because it would block us from putting in HJ. That means we need H in 1 and 6, and J in 2 to make HJ. Since we can only have J in the first three spots once, he ll have to go in 4, with L in 3: H J L J L H a) This is not possible. b) This is not possible. c) This is not possible. e) This is not possible. 12. Type of Question: Local Numbers In order to maximize the distance between Ls, we should choose a diagram with six messages (remember, we re maximizing.) L can t be in 1 or in 6, so the furthest apart she could be in 2 and 5: _ L L _
4 But this doesn t work either, since this would stop the HJ block from happening (just try cycling H or J into those end spots). So, she ll only be able to have to one spot in between her messages. We saw this is question 11, so here s a hypothetical set-up for it: H J L - J L H b) This is the correct answer. Questions This is a pure sequencing game, where all the rules are relative to one another. For these kinds of games, it s best to make a chain, and this game s looks something like this: When making chains like this, it s always important to step make and make sure you know exactly where the entities fall. In this game, only F or R could come first, and only T or H could be last. 13. Type of Question: Global List a) Eliminated by rule #3: R must come before T b) Eliminated by rule #4: S must come before H c) Eliminated by rule #1: F must come before G e) Eliminated by rule #5: G must come before T. 14. Type of Question: Local Could Be True Since we know from our diagram that only R or F can be first, putting F in 3 forces R into 1. G, T, and H can t be in 2 because they require more than R to come before them, so S has to be in the second spot: R S F a) This cannot be true. b) This is the correct answer, and the diagram would look like this: R S F H G T c) R must be ranked first. d) S must be ranked second. e) This cannot be true, since T requires G to come before it. 15. Type of Question: Global Cannot Be True We can approach this simply by counting the entities in the chain. R needs at least three spaces after it, because T, S, and H all must come after R. Since there are only six spots, the latest R could come is in 3. c) This is the correct answer.
5 16. Type of Question: Global Fully Determined For this type of question, we ll need to find the position that fully determines the rankings. These questions require working through each answer choice, and abandoning them when we don t see anything forming. a) If we put G in 4, we know that F, R, and S will come before it, and T and H after, but we don t know what order these will be in. b) This tells us that T will be in 6, but not much else. c) This is the correct answer. If H is in third, then R and S must come in 1 and 2, and we re left with F, G, and T, which must come in the order F-G-T. We get R S H F G H d) As in question 14, all this yield is R S F _ e) Putting S in 3 means that F and R come before it, and G, T, H after, but the order can t be determined. 17. Type of Question: Local Could Be True The night-shift crew is either G and T or S and H, and drawing a diagram of each doesn t really yield much of anything, so we ll have to just go to the answer choices. a) This would mean S H fill 5 and 6. It won t work, because putting G in 4 means that there isn t any room for T to come after G. b) If we use S and H in 5 and 6, H has to be in 6 because of our chain. c) This is the correct answer if G T is our night shift: F G R T S H d) If we do this, 4 6 read S G T, and this doesn t work, because there s nowhere for H to come after S. e) If we use G and T in 5 and 6, T has to be in 6 because of our chain. 18. Type of Question: Global Cannot Be True This question should be approached with past work. We ve seen F, R, H, and G in 3, so we can eliminate a), b), c), and d) on this. All that s left is S and T, and e) gives us T. e) This is the correct answer. Questions There aren t a lot of deductions to be made in this game, but it s important to make sure you understand the rules properly to avoid confusion. For example, rule #2 means that R will either leave the van at the M stop, or will leave after the M stop. This game is made up almost entirely of local questions, so there is a lot of plugging into diagrams involved. Be careful! 19. Type of Question: Global List a) Eliminated by rule #4: J is still on at F, so G must still be on at S b) Eliminated by rule #1: L must be in 1 or 2 c) Eliminated by rule #3: V must get off before J d) Eliminated by rule #2: R cannot get off before M
6 e) This is the correct answer. 20. Type of Question: Local Could Be True We know that J can never be in the first stop, since V needs to leave before her, so we can eliminate anything with J in it. V can always come in the first spot since she has no stipulations other than coming before J, so anything without V can be eliminated. This leaves us with c) G, V and d) G, R, V. It s just a matter of seeing if R can be placed in the first spot or not with a hypothetical: M L F S R V J G This looks fine. So, c) is the correct answer. 21. Type of Question: Local List If F is the first stop, we know that L has to be in the second to satisfy rule #1. J can never come in 1. R must be with or after M, so she can t be in 1 or 2. Since F is the first stop, the condition in rule #4 is activated (J has to be on when it reaches F), so G cannot get off before S, and also can t be first or second. This means V is the only one that can go in 1, and only J can go in 2: F L V J a) G cannot be in 1, so this is out. b) R cannot be in 1, so this is out. c) G cannot be in 2, so this is out. Even without knowing the final two, this is the only answer choice with V J in 1 and 2. e) R cannot be in 2, so this is out. 22. Type of Question: Local Must Be True For this question, we know we ll have to have L and S in some order in stops 1 and 2. G is in 2, and V has to be in 1 (can t have J in 1, and R needs to be with/after M.) S/L L/S M/F F/M V G R/J J/R a) This could be true, but is not necessarily so. b) This could be true, but is not necessarily so. c) This is the correct answer. R leaves at 3 earliest, and S is either 1 or 2. d) This could be true, but is not necessarily so. e) This cannot be true V gets off first, and the first stop will not be M. 23. Type of Question: Local Must Be False G gets off before S, which means that J will get off before F (rule #4). Since V also needs to come before J (rule #3), we have a chain V J F. This means that the earliest F can stop is 3, and the latest V can leave is 2. a) This could be true if we put F in 3, and G exits at 3. b) This could be true if M is in 2 or 3. c) This could be true.
7 Since V must leave before J, who must leave before F, V can t be around once the van gets to F. e) This could be true, if M is in 1 or 2.
Preptests 59 Answers and Explanations (By Ivy Global) Section 1 Analytical Reasoning
Preptests 59 Answers and Explanations (By ) Section 1 Analytical Reasoning Questions 1 5 Since L occupies its own floor, the remaining two must have H in the upper and I in the lower. P and T also need
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationQuadratic Equations Part I
Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing
More information1 Limits and continuity
1 Limits and continuity Question 1. Which of the following its can be evaluated by continuity ( plugging in )? sin(x) (a) x + 1 (d) x 3 x 2 + x 6 (b) e x sin(x) (e) x 2 + x 6 (c) x 2 x 2 + x 6 (f) n (
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationLECTURE 15: SIMPLE LINEAR REGRESSION I
David Youngberg BSAD 20 Montgomery College LECTURE 5: SIMPLE LINEAR REGRESSION I I. From Correlation to Regression a. Recall last class when we discussed two basic types of correlation (positive and negative).
More informationMatching Theory and the Allocation of Kidney Transplantations
University of Utrecht Bachelor Thesis Matching Theory and the Allocation of Kidney Transplantations Kim de Bakker Supervised by Dr. M. Ruijgrok 14 June 2016 Introduction Matching Theory has been around
More informationUnit 1: Equilibrium and Center of Mass
Unit 1: Equilibrium and Center of Mass FORCES What is a force? Forces are a result of the interaction between two objects. They push things, pull things, keep things together, pull things apart. It s really
More informationDescriptive Statistics (And a little bit on rounding and significant digits)
Descriptive Statistics (And a little bit on rounding and significant digits) Now that we know what our data look like, we d like to be able to describe it numerically. In other words, how can we represent
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationirst we need to know that there are many ways to indicate multiplication; for example the product of 5 and 7 can be written in a variety of ways:
CH 2 VARIABLES INTRODUCTION F irst we need to know that there are many ways to indicate multiplication; for example the product of 5 and 7 can be written in a variety of ways: 5 7 5 7 5(7) (5)7 (5)(7)
More informationMI 4 Mathematical Induction Name. Mathematical Induction
Mathematical Induction It turns out that the most efficient solution to the Towers of Hanoi problem with n disks takes n 1 moves. If this isn t the formula you determined, make sure to check your data
More informationCH 24 IDENTITIES. [Each product is 35] Ch 24 Identities. Introduction
139 CH 4 IDENTITIES Introduction First we need to recall that there are many ways to indicate multiplication; for eample the product of 5 and 7 can be written in a variety of ways: 5 7 5 7 5(7) (5)7 (5)(7)
More informationGetting Started with Communications Engineering
1 Linear algebra is the algebra of linear equations: the term linear being used in the same sense as in linear functions, such as: which is the equation of a straight line. y ax c (0.1) Of course, if we
More informationAt the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
More informationLesson 21 Not So Dramatic Quadratics
STUDENT MANUAL ALGEBRA II / LESSON 21 Lesson 21 Not So Dramatic Quadratics Quadratic equations are probably one of the most popular types of equations that you ll see in algebra. A quadratic equation has
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More information[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]
Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the
More informationCalculus II. Calculus II tends to be a very difficult course for many students. There are many reasons for this.
Preface Here are my online notes for my Calculus II course that I teach here at Lamar University. Despite the fact that these are my class notes they should be accessible to anyone wanting to learn Calculus
More informationIntermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
More informationSection 4.6 Negative Exponents
Section 4.6 Negative Exponents INTRODUCTION In order to understand negative exponents the main topic of this section we need to make sure we understand the meaning of the reciprocal of a number. Reciprocals
More informationOne sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:
One sided tests So far all of our tests have been two sided. While this may be a bit easier to understand, this is often not the best way to do a hypothesis test. One simple thing that we can do to get
More informationRegression, part II. I. What does it all mean? A) Notice that so far all we ve done is math.
Regression, part II I. What does it all mean? A) Notice that so far all we ve done is math. 1) One can calculate the Least Squares Regression Line for anything, regardless of any assumptions. 2) But, if
More informationNo Solution Equations Let s look at the following equation: 2 +3=2 +7
5.4 Solving Equations with Infinite or No Solutions So far we have looked at equations where there is exactly one solution. It is possible to have more than solution in other types of equations that are
More informationConceptual Explanations: Simultaneous Equations Distance, rate, and time
Conceptual Explanations: Simultaneous Equations Distance, rate, and time If you travel 30 miles per hour for 4 hours, how far do you go? A little common sense will tell you that the answer is 120 miles.
More informationN H 2 2 NH 3 and 2 NH 3 N H 2
Chemical Equilibrium Notes (Chapter 18) So far, we ve talked about all chemical reactions as if they go only in one direction. However, as with many things in life, chemical reactions can go both in the
More informationGrades 7 & 8, Math Circles 10/11/12 October, Series & Polygonal Numbers
Faculty of Mathematics Waterloo, Ontario N2L G Centre for Education in Mathematics and Computing Introduction Grades 7 & 8, Math Circles 0//2 October, 207 Series & Polygonal Numbers Mathematicians are
More informationLine Integrals and Path Independence
Line Integrals and Path Independence We get to talk about integrals that are the areas under a line in three (or more) dimensional space. These are called, strangely enough, line integrals. Figure 11.1
More informationSolution to Proof Questions from September 1st
Solution to Proof Questions from September 1st Olena Bormashenko September 4, 2011 What is a proof? A proof is an airtight logical argument that proves a certain statement in general. In a sense, it s
More information1.10 Continuity Brian E. Veitch
1.10 Continuity Definition 1.5. A function is continuous at x = a if 1. f(a) exists 2. lim x a f(x) exists 3. lim x a f(x) = f(a) If any of these conditions fail, f is discontinuous. Note: From algebra
More informationAlgebra 8.6 Simple Equations
Algebra 8.6 Simple Equations 1. Introduction Let s talk about the truth: 2 = 2 This is a true statement What else can we say about 2 that is true? Eample 1 2 = 2 1+ 1= 2 2 1= 2 4 1 = 2 2 4 2 = 2 4 = 4
More informationPS2: Two Variable Statistics
PS2: Two Variable Statistics LT2: Measuring Correlation and Line of best fit by eye. LT3: Linear regression LT4: The χ 2 test of independence. 1 Pearson's Correlation Coefficient In examinations you are
More informationMA 1125 Lecture 15 - The Standard Normal Distribution. Friday, October 6, Objectives: Introduce the standard normal distribution and table.
MA 1125 Lecture 15 - The Standard Normal Distribution Friday, October 6, 2017. Objectives: Introduce the standard normal distribution and table. 1. The Standard Normal Distribution We ve been looking at
More informationLesson 3-2: Solving Linear Systems Algebraically
Yesterday we took our first look at solving a linear system. We learned that a linear system is two or more linear equations taken at the same time. Their solution is the point that all the lines have
More informationCS 124 Math Review Section January 29, 2018
CS 124 Math Review Section CS 124 is more math intensive than most of the introductory courses in the department. You re going to need to be able to do two things: 1. Perform some clever calculations to
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 017/018 DR. ANTHONY BROWN. Lines and Their Equations.1. Slope of a Line and its y-intercept. In Euclidean geometry (where
More informationPERIL PIZZA. But that s still a daydream. For the moment you re the assistant to the glamorous. The Challenge
02 Death Chances of Survival: You might make it Survival Strategies: Fractions; Equivalence by: Termination PIZZA PERIL The Challenge It s your first day of work at Catwalk magazine, a dream come true.
More informationLet V be a vector space, and let X be a subset. We say X is a Basis if it is both linearly independent and a generating set.
Basis Let V be a vector space, and let X be a subset. We say X is a Basis if it is both linearly independent and a generating set. The first example of a basis is the standard basis for R n e 1 = (1, 0,...,
More informationPHYSICS 15a, Fall 2006 SPEED OF SOUND LAB Due: Tuesday, November 14
PHYSICS 15a, Fall 2006 SPEED OF SOUND LAB Due: Tuesday, November 14 GENERAL INFO The goal of this lab is to determine the speed of sound in air, by making measurements and taking into consideration the
More informationIntroduction. So, why did I even bother to write this?
Introduction This review was originally written for my Calculus I class, but it should be accessible to anyone needing a review in some basic algebra and trig topics. The review contains the occasional
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationAnswers in blue. If you have questions or spot an error, let me know. 1. Find all matrices that commute with A =. 4 3
Answers in blue. If you have questions or spot an error, let me know. 3 4. Find all matrices that commute with A =. 4 3 a b If we set B = and set AB = BA, we see that 3a + 4b = 3a 4c, 4a + 3b = 3b 4d,
More informationNatural deduction for truth-functional logic
Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationAlgebra. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This document was written and copyrighted by Paul Dawkins. Use of this document and its online version is governed by the Terms and Conditions of Use located at. The online version of this document is
More informationPart I Electrostatics. 1: Charge and Coulomb s Law July 6, 2008
Part I Electrostatics 1: Charge and Coulomb s Law July 6, 2008 1.1 What is Electric Charge? 1.1.1 History Before 1600CE, very little was known about electric properties of materials, or anything to do
More informationCS1800: Strong Induction. Professor Kevin Gold
CS1800: Strong Induction Professor Kevin Gold Mini-Primer/Refresher on Unrelated Topic: Limits This is meant to be a problem about reasoning about quantifiers, with a little practice of other skills, too
More informationDay 1: Over + Over Again
Welcome to Morning Math! The current time is... huh, that s not right. Day 1: Over + Over Again Welcome to PCMI! We know you ll learn a great deal of mathematics here maybe some new tricks, maybe some
More informationTITRATIONS: USING PRECIPITATION TO DETERMINE THE CONCENTRATION OF AN ION IN SOLUTION
TITRATIONS: USING PRECIPITATION TO DETERMINE THE CONCENTRATION OF AN ION IN SOLUTION In this section, you will be shown: 1. How titrations involving precipitation reactions can be used to determine the
More informationInference and Proofs (1.6 & 1.7)
EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for
More information= (1 3 )= =4 3 +2=4. Now that we have it down to a simple two-step equation, we can solve like normal and get the following: =4 2
6.3 Solving Systems with Substitution While graphing is useful for an estimate, the main way that we can solve a system to get an exact answer is algebraically. There are a few useful methods to do this,
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationCH 59 SQUARE ROOTS. Every positive number has two square roots. Ch 59 Square Roots. Introduction
59 CH 59 SQUARE ROOTS Introduction W e saw square roots when we studied the Pythagorean Theorem. They may have been hidden, but when the end of a right-triangle problem resulted in an equation like c =
More informationSection 1.x: The Variety of Asymptotic Experiences
calculus sin frontera Section.x: The Variety of Asymptotic Experiences We talked in class about the function y = /x when x is large. Whether you do it with a table x-value y = /x 0 0. 00.0 000.00 or with
More informationChapter 6. Net or Unbalanced Forces. Copyright 2011 NSTA. All rights reserved. For more information, go to
Chapter 6 Net or Unbalanced Forces Changes in Motion and What Causes Them Teacher Guide to 6.1/6.2 Objectives: The students will be able to explain that the changes in motion referred to in Newton s first
More informationIt has neither a local maximum value nor an absolute maximum value
1 Here, we learn how derivatives affect the shape of a graph of a function and, in particular, how they help us locate maximum and minimum values of functions. Some of the most important applications of
More informationAlgebra & Trig Review
Algebra & Trig Review 1 Algebra & Trig Review This review was originally written for my Calculus I class, but it should be accessible to anyone needing a review in some basic algebra and trig topics. The
More informationPHIL 422 Advanced Logic Inductive Proof
PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon
More informationCS1800: Mathematical Induction. Professor Kevin Gold
CS1800: Mathematical Induction Professor Kevin Gold Induction: Used to Prove Patterns Just Keep Going For an algorithm, we may want to prove that it just keeps working, no matter how big the input size
More informationSolving with Absolute Value
Solving with Absolute Value Who knew two little lines could cause so much trouble? Ask someone to solve the equation 3x 2 = 7 and they ll say No problem! Add just two little lines, and ask them to solve
More informationLecture 10: Powers of Matrices, Difference Equations
Lecture 10: Powers of Matrices, Difference Equations Difference Equations A difference equation, also sometimes called a recurrence equation is an equation that defines a sequence recursively, i.e. each
More information( )( b + c) = ab + ac, but it can also be ( )( a) = ba + ca. Let s use the distributive property on a couple of
Factoring Review for Algebra II The saddest thing about not doing well in Algebra II is that almost any math teacher can tell you going into it what s going to trip you up. One of the first things they
More informationSymbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
More informationClass Notes: Solving Simultaneous Linear Equations by Gaussian Elimination. Consider a set of simultaneous linear equations:
METR/OCN 465: Computer Programming with Applications in Meteorology and Oceanography Dr Dave Dempsey Dept of Geosciences, SFSU Class Notes: Solving Simultaneous Linear Equations by Gaussian Elimination
More informationDiscrete Structures Proofwriting Checklist
CS103 Winter 2019 Discrete Structures Proofwriting Checklist Cynthia Lee Keith Schwarz Now that we re transitioning to writing proofs about discrete structures like binary relations, functions, and graphs,
More informationWe set up the basic model of two-sided, one-to-one matching
Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 18 To recap Tuesday: We set up the basic model of two-sided, one-to-one matching Two finite populations, call them Men and Women, who want to
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationProjectile Motion: Vectors
Projectile Motion: Vectors Ch. 5 in your text book Students will be able to: 1) Add smaller vectors going in the same direction to get one large vector for that direction 2) Draw a resultant vector for
More informationBell s spaceship paradox
Bell s spaceship paradox If the two ships start accelerating at the same time, I always see them travelling at the same velocity, and keeping a constant distance... But I said the objects get shorter when
More informationAssignment 3 Logic and Reasoning KEY
Assignment 3 Logic and Reasoning KEY Print this sheet and fill in your answers. Please staple the sheets together. Turn in at the beginning of class on Friday, September 8. Recall this about logic: Suppose
More informationCreating and Exploring Circles
Creating and Exploring Circles 1. Close your compass, take a plain sheet of paper and use the compass point to make a tiny hole (point) in what you consider to be the very centre of the paper. The centre
More informationTHE SIMPLE PROOF OF GOLDBACH'S CONJECTURE. by Miles Mathis
THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE by Miles Mathis miles@mileswmathis.com Abstract Here I solve Goldbach's Conjecture by the simplest method possible. I do this by first calculating probabilites
More informationLesson 26: Characterization of Parallel Lines
Student Outcomes Students know that when a system of linear equations has no solution, i.e., no point of intersection of the lines, then the lines are parallel. Lesson Notes The discussion that begins
More informationRow Reduction
Row Reduction 1-12-2015 Row reduction (or Gaussian elimination) is the process of using row operations to reduce a matrix to row reduced echelon form This procedure is used to solve systems of linear equations,
More informationIn economics, the amount of a good x demanded is a function of the price of that good. In other words,
I. UNIVARIATE CALCULUS Given two sets X and Y, a function is a rule that associates each member of X with eactly one member of Y. That is, some goes in, and some y comes out. These notations are used to
More informationChemistry 12. Tutorial 12
Chemistry 12 Tutorial 12 Determining the Concentration of a Specific Ion Using Precipitation Titrations In Tutorial 12, you will be shown: 1. How titrations involving precipitation reactions can be used
More informationMATH240: Linear Algebra Review for exam #1 6/10/2015 Page 1
MATH24: Linear Algebra Review for exam # 6//25 Page No review sheet can cover everything that is potentially fair game for an exam, but I tried to hit on all of the topics with these questions, as well
More informationCHAPTER 7: TECHNIQUES OF INTEGRATION
CHAPTER 7: TECHNIQUES OF INTEGRATION DAVID GLICKENSTEIN. Introduction This semester we will be looking deep into the recesses of calculus. Some of the main topics will be: Integration: we will learn how
More informationChapter 7. Functions and onto. 7.1 Functions
Chapter 7 Functions and onto This chapter covers functions, including function composition and what it means for a function to be onto. In the process, we ll see what happens when two dissimilar quantifiers
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16
60.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 0/3/6 6. Introduction We talked a lot the last lecture about greedy algorithms. While both Prim
More informationAnswers for Calculus Review (Extrema and Concavity)
Answers for Calculus Review 4.1-4.4 (Extrema and Concavity) 1. A critical number is a value of the independent variable (a/k/a x) in the domain of the function at which the derivative is zero or undefined.
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 (Version B)
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 (Version B) Instructions: Do not turn over this page until the proctor tells you to. Don t write any answers on the backs
More informationGaussian Quiz. Preamble to The Humble Gaussian Distribution. David MacKay 1
Preamble to The Humble Gaussian Distribution. David MacKay Gaussian Quiz H y y y 3. Assuming that the variables y, y, y 3 in this belief network have a joint Gaussian distribution, which of the following
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 Thursday July 17, 2014, 12:40pm-2:00pm. Instructions: Do not turn over this page until the proctor tells you to. Don t
More informationDivisibility = 16, = 9, = 2, = 5. (Negative!)
Divisibility 1-17-2018 You probably know that division can be defined in terms of multiplication. If m and n are integers, m divides n if n = mk for some integer k. In this section, I ll look at properties
More informationAlgebra Exam. Solutions and Grading Guide
Algebra Exam Solutions and Grading Guide You should use this grading guide to carefully grade your own exam, trying to be as objective as possible about what score the TAs would give your responses. Full
More informationCS 170 Algorithms Fall 2014 David Wagner MT2
CS 170 Algorithms Fall 2014 David Wagner MT2 PRINT your name:, (last) SIGN your name: (first) Your Student ID number: Your Unix account login: cs170- The room you are sitting in right now: Name of the
More informationRainfall, Part IV. Rain does not normally accumulate above this level
AND NOW FOR REAL RAIN GAUGES!!! Rainfall, Part IV Most real rain gauges have another complication that we haven t looked at yet. This complication makes it a little harder to understand how rain gauges
More informationCSE370 HW3 Solutions (Winter 2010)
CSE370 HW3 Solutions (Winter 2010) 1. CL2e, 4.9 We are asked to implement the function f(a,,c,,e) = A + C + + + CE using the smallest possible multiplexer. We can t use any extra gates or the complement
More informationbase 2 4 The EXPONENT tells you how many times to write the base as a factor. Evaluate the following expressions in standard notation.
EXPONENTIALS Exponential is a number written with an exponent. The rules for exponents make computing with very large or very small numbers easier. Students will come across exponentials in geometric sequences
More informationAI Programming CS S-09 Knowledge Representation
AI Programming CS662-2013S-09 Knowledge Representation David Galles Department of Computer Science University of San Francisco 09-0: Overview So far, we ve talked about search, which is a means of considering
More informationAlgebra Year 9. Language
Algebra Year 9 Introduction In Algebra we do Maths with numbers, but some of those numbers are not known. They are represented with letters, and called unknowns, variables or, most formally, literals.
More informationRatios, Proportions, Unit Conversions, and the Factor-Label Method
Ratios, Proportions, Unit Conversions, and the Factor-Label Method Math 0, Littlefield I don t know why, but presentations about ratios and proportions are often confused and fragmented. The one in your
More informationModern Physics notes Paul Fendley Lecture 3
Modern Physics notes Paul Fendley fendley@virginia.edu Lecture 3 Electron Wavelength Probability Amplitude Which slit? Photons Born, IV.4 Feynman, 1.6-7, 2.1 Fowler, Rays and Particles The wavelength of
More informationChapter 5 Simplifying Formulas and Solving Equations
Chapter 5 Simplifying Formulas and Solving Equations Look at the geometry formula for Perimeter of a rectangle P = L W L W. Can this formula be written in a simpler way? If it is true, that we can simplify
More informationIsomorphisms and Well-definedness
Isomorphisms and Well-definedness Jonathan Love October 30, 2016 Suppose you want to show that two groups G and H are isomorphic. There are a couple of ways to go about doing this depending on the situation,
More informationSection 2.5 Linear Inequalities
Section 2.5 Linear Inequalities WORDS OF COMPARISON Recently, you worked with applications (word problems) in which you were required to write and solve an equation. Sometimes you needed to translate sentences
More informationLesson 3-1: Solving Linear Systems by Graphing
For the past several weeks we ve been working with linear equations. We ve learned how to graph them and the three main forms they can take. Today we re going to begin considering what happens when we
More information4.1 Real-valued functions of a real variable
Chapter 4 Functions When introducing relations from a set A to a set B we drew an analogy with co-ordinates in the x-y plane. Instead of coming from R, the first component of an ordered pair comes from
More informationKnots, Coloring and Applications
Knots, Coloring and Applications Ben Webster University of Virginia March 10, 2015 Ben Webster (UVA) Knots, Coloring and Applications March 10, 2015 1 / 14 This talk is online at http://people.virginia.edu/~btw4e/knots.pdf
More information