Logarithms.

Slides:

Advertisements

Similar presentations

Searching. 2 Searching an array of integers If an array is not sorted, there is no better algorithm than linear search for finding an element in it static.

Advertisements

Searching. 2 Searching an array of integers If an array is not sorted, there is no better algorithm than linear search for finding an element in it static.

Searching. Searching an array of integers If an array is not sorted, there is no better algorithm than linear search for finding an element in it static.

1 Using logarithms to solve for t in exponential growth problems.

Properties of Logarithms

Computer Science A 14: 3/4. Computing with numbers - Precision - Representation - Computing with numbers - Example.

Copyright © Cengage Learning. All rights reserved. 9 Nonlinear Functions and Models.

WHEN MULTIPLYING LIKE BASES, YOU ADD THE EXPONENTS FOR EXAMPLE: NOW YOU TRY:

Binary Number Systems.

Doubling & Halving with Multiplication. Doubling and halving works because of the relationship between multiplication and division. Since multiplication.

Searching Also: Logarithms. 2 Searching an array of integers If an array is not sorted, there is no better algorithm than linear search for finding an.

8/2/2013 Logarithms 1 = 2 log a x Properties of Logarithms Examples 1. log a x 2 = log a (x x) Coincidence ? log b x r = r log b x Power Rule for Logarithms.

The Binary Number System

Simple Data Type Representation and conversion of numbers

Searching Also: Logarithms. 2 Searching an array of integers If an array is not sorted, there is no better algorithm than linear search for finding an.

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

WHEN MULTIPLYING LIKE BASES, YOU ADD THE EXPONENTS FOR EXAMPLE:

Binary A double zero educational presentation. Binary Basics Binary is the language computers use Only 1’s and 0’s can be found in Binary Very large numbers.

Jeopardy $100 Facts About Logarithms Exponentials to Logs Evaluating Logs Expanding Logs Condensing Logs $200 $300 $400 $300 $200 $100 $400 $300 $200 $100.

NATURAL LOGARITHMS. The Constant: e e is a constant very similar to π. Π = … e = … Because it is a fixed number we can find e 2.

Solving Exponential Equations. We can solve exponential equations using logarithms. By converting to a logarithm, we can move the variable from the exponent.

Logarithms. Strings of bits There is only one possible zero-length sequence of bits There are two possible “sequences” of a single bit: 0, 1 There are.

Logarithm Basics. The logarithm base a of b is the exponent you put on a to get b: i.e. Logs give you exponents! Definition of Logarithm a > 0 and b >

Logarithms A logarithm find an exponent for a value that is not an integer. For example we know 2 x = 4 that x = 2 or 3 x = 81 x = 4, but what about …

Exponents – Logarithms xy -31/8 -2¼ ½ xy 1/8-3 ¼-2 ½ The function on the right is the inverse of the function on the left.

Logarithmic Properties Exponential Function y = b x Logarithmic Function x = b y y = log b x Exponential Form Logarithmic Form.

Jeopardy $100 Facts About Logarithms Exponentials to Logs Evaluating Logs Expanding Logs Condensing Logs $200 $300 $200 $100 $300 $200 $100 $400 $300 $200.

Logarithms – Solving, Inverses, and Graphs To graph a logarithmic function simply enter it into your calculator: Graph y = log 10 x Since your calculator.

Copyright©amberpasillas2010. Exponents give us many shortcuts for multiplying and dividing quickly. Each of the key rules for exponents has an importance.

Solving Logarithmic Equations I.. Relationship between Exponential and Logarithmic Equations. A) Logs and Exponentials are INVERSES of each other. 1) That.

Goals:  Understand logarithms as the inverse of exponents  Convert between exponential and logarithmic forms  Evaluate logarithmic functions.

LOGARITHMIC FUNCTIONS. LOG FUNCTIONS Exact Values Find the exact value of log 3 81 log 3 81 = x 3 x = 81 3 x = 3 4 x = 4 1.Set the equation equal to.

WHAT IS BINARY? Binary is a number system that only uses two digits: 1 and 0. Any information that processed by a computer it is put into sequence of.

Floating Point. Binary Fractions.

Logarithmic Functions

A brief comparison of integer and double representation

Computer Architecture & Operations I

Algorithmic Efficency

Solving Exponential Equations

Chapter 3 Data Storage.

Numbers in a Computer Unsigned integers Signed magnitude

Number Systems.

Logarithmic Functions

Logarithmic and exponential relationships

DIVISIBILITY RULES LESSON 1.

Solving Exponential Equations

LOGARITHMS AND THEIR PROPERTIES

Change of Base.

Unit 8 [7-3 in text] Logarithmic Functions

Log Functions Unit 3.

Exponents and Logarithms

CSE373: Data Structures and Algorithms Lecture 2: Math Review; Algorithm Analysis Dan Grossman Fall 2013.

EXPONENTIAL EXPRESSIONS

7.6 Solve Exponential and Logarithmic Equations

EXPONENTIAL EXPRESSIONS

Chapter 2: Number Systems

Arithmetic and geometric sequences

Digital Encodings.

Objectives Use properties to simplify logarithmic expressions.

3.4 Exponential and Logarithmic Equations

Number Systems Rayat Shikshan Sanstha’s

Storing Integers and Fractions

Exponential and Logarithmic Functions

The Exponential Function and Logarithms

Number Systems Rayat Shikshan Sanstha’s

EXPONENT RULES.

Logarithmic Functions

EXPONENTIAL EXPRESSIONS

Presentation transcript:

Logarithms

Strings of bits There is only one possible zero-length sequence of bits There are two possible “sequences” of a single bit: 0, 1 There are four sequences of two bits: 00 01, 10 11 There are eight sequences of three bits: 000 001, 010 011, 100 101, 110 111 Each time you add a bit, you double the number of possible sequences Add 0 to the end of each existing sequence, and do the same for 1 “Taking the logarithm” is the inverse of exponentiation 20 = 1 21 = 2 22 = 4 23 = 8, etc. log21 = 0 log22 = 1 log24 = 2 log28 = 3, etc.

Logarithms In computer science, we almost always work with logarithms base 2, because we work with bits log2n (or we can just write log n) tells us how many bits we need to represent n possibilities Example: To represent 10 digits, we need log 10 = 3.322 bits Since we can’t have fractional bits, we need 4 bits, with some bit patterns not used: 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1001, and not 1010, 1011, 1100, 1101, 1110, 1111 Logarithms also tell us how many times we can cut a positive integer in half before reaching 1 Example: 16/2=8, 8/2=4, 4/2=2, 2/2=1, and log 16 = 4 Example: 10/2=5, 5/2=2.5, 2.5/2=1.25, and log 10 = 3.322

Relationships Logarithms of the same number to different bases differ by a constant factor log2(2) = 1.000 log10(2) = 0.301 log2(2)/log10(2) = 3.322 log2(3) = 1.585 log10(3) = 0.477 log2(3)/log10(3) = 3.322 log2(4) = 2.000 log10(4) = 0.602 log2(4)/log10(4) = 3.322 log2(5) = 2.322 log10(5) = 0.699 log2(5)/log10(5) = 3.322 log2(6) = 2.585 log10(6) = 0.778 log2(6)/log10(6) = 3.322 log2(7) = 2.807 log10(7) = 0.845 log2(7)/log10(7) = 3.322 log2(8) = 3.000 log10(8) = 0.903 log2(8)/log10(8) = 3.322 log2(9) = 3.170 log10(9) = 0.954 log2(9)/log10(9) = 3.322 log2(10)= 3.322 log10(10) = 1.000 log2(10)/log10(10)= 3.322

Review Logarithms are exponents if bx = a, then logba = x if 103 = 1000, then log101000 = 3 if 28 = 256, then log2256 = 8 If we start with x=1 and multipy x by 2 eight times, we get 256 If we start with x=256 and divide x by 2 eight times, we get 1 log2 is how many times we halve a number to get 1 log2 is the number of bits required to represent a number in binary (fractions are rounded up) In computer science we usually use log to mean log2

The End