ALGEBRA Sec. 5 IDENTITY AXIOMS. MathHands.com. IDENTITY AXIOMS: Identities

Size: px
Start display at page:

Download "ALGEBRA Sec. 5 IDENTITY AXIOMS. MathHands.com. IDENTITY AXIOMS: Identities"

Transcription

1 IDENTITY AXIOMS IDENTITY AXIOMS: Identities It is helpful to recall the definition of a binary operation. As we have stated it, a binary operation is a mixing recipe for mixing two items. We used the color analogy, and we return to it now to establish a meaningful notion of an identity. Identities have nothing to do with identities, in the usual, sense. This is one case where the name of an axiom is not very descriptive. Identities are what they are because of what they do when they are mixed with other numbers. More specifically, they are identities because they do nothing to other numbers when operated with or mixed with. Imagine the color red mixed with a few drops of water. The resulting color will be exactly the same, red. In the world of adding, we will assume the number 0 is the additive identity. We will assume it does nothing when mixed (by addition) with any number or quantity. It should be noted that there are many types of identities and many worlds where identities live, and simply because 0 is the identity in the world of addition, does not mean that it its also the identity in the world of multiplication. ADDITIVE IDENTITY [AId] Up to this section, zero was not officially in our vocabulary, only natural numbers or variables. We take a moment here to meet zero formally and to learn the Additive Identity Axiom. It says that for zero is like water in the world of addition. That is, all numbers remain unchanged when added with zero. Formally, for any quantity, A, A + 0 = A < AId > MULTIPLICATIVE IDENTITY [MId] 0 + A = A < AId > We follow our pattern of delivering axioms in pairs, one for addition, one for multiplication. In the world of multiplication the harmeless, do-nothing element is 1. That is, all numbers remain unchanged when multiplied with 1.Thus we call 1 the multiplicative identity. We accept this as an axiom. Formally, for any quantity, A, A 1 = A < MId > 1 A = A < MId >

2 Some questions to think about 1. (True, False, WDKY (we don t know yet)) Do you know why? explain. 1x = x TRUE by MId 2. (True, False, WDKY (we don t know yet)) Do you know why? explain. 1x = 1x + 0 TRUE by AId 3. (True, False, WDKY (we don t know yet)) Do you know why? explain. 1x = 1(x + 0) TRUE by AId 4. (True, False, WDKY (we don t know yet)) Do you know why? explain. x + 0 = 1(x + 0)

3 TRUE by MId 5. (True, False, WDKY (we don t know yet)) Do you know why? explain. 2 3 = TRUE by MId 6. (True, False, WDKY (we don t know yet)) Do you know why? explain = 2 3 TRUE by MId 7. (True, False, WDKY (we don t know yet)) Do you know why? explain. x 2 = x TRUE by AId 8. (True, False, WDKY (we don t know yet)) Do you know why? explain. 0 = 0 + 0

4 TRUE by AId 9. (True, False, WDKY (we don t know yet)) Do you know why? explain. 0 = 0 + t false (True, False, WDKY (we don t know yet)) Do you know why? explain. 1 = 1 1 TRUE by MId 11. (True, False, WDKY (we don t know yet)) Do you know why? explain. 1 1 = 1 TRUE by MId 12. (True, False, WDKY (we don t know yet)) Do you know why? explain. 1 1 = 1

5 who knows... not by anything we have learned thus far (True, False, WDKY (we don t know yet)) Do you know why? explain. 1 0 = 0 who knows... not by anything we have learned thus far (True, False, WDKY (we don t know yet)) Do you know why? explain. 2 3 = TRUE by Aid 15. (True, False, WDKY (we don t know yet)) Do you know why? explain. (3 + 0) = (3) TRUE by Aid 16. (True, False, WDKY (we don t know yet)) Do you know why? explain. (3 + 0) = 1 (3 + 0)

6 TRUE by Mid 17. (True, False, WDKY (we don t know yet)) Do you know why? explain. 3 1 = 3 TRUE by Mid OR also TRUE by TT 18. (True, False, WDKY (we don t know yet)) Do you know why? explain. x 1 = x TRUE by Mid

Secure understanding of multiplication of whole numbers by 10, 100 or 1000.

Secure understanding of multiplication of whole numbers by 10, 100 or 1000. Secure understanding of multiplication of whole numbers by 10, 100 or 1000. Begin to identify common factors. Identify multiples and factors, including finding all factor pairs of a number, and common

More information

Homework 7: Subsets Due: 11:59 PM, Oct 23, 2018

Homework 7: Subsets Due: 11:59 PM, Oct 23, 2018 CS17 Integrated Introduction to Computer Science Klein Contents Homework 7: Subsets Due: 11:59 PM, Oct 23, 2018 1 Bookends (Practice) 2 2 Subsets 3 3 Subset Sum 4 4 k-subsets 5 5 k-subset Sum 5 Objectives

More information

Binary. Hexadecimal BINARY CODED DECIMAL

Binary. Hexadecimal BINARY CODED DECIMAL Logical operators Common arithmetic operators, like plus, minus, multiply and divide, works in any number base but the binary number system provides some further operators, called logical operators. Meaning

More information

6.001 Notes: Section 1.1

6.001 Notes: Section 1.1 6.001 Notes: Section 1.1 Slide 1.1.1 This first thing we need to do is discuss the focus of 6.001. What is this course all about? This seems quite obvious -- this is a course about computer science. But

More information

Computational Geometry

Computational Geometry Windowing queries Windowing Windowing queries Zoom in; re-center and zoom in; select by outlining Windowing Windowing queries Windowing Windowing queries Given a set of n axis-parallel line segments, preprocess

More information

2.1 Transforming Linear Functions

2.1 Transforming Linear Functions 2.1 Transforming Linear Functions Before we begin looking at transforming linear functions, let s take a moment to review how to graph linear equations using slope intercept form. This will help us because

More information

H1 Spring B. Programmers need to learn the SOAP schema so as to offer and use Web services.

H1 Spring B. Programmers need to learn the SOAP schema so as to offer and use Web services. 1. (24 points) Identify all of the following statements that are true about the basics of services. A. If you know that two parties implement SOAP, then you can safely conclude they will interoperate at

More information

Programming Languages Third Edition

Programming Languages Third Edition Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar with a sample small language for the purpose of semantic specification Understand operational semantics Understand

More information

(Refer Slide Time: 01.26)

(Refer Slide Time: 01.26) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture # 22 Why Sorting? Today we are going to be looking at sorting.

More information

14.1 Encoding for different models of computation

14.1 Encoding for different models of computation Lecture 14 Decidable languages In the previous lecture we discussed some examples of encoding schemes, through which various objects can be represented by strings over a given alphabet. We will begin this

More information

1 Achieving IND-CPA security

1 Achieving IND-CPA security ISA 562: Information Security, Theory and Practice Lecture 2 1 Achieving IND-CPA security 1.1 Pseudorandom numbers, and stateful encryption As we saw last time, the OTP is perfectly secure, but it forces

More information

Introduction to the Analysis of Algorithms. Algorithm

Introduction to the Analysis of Algorithms. Algorithm Introduction to the Analysis of Algorithms Based on the notes from David Fernandez-Baca Bryn Mawr College CS206 Intro to Data Structures Algorithm An algorithm is a strategy (well-defined computational

More information

School of Computer Science CPS109 Course Notes 5 Alexander Ferworn Updated Fall 15

School of Computer Science CPS109 Course Notes 5 Alexander Ferworn Updated Fall 15 Table of Contents 1 INTRODUCTION... 1 2 IF... 1 2.1 BOOLEAN EXPRESSIONS... 3 2.2 BLOCKS... 3 2.3 IF-ELSE... 4 2.4 NESTING... 5 3 SWITCH (SOMETIMES KNOWN AS CASE )... 6 3.1 A BIT ABOUT BREAK... 7 4 CONDITIONAL

More information

CISC689/ Information Retrieval Midterm Exam

CISC689/ Information Retrieval Midterm Exam CISC689/489-010 Information Retrieval Midterm Exam You have 2 hours to complete the following four questions. You may use notes and slides. You can use a calculator, but nothing that connects to the internet

More information

AXIOMS FOR THE INTEGERS

AXIOMS FOR THE INTEGERS AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,

More information

Converting Fractions to Decimals

Converting Fractions to Decimals Converting Fractions to Decimals There is a close relationship between fractions and decimals. In fact, fractions and decimals are just two different ways of writing numbers. For example, consider and

More information

MAFS.5.NF.2.5. Interpret multiplication as rescaling.

MAFS.5.NF.2.5. Interpret multiplication as rescaling. MAFS.5.NF.2.5 Interpret multiplication as rescaling. Understand that multiplying a fraction > 1 and a given number results in a product > either factor. Examples: 2 x 5/4 = 10/4 or 2½; 10/4 > 2 or 2½ >

More information

Equations and Functions, Variables and Expressions

Equations and Functions, Variables and Expressions Equations and Functions, Variables and Expressions Equations and functions are ubiquitous components of mathematical language. Success in mathematics beyond basic arithmetic depends on having a solid working

More information

MS&E 226: Small Data

MS&E 226: Small Data MS&E 226: Small Data Lecture 14: Introduction to hypothesis testing (v2) Ramesh Johari ramesh.johari@stanford.edu 1 / 10 Hypotheses 2 / 10 Quantifying uncertainty Recall the two key goals of inference:

More information

Scheme of work Elementary 1, the maths pathway

Scheme of work Elementary 1, the maths pathway Objective Code Objective Exemplification Links to prior objectives Resources, enrichment, notes E1.1 Multiply and divide numbers by 10, 100 and 1000 including decimals. 6 x 10, 6.5 x 10, 0.65 10 3 x 100,

More information

Activity Guide - Public Key Cryptography

Activity Guide - Public Key Cryptography Unit 2 Lesson 19 Name(s) Period Date Activity Guide - Public Key Cryptography Introduction This activity is similar to the cups and beans encryption we did in a previous lesson. However, instead of using

More information

Lesson 10A OOP Fundamentals. By John B. Owen All rights reserved 2011, revised 2014

Lesson 10A OOP Fundamentals. By John B. Owen All rights reserved 2011, revised 2014 Lesson 10A OOP Fundamentals By John B. Owen All rights reserved 2011, revised 2014 Table of Contents Objectives Definition Pointers vs containers Object vs primitives Constructors Methods Object class

More information

Handout 9: Imperative Programs and State

Handout 9: Imperative Programs and State 06-02552 Princ. of Progr. Languages (and Extended ) The University of Birmingham Spring Semester 2016-17 School of Computer Science c Uday Reddy2016-17 Handout 9: Imperative Programs and State Imperative

More information

Revision on fractions and decimals

Revision on fractions and decimals Revision on fractions and decimals Fractions 1. Addition and subtraction of fractions (i) For same denominator, only need to add the numerators, then simplify the fraction Example 1: " + $ " = &$ " (they

More information

Boolean algebra. June 17, Howard Huang 1

Boolean algebra. June 17, Howard Huang 1 Boolean algebra Yesterday we talked about how analog voltages can represent the logical values true and false. We introduced the basic Boolean operations AND, OR and NOT, which can be implemented in hardware

More information

Grade 6 Math Circles November 6 & Relations, Functions, and Morphisms

Grade 6 Math Circles November 6 & Relations, Functions, and Morphisms Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Relations Let s talk about relations! Grade 6 Math Circles November 6 & 7 2018 Relations, Functions, and

More information

Singly linked lists in C.

Singly linked lists in C. Singly linked lists in C http://www.cprogramming.com/tutorial/c/lesson15.html By Alex Allain Linked lists are a way to store data with structures so that the programmer can automatically create a new place

More information

The. Binary. Number System

The. Binary. Number System The Binary Number System Why is Binary important? Everything on a computer (or other digital device) is represented by Binary Numbers One to Five in various systems 1 2 3 4 5 I II III IV V 1 10 11 100

More information

Semantics via Syntax. f (4) = if define f (x) =2 x + 55.

Semantics via Syntax. f (4) = if define f (x) =2 x + 55. 1 Semantics via Syntax The specification of a programming language starts with its syntax. As every programmer knows, the syntax of a language comes in the shape of a variant of a BNF (Backus-Naur Form)

More information

Performance Evaluation

Performance Evaluation Chapter 4 Performance Evaluation For testing and comparing the effectiveness of retrieval and classification methods, ways of evaluating the performance are required. This chapter discusses several of

More information

CSE 247 Data Structures and Algorithms Fall Exam I

CSE 247 Data Structures and Algorithms Fall Exam I CSE 247 Data Structures and Algorithms Fall 2016 Given: 29 February 2016 Exam I Due: End of session This exam is closed-book, closed-notes. No electronic devices or resources of any kind are allowed. The

More information

EOL Guide 25/04/ :06. A guide to the Exteca Ontology Language

EOL Guide 25/04/ :06. A guide to the Exteca Ontology Language EOL Guide 25/04/2002 07:06 A guide to the Ontology Language Version History 25 April 2002 First Draft 11 Aug 2002 Brought up to date with current implementation Authors Llewelyn Fernandes Mauro Talevi

More information

SOFTWARE ENGINEERING DESIGN I

SOFTWARE ENGINEERING DESIGN I 2 SOFTWARE ENGINEERING DESIGN I 3. Schemas and Theories The aim of this course is to learn how to write formal specifications of computer systems, using classical logic. The key descriptional technique

More information

MITOCW watch?v=kz7jjltq9r4

MITOCW watch?v=kz7jjltq9r4 MITOCW watch?v=kz7jjltq9r4 PROFESSOR: We're going to look at the most fundamental of all mathematical data types, namely sets, and let's begin with the definitions. So informally, a set is a collection

More information

What computers just cannot do. COS 116: 2/28/2008 Sanjeev Arora

What computers just cannot do. COS 116: 2/28/2008 Sanjeev Arora What computers just cannot do. COS 116: 2/28/2008 Sanjeev Arora Administrivia In class midterm in midterms week; Thurs Mar 13 (closed book;? No lab in midterms week; review session instead. What computers

More information

Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5

Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 [talking head] Formal Methods of Software Engineering means the use of mathematics as an aid to writing programs. Before we can

More information

6.1 Evaluate Roots and Rational Exponents

6.1 Evaluate Roots and Rational Exponents VOCABULARY:. Evaluate Roots and Rational Exponents Radical: We know radicals as square roots. But really, radicals can be used to express any root: 0 8, 8, Index: The index tells us exactly what type of

More information

YEAR 5. Carbeile Junior School Mathematics Planning Framework. Sequence 1. Sequence 2. Sequence 3. Sequence 4

YEAR 5. Carbeile Junior School Mathematics Planning Framework. Sequence 1. Sequence 2. Sequence 3. Sequence 4 YEAR 5 1 count forwards or backwards in steps of powers of 10 for any given number up to 1 000 000 solve number problems and practical problems that involve all of the above round decimals with two to

More information

Fundamentals. Fundamentals. Fundamentals. We build up instructions from three types of materials

Fundamentals. Fundamentals. Fundamentals. We build up instructions from three types of materials Fundamentals We build up instructions from three types of materials Constants Expressions Fundamentals Constants are just that, they are values that don t change as our macros are executing Fundamentals

More information

Welcome to Design Patterns! For syllabus, course specifics, assignments, etc., please see Canvas

Welcome to Design Patterns! For syllabus, course specifics, assignments, etc., please see Canvas Welcome to Design Patterns! For syllabus, course specifics, assignments, etc., please see Canvas What is this class about? While this class is called Design Patterns, there are many other items of critical

More information

The Big Idea: Background: About Serial

The Big Idea: Background: About Serial Lesson 6 Lesson 6: Serial Serial Input Input The Big Idea: Information coming into an Arduino sketch is called input. This lesson focuses on text in the form of characters that come from the user via the

More information

CS2 Algorithms and Data Structures Note 10. Depth-First Search and Topological Sorting

CS2 Algorithms and Data Structures Note 10. Depth-First Search and Topological Sorting CS2 Algorithms and Data Structures Note 10 Depth-First Search and Topological Sorting In this lecture, we will analyse the running time of DFS and discuss a few applications. 10.1 A recursive implementation

More information

CMSC 330: Organization of Programming Languages. Formal Semantics of a Prog. Lang. Specifying Syntax, Semantics

CMSC 330: Organization of Programming Languages. Formal Semantics of a Prog. Lang. Specifying Syntax, Semantics Recall Architecture of Compilers, Interpreters CMSC 330: Organization of Programming Languages Source Scanner Parser Static Analyzer Operational Semantics Intermediate Representation Front End Back End

More information

Mathematics Curriculum Medium Term Planning Year Five

Mathematics Curriculum Medium Term Planning Year Five Curriculum Medium Term Planning Year Five Year Five Programme of Study Number Number and Place Value Statutory Requirements Pupils should be taught to: read, write, order and compare numbers to at least

More information

Chapter 1 Operations With Numbers

Chapter 1 Operations With Numbers Chapter 1 Operations With Numbers Part I Negative Numbers You may already know what negative numbers are, but even if you don t, then you have probably seen them several times over the past few days. If

More information

Computer Organization & Assembly Language Programming

Computer Organization & Assembly Language Programming Computer Organization & Assembly Language Programming CSE 2312 Lecture 11 Introduction of Assembly Language 1 Assembly Language Translation The Assembly Language layer is implemented by translation rather

More information

Fundamentals of Digital System Design ECE 3700, CPSC 3700

Fundamentals of Digital System Design ECE 3700, CPSC 3700 Fundamentals of Digital System Design ECE 3700, CPSC 3700 Instructor: Priyank Kalla (kalla@ece.utah.edu) 4 Credits Tue, Thu 1:25-1:45pm, WEB 1230 Office Hours: Tue, Thu: 2:30-4pm, or by appointment Office:

More information

(Refer Slide Time: 02.06)

(Refer Slide Time: 02.06) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 27 Depth First Search (DFS) Today we are going to be talking

More information

Linear Algebra Part I - Linear Spaces

Linear Algebra Part I - Linear Spaces Linear Algebra Part I - Linear Spaces Simon Julier Department of Computer Science, UCL S.Julier@cs.ucl.ac.uk http://moodle.ucl.ac.uk/course/view.php?id=11547 GV01 - Mathematical Methods, Algorithms and

More information

Multiplying and Dividing Rational Expressions

Multiplying and Dividing Rational Expressions Page 1 of 14 Multiplying and Dividing Rational Expressions Attendance Problems. Simplify each expression. Assume all variables are nonzero. x 6 y 2 1. x 5 x 2 2. y 3 y 3 3. 4. x 2 y 5 Factor each expression.

More information

3.3 Division of Fractions and of Mixed Numbers

3.3 Division of Fractions and of Mixed Numbers CCBC Math 0 Division of Fractions and of Mixed Numbers Section.. Division of Fractions and of Mixed Numbers Introduction: http://youtu.be/fsdtivjjq What does it mean to divide? The basic division questions

More information

Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005

Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005 Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005 Peter Bro Miltersen September 29, 2005 Version 2.0 1 Kolmogorov Complexity In this section, we present the concept of Kolmogorov Complexity

More information

SKILL AREA 304: Review Programming Language Concept. Computer Programming (YPG)

SKILL AREA 304: Review Programming Language Concept. Computer Programming (YPG) SKILL AREA 304: Review Programming Language Concept Computer Programming (YPG) 304.1 Demonstrate an Understanding of Basic of Programming Language 304.1.1 Explain the purpose of computer program 304.1.2

More information

Fractions and their Equivalent Forms

Fractions and their Equivalent Forms Fractions Fractions and their Equivalent Forms Little kids use the concept of a fraction long before we ever formalize their knowledge in school. Watching little kids share a candy bar or a bottle of soda

More information

Lecture 4 CSE July 1992

Lecture 4 CSE July 1992 Lecture 4 CSE 110 6 July 1992 1 More Operators C has many operators. Some of them, like +, are binary, which means that they require two operands, as in 4 + 5. Others are unary, which means they require

More information

NS6-50 Dividing Whole Numbers by Unit Fractions Pages 16 17

NS6-50 Dividing Whole Numbers by Unit Fractions Pages 16 17 NS6-0 Dividing Whole Numbers by Unit Fractions Pages 6 STANDARDS 6.NS.A. Goals Students will divide whole numbers by unit fractions. Vocabulary division fraction unit fraction whole number PRIOR KNOWLEDGE

More information

CSC 121: Computer Science for Statistics

CSC 121: Computer Science for Statistics CSC 121: Computer Science for Statistics Radford M. Neal, University of Toronto, 2017 http://www.cs.utoronto.ca/ radford/csc121/ Week 3 Making Functions Do Different Things, Using if When you call a function

More information

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say Sets 1 Where does mathematics start? What are the ideas which come first, in a logical sense, and form the foundation for everything else? Can we get a very small number of basic ideas? Can we reduce it

More information

PLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science

PLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science PLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science APRIL 2017 EXAMINATIONS CSC 104 H1S Instructor(s): G. Baumgartner Duration 3 hours PLEASE HAND IN No Aids Allowed Student Number: Last (Family)

More information

CS 253. January 14, 2017

CS 253. January 14, 2017 CS 253 Department of Computer Science College of Engineering Boise State University January 14, 2017 1/30 Motivation Most programming tasks can be implemented using abstractions (e.g. representing data

More information

What is a Fraction? Fractions. One Way To Remember Numerator = North / 16. Example. What Fraction is Shaded? 9/16/16. Fraction = Part of a Whole

What is a Fraction? Fractions. One Way To Remember Numerator = North / 16. Example. What Fraction is Shaded? 9/16/16. Fraction = Part of a Whole // Fractions Pages What is a Fraction? Fraction Part of a Whole Top Number? Bottom Number? Page Numerator tells how many parts you have Denominator tells how many parts are in the whole Note: the fraction

More information

6.001 Notes: Section 31.1

6.001 Notes: Section 31.1 6.001 Notes: Section 31.1 Slide 31.1.1 In previous lectures we have seen a number of important themes, which relate to designing code for complex systems. One was the idea of proof by induction, meaning

More information

Fraction Arithmetic. A proper fraction is a fraction with a smaller numerator than denominator.

Fraction Arithmetic. A proper fraction is a fraction with a smaller numerator than denominator. Fraction Arithmetic FRAX is a game that is designed to help you and your student/child master fractions, but it does not teach them the basics. I ve put together this document to help remind you about

More information

Algebra2go: Working with Fractions and Mixed Numbers

Algebra2go: Working with Fractions and Mixed Numbers Algebrago: Working with Fractions and Mixed Numbers Algebrago Review of Fractions. Understand Fractions on a Number Line Fractions are used to represent quantities between the whole numbers on a number

More information

Control structures: if

Control structures: if Control structures: if Like a recipe tells the cook what to do, a program tells the computer what to do; in imperative languages like Java, lines in the program are imperative statements and you can imagine

More information

Subset sum problem and dynamic programming

Subset sum problem and dynamic programming Lecture Notes: Dynamic programming We will discuss the subset sum problem (introduced last time), and introduce the main idea of dynamic programming. We illustrate it further using a variant of the so-called

More information

Discrete Mathematics Introduction

Discrete Mathematics Introduction Discrete Mathematics Introduction Saad Mneimneh 1 Introduction College mathematics will often focus on calculus, and while it is true that calculus is the most important field that started modern mathematics,

More information

1. O(log n), because at worst you will only need to downheap the height of the heap.

1. O(log n), because at worst you will only need to downheap the height of the heap. These are solutions for the practice final. Please note that these solutions are intended to provide you with a basis to check your own answers. In order to get full credit on the exam, you must show all

More information

Rational Expressions Sections

Rational Expressions Sections Rational Expressions Sections Multiplying / Dividing Let s first review how we multiply and divide fractions. Multiplying / Dividing When multiplying/ dividing, do we have to have a common denominator?

More information

Specifying, Creating, and Comparing Algorithms. And another look at JavaScript

Specifying, Creating, and Comparing Algorithms. And another look at JavaScript Specifying, Creating, and Comparing Algorithms And another look at JavaScript Learning Goals. Characterize a problem solution as an algorithm, including inputs, outputs and any constraints (for example,

More information

Chapter 3 (part 3) Describing Syntax and Semantics

Chapter 3 (part 3) Describing Syntax and Semantics Chapter 3 (part 3) Describing Syntax and Semantics Chapter 3 Topics Introduction The General Problem of Describing Syntax Formal Methods of Describing Syntax Attribute Grammars Describing the Meanings

More information

The Further Mathematics Support Programme

The Further Mathematics Support Programme Degree Topics in Mathematics Groups A group is a mathematical structure that satisfies certain rules, which are known as axioms. Before we look at the axioms, we will consider some terminology. Elements

More information

1 Dynamic Memory continued: Memory Leaks

1 Dynamic Memory continued: Memory Leaks CS104: Data Structures and Object-Oriented Design (Fall 2013) September 3, 2013: Dynamic Memory, continued; A Refresher on Recursion Scribes: CS 104 Teaching Team Lecture Summary In this lecture, we continue

More information

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation and the type of an object. Even simple scaling turns a

More information

This is already grossly inconvenient in present formalisms. Why do we want to make this convenient? GENERAL GOALS

This is already grossly inconvenient in present formalisms. Why do we want to make this convenient? GENERAL GOALS 1 THE FORMALIZATION OF MATHEMATICS by Harvey M. Friedman Ohio State University Department of Mathematics friedman@math.ohio-state.edu www.math.ohio-state.edu/~friedman/ May 21, 1997 Can mathematics be

More information

Propositional Logic. Part I

Propositional Logic. Part I Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.

More information

Year 6 Step 1 Step 2 Step 3 End of Year Expectations Using and Applying I can solve number problems and practical problems involving a range of ideas

Year 6 Step 1 Step 2 Step 3 End of Year Expectations Using and Applying I can solve number problems and practical problems involving a range of ideas Year 6 Step 1 Step 2 Step 3 End of Year Expectations Using and Applying I can solve number problems and practical problems involving a range of ideas Number Number system and counting Fractions and decimals

More information

Year 6 Step 1 Step 2 Step 3 End of Year Expectations Using and Applying I can solve number problems and practical problems involving a range of ideas

Year 6 Step 1 Step 2 Step 3 End of Year Expectations Using and Applying I can solve number problems and practical problems involving a range of ideas Year 6 Step 1 Step 2 Step 3 End of Year Expectations Using and Applying I can solve number problems and practical problems involving a range of ideas Number Number system and counting Fractions and decimals

More information

Week - 01 Lecture - 03 Euclid's Algorithm for gcd. Let us continue with our running example of gcd to explore more issues involved with program.

Week - 01 Lecture - 03 Euclid's Algorithm for gcd. Let us continue with our running example of gcd to explore more issues involved with program. Programming, Data Structures and Algorithms in Python Prof. Madhavan Mukund Department of Computer Science and Engineering Indian Institute of Technology, Madras Week - 01 Lecture - 03 Euclid's Algorithm

More information

Theory of Computation Prof. Raghunath Tewari Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

Theory of Computation Prof. Raghunath Tewari Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Theory of Computation Prof. Raghunath Tewari Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 01 Introduction to Finite Automata Welcome everybody. This is

More information

Module 3: New types of data

Module 3: New types of data Module 3: New types of data Readings: Sections 4 and 5 of HtDP. A Racket program applies functions to values to compute new values. These new values may in turn be supplied as arguments to other functions.

More information

Section 2.3 Rational Numbers. A rational number is a number that may be written in the form a b. for any integer a and any nonzero integer b.

Section 2.3 Rational Numbers. A rational number is a number that may be written in the form a b. for any integer a and any nonzero integer b. Section 2.3 Rational Numbers A rational number is a number that may be written in the form a b for any integer a and any nonzero integer b. Why is division by zero undefined? For example, we know that

More information

Any Integer Can Be Written as a Fraction

Any Integer Can Be Written as a Fraction All fractions have three parts: a numerator, a denominator, and a division symbol. In the simple fraction, the numerator and the denominator are integers. Eample 1: Find the numerator, denominator, and

More information

What s a Tri-state Buffer?

What s a Tri-state Buffer? What s a Tri-state Buffer? 2003 by Charles C. Lin. All rights reserved. Introduction Before we talk about tri-state buffers, let s talk about an inverter. You can read about inverters in the notes about

More information

Lesson 6-2: Function Operations

Lesson 6-2: Function Operations So numbers not only have a life but they have relationships well actually relations. There are special relations we call functions. Functions are relations for which each input has one and only one output.

More information

For Module 2 SKILLS CHECKLIST. Fraction Notation. George Hartas, MS. Educational Assistant for Mathematics Remediation MAT 025 Instructor

For Module 2 SKILLS CHECKLIST. Fraction Notation. George Hartas, MS. Educational Assistant for Mathematics Remediation MAT 025 Instructor Last Updated: // SKILLS CHECKLIST For Module Fraction Notation By George Hartas, MS Educational Assistant for Mathematics Remediation MAT 0 Instructor Assignment, Section. Divisibility SKILL: Determine

More information

Binary Search. CS 5010 Program Design Paradigms Bootcamp Lesson 8.2

Binary Search. CS 5010 Program Design Paradigms Bootcamp Lesson 8.2 Binary Search CS 5010 Program Design Paradigms Bootcamp Lesson 8.2 Mitchell Wand, 2012-2017 This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. 1 Introduction

More information

Section 1.1 Definitions and Properties

Section 1.1 Definitions and Properties Section 1.1 Definitions and Properties Objectives In this section, you will learn to: To successfully complete this section, you need to understand: Abbreviate repeated addition using Exponents and Square

More information

Lecture 1 Contracts. 1 A Mysterious Program : Principles of Imperative Computation (Spring 2018) Frank Pfenning

Lecture 1 Contracts. 1 A Mysterious Program : Principles of Imperative Computation (Spring 2018) Frank Pfenning Lecture 1 Contracts 15-122: Principles of Imperative Computation (Spring 2018) Frank Pfenning In these notes we review contracts, which we use to collectively denote function contracts, loop invariants,

More information

CS115 - Module 10 - General Trees

CS115 - Module 10 - General Trees Fall 2017 Reminder: if you have not already, ensure you: Read How to Design Programs, Sections 15 and 16. Arithmetic Expressions Recall with binary trees we could represent an expression containing binary

More information

Announcements. The current topic: Scheme. Review: BST functions. Review: Representing trees in Scheme. Reminder: Lab 2 is due on Monday at 10:30 am.

Announcements. The current topic: Scheme. Review: BST functions. Review: Representing trees in Scheme. Reminder: Lab 2 is due on Monday at 10:30 am. The current topic: Scheme! Introduction! Object-oriented programming: Python Functional programming: Scheme! Introduction! Numeric operators, REPL, quotes, functions, conditionals! Function examples, helper

More information

BITWISE OPERATORS. There are a number of ways to manipulate binary values. Just as you can with

BITWISE OPERATORS. There are a number of ways to manipulate binary values. Just as you can with BITWISE OPERATORS There are a number of ways to manipulate binary values. Just as you can with decimal numbers, you can perform standard mathematical operations - addition, subtraction, multiplication,

More information

1 The Axiom of Extensionality

1 The Axiom of Extensionality 1 The Axiom of Extensionality Primitive notion: Set A set is a group, a collection, or an aggregate of things. In fact, the words set, group, collection, and aggregate are all synonyms denoting the same

More information

We will show that the height of a RB tree on n vertices is approximately 2*log n. In class I presented a simple structural proof of this claim:

We will show that the height of a RB tree on n vertices is approximately 2*log n. In class I presented a simple structural proof of this claim: We have seen that the insert operation on a RB takes an amount of time proportional to the number of the levels of the tree (since the additional operations required to do any rebalancing require constant

More information

CSCA08 Winter 2018 Week 3: Logical Operations, Design Recipe. Marzieh Ahmadzadeh, Brian Harrington University of Toronto Scarborough

CSCA08 Winter 2018 Week 3: Logical Operations, Design Recipe. Marzieh Ahmadzadeh, Brian Harrington University of Toronto Scarborough CSCA08 Winter 2018 Week 3: Logical Operations, Design Recipe Marzieh Ahmadzadeh, Brian Harrington University of Toronto Scarborough Administrative Detail ex1 is up TT #1 and TT #2 info. can be found on

More information

To prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):

To prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions): CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 7 This lecture returns to the topic of propositional logic. Whereas in Lecture 1 we studied this topic as a way of understanding proper reasoning

More information

Topic 3: Fractions. Topic 1 Integers. Topic 2 Decimals. Topic 3 Fractions. Topic 4 Ratios. Topic 5 Percentages. Topic 6 Algebra

Topic 3: Fractions. Topic 1 Integers. Topic 2 Decimals. Topic 3 Fractions. Topic 4 Ratios. Topic 5 Percentages. Topic 6 Algebra Topic : Fractions Topic Integers Topic Decimals Topic Fractions Topic Ratios Topic Percentages Duration / weeks Content Outline PART (/ week) Introduction Converting Fractions to Decimals Converting Decimals

More information

Assignment 3: Block Ciphers

Assignment 3: Block Ciphers Assignment 3: Block Ciphers CSCI3381-Cryptography Due October 3, 2014 1 Solutions to the Written Problems 1. Block Cipher Modes of Operation 6 points per part, 30 total. Parts (a)-(d) refer to the cipherblock

More information

Instructor: Craig Duckett. Lecture 04: Thursday, April 5, Relationships

Instructor: Craig Duckett. Lecture 04: Thursday, April 5, Relationships Instructor: Craig Duckett Lecture 04: Thursday, April 5, 2018 Relationships 1 Assignment 1 is due NEXT LECTURE 5, Tuesday, April 10 th in StudentTracker by MIDNIGHT MID-TERM EXAM is LECTURE 10, Tuesday,

More information

CpSc 1011 Lab 5 Conditional Statements, Loops, ASCII code, and Redirecting Input Characters and Hurricanes

CpSc 1011 Lab 5 Conditional Statements, Loops, ASCII code, and Redirecting Input Characters and Hurricanes CpSc 1011 Lab 5 Conditional Statements, Loops, ASCII code, and Redirecting Input Characters and Hurricanes Overview For this lab, you will use: one or more of the conditional statements explained below

More information