Free Essay

Math 0111

In:

Submitted By cheyennepotter
Words 1173
Pages 5
Homework this week: 1.5b, 1.7ab Quiz 2: 1.4c, 1.5b, 1.7ab 1. Solving Formulas A formula is an equation which represents the relationship between two or more variables. Example 1.1. (1) The formula x = y means that x and y are the same. (2) The formula C = 5 (F − 32) represents the relationship between temperatures in 9 degrees Fahrenheit F and Celsius C. A formula is called solved for one of its variables if that variable is isolated on one side of the equals sign in the equation. Not all formulas can be solved for all of their variables. Example 1.2. The formula we wrote relating Fahrenheit and Celsius temperatures is solved for the variable representing degrees in Celsius C. We solve it for degrees in Fahrenheit F : 5 C = (F − 32) 9 9 C = F − 32 5 9 C + 32 = F 5 Written in the normal way (with the solved variable on the left-hand side) our solution is 9 F = C + 32 5 2. Solving Linear Inequalities 2.1. Inequalities and Interval Notation. An inequality is an expression representing the way that variables or numbers are not equal. We will learn to simplify expressions which describe how a variable is less or greater than another. In mathematical notation for fixed real numbers a, the inequality x < a represents all numbers less than a; we can write this equivalently a > x. The inequality x > a represents all numbers greater than a. The previous inequalities are called strict, since we are not allowed to take x = a. If we can take x = a, the inequalities are written x ≤ a or x ≥ a. The solution set of an inequality can be written in set-builder notation: for example, the real numbers greater than or equal to a can be written as {x : x > a} When the upper bound on the solution set is missing, we can write it with +∞; similarly, if the lower bound is missing, we can write −∞. That is, {x : x > a} = {x : +∞ > x > a}
Date: Spring 2014.
1

MTH 0111 WEEK 3

2

In this way, every inequality can be written with two bounds. We are also interested in this type of compound inequalities, which take the form, for instance, of a 0, then ax < ay. If a < 0, then ax > ay. The same rules apply in the case of non-strict inequalities, in an obvious way. Using these rules, we can solve an inequality just like we would solve a formula. Exercise 2.1. Solve the following inequalities, writing the solution in interval notation (1) 2x + 5 > −3 (2) −4x ≤ 10 (3) 2 < x − 1.1 < 20 (4) −1 ≥ x + 4 > −8

MTH 0111 WEEK 3

3

3. Solving Absolute Value Inequalities Here, we will learn to solve absolute value inequalities; that is, inequalities of the form |ax + b| < c |ax + b| ≤ c |ax + b| > c and |ax + b| ≥ c For c > 0. When we have written the absolute value inequality in this form, we say it is in standard form. Standard form is useful because we can immediately tell whether the absolute value inequality has a solution. There is first a special case to be aware of: when c < 0 the situation will change. However, in each case it changes in what seems very intuitive, based on what we know about absolute values in general. If c < 0, then the equations |ax + b| < c and |ax + b| ≤ c have no solution, since in this case they both state |ax + b| < 0, which is impossible. On the other hand, if c < 0, then the equations |ax + b| > c and |ax + b| ≥ c do have a solution, and in fact the solution is all real numbers, which we can write in interval notation as (−∞, ∞). More on interval notation in a bit. Our technique to solve an absolute value equation with the absolute value on the left with either < or ≤ is similar: assume we have strict inequality 0, we write the equation |ax + b| < c As an equivalent, compound inequality, −c < ax + b < c Now, so long as we are careful to make any change to one term also to the other two, and follow the rules regarding inequalities, we will derive an inequality for x by itself; assuming that a > 0 we would have, for instance −c − b c−b x has no lowest value which makes it true. In interval notation, we always need a lower and upper point, so it is natural to replace these boundary points with −∞ or ∞, depending on if we need a lower value or upper value. These values are never included with square brace, since they are not real numbers. So, an inequality of the form x < b can be written in interval notation as (−∞, b). Similarly, the inequality x ≤ b can be written (−∞, b] (4) The inequality x > a > can be written in interval notation as (a, ∞), and the inequality x ≥ a can be written in interval notation as [a, ∞). To combine intervals, we may use many tools. The two which we use in this section are the union and intersection. The union of two intervals (a, b) and (c, d), denoted by (a, b) ∪ (c, d) is the collection of points which are in either (a, b) or (c, d). The intersection of two intervals (a, b) and (c, d), denoted by (a, b) ∩ (c, d) is the collection of points which are in both intervals. Note 3.1 (Compound Inequalities). It is important to understand how the compound inequality of the form a < x < b is defined (we have used it multiple times already without this understanding, perhaps.) Specifically, we write a < x < b if and only if a < x andx < b Other compound inequalities are defined similarly. When working with a compound inequality, which generally makes problem solving faster, if being careless one can arrive at a nonsensical statement. For instance, if one finds −1 < x ≤ −5 The solution set corresponding to this inequality is empty, since there are no numbers greater than one and less than −5! If we expected a solution, we should check our work. Let us now continue with our absolute value inequality solution techniques. The other case which may come up is when the absolute value is to the left of a > or ≥ sign. In this case, we follow the following rule: If |ax + b| > c for some c > 0, then ax + b > c or −(ax + b) > c is true. It is in this case that we will oftentimes require the use of the union symbol ∪. Example 3.1. Let us solve some problems of this type; write the solution in interval notation (1) |x − 5| > 6 1 (2) 4x−3 > 2 2 (3) |x + 6| < − 1 | 2 (4) |2x + 4| + 4 < 7 (5) 7 > |8 − 5x| + 3 (6) −4 < |6x − 1| − 4

MTH 0111 WEEK 3

5

E-mail address: jgoldfar@my.fit.edu Mathematical Sciences Department, Florida Institute of Technology, 150 W. University Blvd., Melbourne, FL 32901

Similar Documents

Free Essay

Gray Code

...which means that every bit read is faulty. This could change alot depending on how the information is parsed. A hard drive could be exposed to a lot of external forces and the reader can jump and missread at any time. This cannot be forseen, but it can be prevented to some extent. Enter Gray code. Gray code is a way to sort the binaries so that one binary never differs more than one bit from another. This is good news compared to the drastic differance between 0000 and 1111. If we look at a 4-bit value in ordinary binary form and in Gray code form we can see some patterns. The changes in each binary string is bolded: Decimal Binary Gray code 0 0000 0000 1 0001 0001 2 0010 0011 3 0011 0010 4 0100 0110 5 0101 0111 6 0110 0101 7 0111 0100...

Words: 1010 - Pages: 5

Free Essay

Wedding Event

...Class: STSC 0111 Dhanoa 1 Instructor: Maureen Cervantes Date 10/18/2015 Goals in My Life Everybody has dreams, wishes and goals and sooner or later they get closer and closer to achieve them with their hard work and dedication. Goals give you direction in all areas of your life Personal, Academic, Career. Goals give you a purpose in life. A reason to get up early in the morning and go to bed late at night. Goals will put passion into your life. The description of Goals in my life is based on my past goal, academic goal and personal goal. Life is not always be the same but it become more easier when we help each other. Something similar happened to my life when I had to made decision to help my partner. In 2013, I set a goal to get a LVN license and get enrolled in a LVN program. With family support and persistent hard work, in October 2014, I received my LVN license. It always make me feel proud that I achieved my goal. Learning continuously always help you aware of new technologies and education. My academic goal is to get admission in a BSN program. At present, I am taking pre requisite classes at TCC and my goal for this year is to get good grades so I can maintain my GPA 3.5 to get admission in BSN program. My personal goal which I made from my past goals or past knowledge always...

Words: 389 - Pages: 2

Premium Essay

The Mathematics Of Bluffing In Poker

...The Mathematics of Bluffing in Poker Wataru Hasegawa 000040-0111 United World College of South East Asia SL Math Exploration Stephen Lumb Contents Introduction …3 Rationale …3 Aim …3 Basics …3~4 Unexploitable Bluffing …4~5 Numerical Calculations …5~6 Graphical and Calculus Calculations …6~7 Conclusion …8 Evaluation …8 Works Cited …9 Introduction Many card games can improve the chances of winning through mathematical manipulation and the understanding of probabilities. This is because throughout most games you are required to pull the right card in order...

Words: 1900 - Pages: 8

Premium Essay

Intro to Networking

...Exercise1.4.1 What is the ASCII hexadecimal code for a blank space? Why is it necessary to represent a blank space as a separate character in text? A) 0000 B) Defines ascII symbol table Exercise1.4.2 Using Microsoft Word or Excel, create a chart similar to Table 1-3 for the hexadecimal codes for the numbers from 0 through 0) 0000 1) 0001 2) 0010 3) 0011 4) 0100 5) 0101 6) 0110 7) 0111 8) 1000 9) 1001 Exercise1.4.3 What are the binary and decimal values of the ASCII letter K? Show the steps of the conversion. decimal | binary | 75 | 01001011 | Exercise1.4.4 Use the web to explore the origin of the Universal Character Set (UCS)—ISO/IEC 10646—and explain why it was developed. And contrast this system with ASCII. What is the relationship of ASCII to the UCS encoding? A) For communication and exchange of electronic information B) The way they encode each character and the number of bits used Exercise1.4.5 Use the web to explore the application of UTF-8 text encoding. What features are provided by UTF-8 that is not provided by ASCII? Why was it chosen to replace ASCII as the standard for the web? A) A variable with encoding that can represent every character in the Unicode character set B) Utf-8 functions better on the web C) It can translate foreign languages Lab Review 1.4 1...

Words: 1580 - Pages: 7

Free Essay

Math

...MATH 55 SOLUTION SET—SOLUTION SET #5 Note. Any typos or errors in this solution set should be reported to the GSI at isammis@math.berkeley.edu 4.1.8. How many different three-letter initials with none of the letters repeated can people have. Solution. One has 26 choices for the first initial, 25 for the second, and 24 for the third, for a total of (26)(25)(24) possible initials. 4.1.18. How many positive integers less than 1000 (a) are divisible by 7? (b) are divisible by 7 but not by 11? (c) are divisible by both 7 and 11? (d) are divisible by either 7 or 11? (e) are divisible by exactly one of 7 or 11? (f ) are divisible by neither 7 nor 11? (g) have distinct digits? (h) have distinct digits and are even? Solution. (a) Every 7th number is divisible by 7. Since 1000 = (7)(142) + 6, there are 142 multiples of seven less than 1000. (b) Every 77th number is divisible by 77. Since 1000 = (77)(12) + 76, there are 12 multiples of 77 less than 1000. We don’t want to count these, so there are 142 − 12 = 130 multiples of 7 but not 11 less than 1000. (c) We just figured this out to get (b)—there are 12. (d) Since 1000 = (11)(90) + 10, there are 90 multiples of 11 less than 1000. Now, if we add the 142 multiples of 7 to this, we get 232, but in doing this we’ve counted each multiple of 77 twice. We can correct for this by subtracting off the 12 items that we’ve counted twice. Thus, there are 232-12=220 positive integers less than 1000 divisible by 7 or 11. (e) If we want to exclude the multiples...

Words: 3772 - Pages: 16

Premium Essay

Alksdjf

...CCNA Portable Command Guide Second Edition Scott Empson Cisco Press 800 East 96th Street Indianapolis, Indiana 46240 USA ii CCNA Portable Command Guide, Second Edition Scott Empson Copyright© 2008 Cisco Systems, Inc. Published by: Cisco Press 800 East 96th Street Indianapolis, IN 46240 USA All rights reserved. No part of this book may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or by any information storage and retrieval system, without written permission from the publisher, except for the inclusion of brief quotations in a review. Printed in the United States of America First Printing July 2007 Library of Congress Cataloging-in-Publication Data Empson, Scott. Portable command reference / Scott Empson. -- 2nd ed. p. cm. ISBN 978-1-58720-193-6 (pbk.) 1. Computer networks--Examinations--Study guides. 2. Internetworking (Telecommunication)--Examinations--Study guides. 3. Electronic data processing personnel--Certification. I. Title. TK5105.5.E4352 2007 004.6--dc22 2007023863 ISBN-13: 978-1-5872-0193-6 ISBN-10: 1-58720-193-3 Warning and Disclaimer This book is designed to provide information about the Certified Cisco Networking Associate (CCNA) exam and the commands needed at this level of network administration. Every effort has been made to make this book as complete and as accurate as possible, but no warranty or fitness is implied. The information is provided on an “as is” basis. The author...

Words: 64092 - Pages: 257

Premium Essay

Ccna

...CCNA Portable Command Guide Second Edition Scott Empson Cisco Press 800 East 96th Street Indianapolis, Indiana 46240 USA ii CCNA Portable Command Guide, Second Edition Scott Empson Copyright© 2008 Cisco Systems, Inc. Published by: Cisco Press 800 East 96th Street Indianapolis, IN 46240 USA All rights reserved. No part of this book may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or by any information storage and retrieval system, without written permission from the publisher, except for the inclusion of brief quotations in a review. Printed in the United States of America First Printing July 2007 Library of Congress Cataloging-in-Publication Data Empson, Scott. Portable command reference / Scott Empson. -- 2nd ed. p. cm. ISBN 978-1-58720-193-6 (pbk.) 1. Computer networks--Examinations--Study guides. 2. Internetworking (Telecommunication)--Examinations--Study guides. 3. Electronic data processing personnel--Certification. I. Title. TK5105.5.E4352 2007 004.6--dc22 2007023863 ISBN-13: 978-1-5872-0193-6 ISBN-10: 1-58720-193-3 Warning and Disclaimer This book is designed to provide information about the Certified Cisco Networking Associate (CCNA) exam and the commands needed at this level of network administration. Every effort has been made to make this book as complete and as accurate as possible, but no warranty or fitness is implied. The information is provided...

Words: 64092 - Pages: 257

Premium Essay

Crhypho

...SOLUTIONS MANUAL CRYPTOGRAPHY AND NETWORK SECURITY PRINCIPLES AND PRACTICE FOURTH EDITION WILLIAM STALLINGS Copyright 2006: William Stallings -2- © 2006 by William Stallings All rights reserved. No part of this document may be reproduced, in any form or by any means, or posted on the Internet, without permission in writing from the author. -3- NOTICE This manual contains solutions to all of the review questions and homework problems in Cryptography and Network Security, Fourth Edition. If you spot an error in a solution or in the wording of a problem, I would greatly appreciate it if you would forward the information via email to ws@shore.net. An errata sheet for this manual, if needed, is available at ftp://shell.shore.net/members/w/s/ws/S. W.S. -4- TABLE OF CONTENTS Chapter 1: Chapter 2: Chapter 3: Chapter 4: Chapter 5: Chapter 6: Chapter 7: Chapter 8: Chapter 9: Chapter 10: Chapter 11: Chapter 12: Chapter 13: Chapter 14: Chapter 15: Chapter 16: Chapter 17: Chapter 18: Chapter 19: Chapter 20: Introduction ..................................................................................................5 Classical Encryption Techniques ...............................................................7 Block Ciphers and the Date Encryption Standard ................................13 Finite Fields .................................................................................................21 Advanced Encryption Standard ...................

Words: 21497 - Pages: 86

Premium Essay

Acer America

...Fourth Edition, last update November 01, 2007 2 Lessons In Electric Circuits, Volume IV – Digital By Tony R. Kuphaldt Fourth Edition, last update November 01, 2007 i c 2000-2010, Tony R. Kuphaldt This book is published under the terms and conditions of the Design Science License. These terms and conditions allow for free copying, distribution, and/or modification of this document by the general public. The full Design Science License text is included in the last chapter. As an open and collaboratively developed text, this book is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Design Science License for more details. Available in its entirety as part of the Open Book Project collection at: www.ibiblio.org/obp/electricCircuits PRINTING HISTORY • First Edition: Printed in June of 2000. Plain-ASCII illustrations for universal computer readability. • Second Edition: Printed in September of 2000. Illustrations reworked in standard graphic (eps and jpeg) format. Source files translated to Texinfo format for easy online and printed publication. • Third Edition: Printed in February 2001. Source files translated to SubML format. SubML is a simple markup language designed to easily convert to other markups like A LTEX, HTML, or DocBook using nothing but search-and-replace substitutions. • Fourth Edition: Printed in March 2002. Additions...

Words: 29763 - Pages: 120

Free Essay

Characterising the Concept of Service Experience

...TABLE OF CONTENTS CHAPTER 1: FUNDAMENTALS OF COMPUTER SYSTEMS 1 Basic Computer System Model ....................................................................................................... 1 Importance of Computers............................................................................................................... 2 Professional Standards.................................................................................................................... 3 Considerations When Creating Computer Systems........................................................................ 5 Glossary of Terms............................................................................................................................7 Past Exam Questions & Example Answers...................................................................................... 8 CHAPTER 2: DATA REPRESENTATION IN COMPUTERS 9 Units ................................................................................................................................................ 9 Numbers........................................................................................................................................10 Characters .....................................................................................................................................14 Images ..............................................................................................................................

Words: 34115 - Pages: 137

Premium Essay

Notes of Unit 1. Chapter 1. Nt1230

...CHAPTER 1 Introduction to Networking Objectives Upon completion of this chapter, you should be able to answer the following questions: ■ What are the requirements for an Internet connection? What are the major components of a personal computer (PC)? What procedures are used to install and troubleshoot network interface cards (NICs) and modems? What basic testing procedures are used to test the Internet connection? What are the features of web browsers and plug-ins? ■ What are the Base 2, Base 10, and Base 16 number systems? How do you perform 8-bit-binary-to-decimal and decimal-to-8-bit-binary conversions? How do you perform simple conversions between decimal, binary, and hexadecimal numbers? How are IP addresses and network masks represented in binary form? How are IP addresses and network masks represented in decimal form? ■ ■ ■ ■ ■ ■ ■ ■ Key Terms This chapter uses the following key terms. You can find the definitions in the Glossary: Internet page 4 page 4 parallel port serial port page 10 page 10 enterprise network Internet service provider (ISP) page 6 personal computers (PCs) page 7 page 8 mouse port page 10 keyboard port page 10 Universal Serial Bus (USB) port expansion slots page 10 page 11 page 10 central processing unit (CPU) random-access memory (RAM) page 9 disk drive page 9 hard disk page 9 network interface card (NIC) video card page 11 input/output devices (I/O) page 9 motherboard memory chip page...

Words: 22727 - Pages: 91

Premium Essay

Cd Key

...Java Quick Reference Console Input Scanner input = new Scanner(System.in); int intValue = input.nextInt(); long longValue = input.nextLong(); double doubleValue = input.nextDouble(); float floatValue = input.nextFloat(); String string = input.next(); Console Output System.out.println(anyValue); JOptionPane.showMessageDialog(null, "Enter input"); GUI Input Dialog String string = JOptionPane.showInputDialog( "Enter input"); int intValue = Integer.parseInt(string); double doubleValue = Double.parseDouble(string); Message Dialog Primitive Data Types byte short int long float double char boolean 8 bits 16 bits 32 bits 64 bits 32 bits 64 bits 16 bits true/false Arithmetic Operators + * / % ++var --var var++ var-addition subtraction multiplication division remainder preincrement predecrement postincrement postdecrement Assignment Operators = += -= *= /= %= assignment addition assignment subtraction assignment multiplication assignment division assignment remainder assignment Relational Operators < >= == != less than less than or equal to greater than greater than or equal to equal to not equal Logical Operators && || ! ^ short circuit AND short circuit OR NOT exclusive OR if Statements if (condition) { statements; } if (condition) { statements; } else { statements; } if (condition1) { statements; } else if (condition2) { statements; } else { statements; } switch Statements switch (intExpression) { case value1: statements; break; ... case valuen: statements; break;...

Words: 73366 - Pages: 294

Free Essay

Mastering Unix Shell Scripting

...Mastering Unix Shell Scripting Randal K. Michael Free & Share & Open The Dear Valued Customer, WILEY advantage We realize you’re a busy professional with deadlines to hit. Whether your goal is to learn a new technology or solve a critical problem, we want to be there to lend you a hand. Our primary objective is to provide you with the insight and knowledge you need to stay atop the highly competitive and everchanging technology industry. Wiley Publishing, Inc., offers books on a wide variety of technical categories, including security, data warehousing, software development tools, and networking — everything you need to reach your peak. Regardless of your level of expertise, the Wiley family of books has you covered. • For Dummies – The fun and easy way to learn • The Weekend Crash Course –The fastest way to learn a new tool or technology • Visual – For those who prefer to learn a new topic visually • The Bible – The 100% comprehensive tutorial and reference • The Wiley Professional list – Practical and reliable resources for IT professionals The book you hold now, Mastering Unix Shell Scripting, is the first book to provide end-to-end scripting solutions that will solve real-world system administration problems for those who have to automate these often complex and repetitive tasks. Starting with a sample task and targeting the most common Unix systems: Solaris, Linux, AIX, and HP-UX with specific command structures, this book will save precious time with hands-on...

Words: 145371 - Pages: 582

Free Essay

The Logistic Map

...logistic model in the late previous century is reminded. We conclude by referring to some generalizations of the logistic model, which were used to describe growth and diffusion processes in the context of technological innovation, and for which the author studied the chaotic behaviour by means of a series of computer experiments, performed in the eighties of last century by means of the then emerging “micro-computer” technology. 1 P.-F. Verhulst and the Royal Military Academy in Brussels In the year 1844, at the age of 40, when Pierre-Fran¸ois Verhulst on November c 30 presented his contribution to the “M´moires de l’Acad´mie” of the young e e Belgian nation, a paper which was published the next year in “tome XVIII” with the title: “Recherches math´matiques sur la loi d’accroissement de la e population” (mathematical investigations of the law of population growth), he did certainly not know that his work would be the starting point for further research by Raymond Pearl and Lowell J. Reed [10, 11], by the famous A.-J. Lotka [8] and independently by Volterra [16] and later by V.A. Kostitzin [5], in the fields of mathematical biology, biometry, and demography. It was in these M´moires that he introduced a growth model for a...

Words: 138629 - Pages: 555

Premium Essay

Computers

...C Primer Plus Sixth Edition Developer’s Library ESSENTIAL REFERENCES FOR PROGRAMMING PROFESSIONALS Developer’s Library books are designed to provide practicing programmers with unique, high-quality references and tutorials on the programming languages and technologies they use in their daily work. All books in the Developer’s Library are written by expert technology practitioners who are especially skilled at organizing and presenting information in a way that’s useful for other programmers. Key titles include some of the best, most widely acclaimed books within their topic areas: PHP & MySQL Web Development Luke Welling & Laura Thomson ISBN 978-0-672-32916-6 Python Essential Reference David Beazley ISBN-13: 978-0-672-32978-4 MySQL Paul DuBois ISBN-13: 978-0-321-83387-7 PostgreSQL Korry Douglas ISBN-13: 978-0-672-32756-8 Linux Kernel Development Robert Love ISBN-13: 978-0-672-32946-3 C++ Primer Plus Stephen Prata ISBN-13: 978-0-321-77640-2 Developer’s Library books are available in print and in electronic formats at most retail and online bookstores, as well as by subscription from Safari Books Online at safari. informit.com Developer’s Library informit.com/devlibrary C Primer Plus Sixth Edition Stephen Prata Upper Saddle River, NJ • Boston • Indianapolis • San Francisco New York • Toronto • Montreal • London • Munich • Paris • Madrid Cape Town • Sydney • Tokyo • Singapore • Mexico City C Primer Plus Sixth...

Words: 125302 - Pages: 502