Logarithms APPENDIX IV. 265 Appendix

Similar documents
Ch 9 Sequences, Series, and Probability

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series

Permutation Enumeration

x y z HD(x, y) + HD(y, z) HD(x, z)

Grade 6 Math Review Unit 3(Chapter 1) Answer Key

x 1 + x x n n = x 1 x 2 + x x n n = x 2 x 3 + x x n n = x 3 x 5 + x x n = x n

Unit 5: Estimating with Confidence

CP 405/EC 422 MODEL TEST PAPER - 1 PULSE & DIGITAL CIRCUITS. Time: Three Hours Maximum Marks: 100

General Model :Algorithms in the Real World. Applications. Block Codes

4.3 COLLEGE ALGEBRA. Logarithms. Logarithms. Logarithms 11/5/2015. Logarithmic Functions

PERMUTATIONS AND COMBINATIONS

3. Error Correcting Codes

Lecture 4: Frequency Reuse Concepts

PERMUTATIONS AND COMBINATIONS

7. Counting Measure. Definitions and Basic Properties

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER

A Novel Three Value Logic for Computing Purposes

arxiv: v2 [math.co] 15 Oct 2018

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

MEI Core 2. Logarithms and exponentials. Section 2: Modelling curves using logarithms. Modelling curves of the form y kx

A Math Learning Center publication adapted and arranged by. EUGENE MAIER and LARRY LINNEN

Extra Practice 1. Name Date. Lesson 1.1: Patterns in Division

X-Bar and S-Squared Charts

PERMUTATION AND COMBINATION

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing

Counting on r-fibonacci Numbers

POWERS OF 3RD ORDER MAGIC SQUARES

On Parity based Divide and Conquer Recursive Functions

Math 140 Introductory Statistics

You Think You ve Got Problems? Marc Brodie Associate Professor of Mathematics, WJU

Final exam PS 30 December 2009

A study on the efficient compression algorithm of the voice/data integrated multiplexer

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12

lecture notes September 2, Sequential Choice

COLLEGE ALGEBRA LECTURES Copyrights and Author: Kevin Pinegar

AQA Level 2 Further mathematics Further algebra. Section 3: Inequalities and indices

CS3203 #5. 6/9/04 Janak J Parekh

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains

CHAPTER 8 JOINT PAPR REDUCTION AND ICI CANCELLATION IN OFDM SYSTEMS

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters?

Introduction to Wireless Communication Systems ECE 476/ECE 501C/CS 513 Winter 2003

A generalization of Eulerian numbers via rook placements

Reducing Power Dissipation in Complex Digital Filters by using the Quadratic Residue Number System Λ

The Institute of Chartered Accountants of Sri Lanka

Name Class. Date Section. Test Form A Chapter Chapter 9 Infinite Series. 1 n 1 2 n 3n 1, n 1, 2, 3, Find the fourth term of the sequence

On the Number of Permutations on n Objects with. greatest cycle length

High Speed Area Efficient Modulo 2 1

Lecture 28: MOSFET as an Amplifier. Small-Signal Equivalent Circuit Models.

Chapter (6) Discrete Probability Distributions Examples

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013

Table Of Contents Blues Turnarounds

A New Design of Log-Periodic Dipole Array (LPDA) Antenna

8. Combinatorial Structures

13 Legislative Bargaining

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS

Comparison of Frequency Offset Estimation Methods for OFDM Burst Transmission in the Selective Fading Channels

RMS WIDTH OF PULSES PROPAGATING IN AN ARBITRARY DISPERSIVE MEDIUM

Department of Electrical and Computer Engineering, Cornell University. ECE 3150: Microelectronics. Spring Due on April 26, 2018 at 7:00 PM

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS

VIII. Shell-Voicings

202 Chapter 9 n Go Bot. Hint

Performance Analysis of Channel Switching with Various Bandwidths in Cognitive Radio

Commonwealth of Pennsylvania PA Test Method No. 6 Department of Transportation October Pages LABORATORY TESTING SECTION. Method of Test for

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73,

sible number of wavelengths. The wave~~ngt~ ~ ~ ~ c ~ n b~dwidth is set low eno~gh to interfax One of the most im

Lab 2: Common Source Amplifier.

ELEN 624 Signal Integrity

Intermediate Information Structures

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code

2. There are n letter and n addressed envelopes. The probability that all the letters are not kept in the right envelope, is. (c)

Math 7 Flipped Mastery Self Tester Worksheet Name: Class:. Chapter 1 (Unit 1) Patterns and Relationships - Accommodated 1.1 Patterns In Division /36

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS

Join a Professional Association

Single Bit DACs in a Nutshell. Part I DAC Basics

5 Quick Steps to Social Media Marketing

HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING

Laboratory Exercise 3: Dynamic System Response Laboratory Handout AME 250: Fundamentals of Measurements and Data Analysis

A Novel Small Signal Power Line Quality Measurement System

11.11 Two-Channel Filter Banks 1/27

BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION

EECE 301 Signals & Systems Prof. Mark Fowler

Simulation of Laser Manipulation of Bloch. Vector in Adiabatic Regime

Cross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs

Arithmetic Sequences and Series Sequences and Series Preliminary Maths

Problem of calculating time delay between pulse arrivals

Dividing Connected Chores Fairly

Methods to Reduce Arc-Flash Hazards

GENERALIZED FORM OF A 4X4 STRONGLY MAGIC SQUARE

SHORT-TERM TRAVEL TIME PREDICTION USING A NEURAL NETWORK

Western Number Theory Problems, 17 & 19 Dec 2016

CHAPTER 6 IMPLEMENTATION OF DIGITAL FIR FILTER

AS Exercise A: The multiplication principle. Probability using permutations and combinations. Multiplication principle. Example.

Sapana P. Dubey. (Department of applied mathematics,piet, Nagpur,India) I. INTRODUCTION

Transcription:

APPENDIX IV Logarithms Sometimes, a umerical expressio may ivolve multiplicatio, divisio or ratioal powers of large umbers. For such calculatios, logarithms are very useful. They help us i makig difficult calculatios easy. I Chemistry, logarithm values are required i solvig problems of chemical kietics, thermodyamics, electrochemistry, etc. We shall first itroduce this cocept, ad discuss the laws, which will have to be followed i workig with logarithms, ad the apply this techique to a umber of problems to show how it makes difficult calculatios simple. We kow that = 8, = 9, = 1, 0 = 1 I geeral, for a positive real umber a, ad a ratioal umber m, let a m = b, where b is a real umber. I other words the m th power of base a is b. Aother way of statig the same fact is logarithm of b to base a is m. If for a positive real umber a, a 1 a m = b, we say that m is the logarithm of b to the base a. We write this as b log a = m, log beig the abbreviatio of the word logarithm. Thus, we have log 8 =, Sice = 8 log 9 =, Sice = 9 1 log =, Sice = 1 log 1 = 0, 0 Sice = 1 Laws of Logarithms I the followig discussio, we shall take logarithms to ay base a, (a > 0 ad a 1) First Law: log a (m) = log a m + log a Proof: Suppose that log a m = x ad log a = y The a x = m, a y = Hece m = a x.a y = a x+y It ow follows from the defiitio of logarithms that log a (m) = x + y = log a m log a m Secod Law: log a = log a m log a Proof: Let log a m = x, log a = y 6 Appedix

The a x = m, a y = m Hece Therefore x a = = a y a x y m loga = x y = loga m loga Third Law : log a (m ) = log a m Proof : As before, if log a m = x, the a x x x m = a = a The ( ) = m givig log a (m ) = x = log a m Thus accordig to First Law: the log of the product of two umbers is equal to the sum of their logs. Similarly, the Secod Law says: the log of the ratio of two umbers is the differece of their logs. Thus, the use of these laws coverts a problem of multiplicatio / divisio ito a problem of additio/ subtractio, which are far easier to perform tha multiplicatio/divisio. That is why logarithms are so useful i all umerical computatios. Logarithms to Base 10 Because umber 10 is the base of writig umbers, it is very coveiet to use logarithms to the base 10. Some examples are: log 10 10 = 1, sice 10 1 = 10 log 10 100 =, sice 10 = 100 log 10 10000 = 4, sice 10 4 = 10000 log 10 0.01 =, sice 10 = 0.01 log 10 0.001 =, sice 10 = 0.001 ad log 10 1 = 0 sice 10 0 = 1 The above results idicate that if is a itegral power of 10, i.e., 1 followed by several zeros or 1 preceded by several zeros immediately to the right of the decimal poit, the log ca be easily foud. If is ot a itegral power of 10, the it is ot easy to calculate log. But mathematicias have made tables from which we ca read off approximate value of the logarithm of ay positive umber betwee 1 ad 10. Ad these are sufficiet for us to calculate the logarithm of ay umber expressed i decimal form. For this purpose, we always express the give decimal as the product of a itegral power of 10 ad a umber betwee 1 ad 10. Stadard Form of Decimal We ca express ay umber i decimal form, as the product of (i) a itegral power of 10, ad (ii) a umber betwee 1 ad 10. Here are some examples: (i). lies betwee 10 ad 100. =. 1 10 =. 10 10 (ii) 108.4 lies betwee 1000 ad 10000. 108.4 = 108.4 10 = 1.084 10 1000 (iii) 0.00 lies betwee 0.001 ad 0.01 0.00 = (0.00 1000) 10 =.0 10 (iv) 0.000 lies betwee 0.0001 ad 0.001 0.000 = (0.000 10000) 10 4 =. 10 4 Chemistry 66

I each case, we divide or multiply the decimal by a power of 10, to brig oe o-zero digit to the left of the decimal poit, ad do the reverse operatio by the same power of 10, idicated separately. Thus, ay positive decimal ca be writte i the form = m 10 p where p is a iteger (positive, zero or egative) ad 1< m < 10. This is called the stadard form of. Workig Rule 1. Move the decimal poit to the left, or to the right, as may be ecessary, to brig oe o-zero digit to the left of decimal poit.. (i) If you move p places to the left, multiply by 10 p. (ii) If you move p places to the right, multiply by 10 p. (iii) If you do ot move the decimal poit at all, multiply by 10 0. (iv) Write the ew decimal obtaied by the power of 10 (of step ) to obtai the stadard form of the give decimal. Characteristic ad Matissa Cosider the stadard form of = m 10 p, where 1 < m < 10 Takig logarithms to the base 10 ad usig the laws of logarithms log = log m + log 10 p = log m + p log 10 = p + log m Here p is a iteger ad as 1 < m < 10, so 0 < log m < 1, i.e., m lies betwee 0 ad 1. Whe log has bee expressed as p + log m, where p is a iteger ad 0 log m < 1, we say that p is the characteristic of log ad that log m is the matissa of log. Note that characteristic is always a iteger positive, egative or zero, ad matissa is ever egative ad is always less tha 1. If we ca fid the characteristics ad the matissa of log, we have to just add them to get log. Thus to fid log, all we have to do is as follows: 1. Put i the stadard form, say = m 10 p, 1 < m <10. Read off the characteristic p of log from this expressio (expoet of 10).. Look up log m from tables, which is beig explaied below. 4. Write log = p + log m If the characteristic p of a umber is say, ad the matissa is.41, the we have log = +.41 which we ca write as.41. If, however, the characteristic p of a umber m is say ad the matissa is.41, the we have log m = +.41. We caot write this as.41. (Why?) I order to avoid this cofusio we write for ad thus we write log m =.41. Now let us explai how to use the table of logarithms to fid matissas. A table is appeded at the ed of this Appedix. Observe that i the table, every row starts with a two digit umber, 10, 11, 1,. 9, 98, 99. Every colum is headed by a oe-digit umber, 0, 1,,.9. O the right, we have the sectio called Mea differeces which has 9 colums headed by 1,.9. 0 1 4 6 8 9 1 4 6 8 9 61 8 860 868 8 88 889 896 80 810 81 6 94 91 9 94 94 99 966 9 980 98 6 99 8000 800 8014 801 808 80 8041 8048 80 1 1 4 4 6 6 1 1 4 6 6 1 1 4 6 6 Now suppose we wish to fid log (6.4). The look ito the row startig with 6. I this row, look 6 Appedix

at the umber i the colum headed by. The umber is 94. This meas that log (6.0) = 0.94* But we wat log (6.4). So our aswer will be a little more tha 0.94. How much more? We look this up i the sectio o Mea differeces. Sice our fourth digit is 4, look uder the colum headed by 4 i the Mea differece sectio (i the row 6). We see the umber there. So add to 94. We get 948. So we fially have log (6.4) = 0.948. Take aother example. To fid log (8.1), we look i the row 81 uder colum, ad we fid 9096. We cotiue i the same row ad see that the mea differece uder is 4. Addig this to 9096, ad we get 9100. So, log (8.1) = 0.9100. Fidig N whe log N is give We have so far discussed the procedure for fidig log whe a positive umber give. We ow tur to its coverse i.e., to fid whe log is give ad give a method for this purpose. If log = t, we sometimes say = atilog t. Therefore our task is give t, fid its atilog. For this, we use the readymade atilog tables. Suppose log =.. To fid, first take just the matissa of log. I this case it is.. (Make sure it is positive.) Now take up atilog of this umber i the atilog table which is to be used exactly like the log table. I the atilog table, the etry uder colum i the row. is 44 ad the mea differece for the last digit i that row is, so the table gives 44. Hece, atilog (.) =.44 Now sice log =., the characteristic of log is. So the stadard form of is give by =.44 10 or = 44. Illustratio 1: If log x = 1.01, fid x. Solutio: We fid that the umber correspodig to 01 is 119. Sice characteristic of log x is 1, we have x = 1.19 10 1 = 11.9 Illustratio : If log x =.1, fid x. Solutio: From atilog tables, we fid that the umber correspodig to 1 is 166. Sice the characteristic is i.e.,, so x = 1.66 10 = 0.0166 Use of Logarithms i Numerical Calculatios Illustratio 1: Fid 6. 1.9 Solutio: Let x = 6. 1.9 The log x = log (6. 1.9) = log 6. + log 1.9 Now, log 6. = 0.99 log 1.9 = 0.1106 log x = 0.9099, Takig atilog * It should, however, be oted that the values give i the table are ot exact. They are oly approximate values, although we use the sig of equality which may give the impressio that they are exact values. The same covetio will be followed i respect of atilogarithm of a umber. Chemistry 68

x = 8.1 Illustratio : 1. (1.) Fid 11.. Solutio: Let x = The log x = log (1.) 11.. (1.) 11.. = log 1. log (11..) = log 1. log 11.. Now, log 1. = 0.0899 log 1. = 0.148 log 11. = 1.049 log. = 1.11 log x = 0.148 1.049 1.11 =.14 x = 0.0018 Illustratio : Fid (1.4) 6 (.) 1 Solutio: Let x = (1.4) 6 (.) 1 The log x = 1 log (1.4) 6 (.) 1 = 1 [log (1.4) + log 6 log (.) log 1] = log 1.4 + 1 log 6 log. 1 log 1 4 4 Now, usig log tables log 1.4 = 1.8 log 6 = 1.48 log. = 0.61 log 1 = 1. log x = log (1.8) + 1 (1.48) (0.61) 1 (1.) 4 4 =.4 x = 96 69 Appedix