Order of operations - wikipedia Order of operations In mathematics and computer programming, the order of operations ( or operator precedence ) is a collection of rules that reflect conventions about which procedures to perform first in order to evaluate a given mathematical expression. For example, in mathematics and most computer languages, multiplication is granted a higher precedence than addition, and it has been this way since the introduction of modern algebraic notation. Thus, the expression 2 + 3 × 4 is interpreted to have the value 2 + ( 3 × 4 ) = 14, not ( 2 + 3 ) × 4 = 20. With the introduction of exponents in the 16th and 17th centuries, they were given precedence over both addition and multiplication and could be placed only as a superscript to the right of their base. Thus 3 + 5 = 28 and 3 × 5 = 75. These conventions exist to eliminate ambiguity while allowing notation to be as brief as possible. Where it is desired to override the precedence conventions, or even simply to emphasize them, parentheses ( ) ( sometimes replaced by brackets ( ) or braces ( ) for readability ) can indicate an alternate order or reinforce the default order to avoid confusion. For example, ( 2 + 3 ) × 4 = 20 forces addition to precede multiplication, and ( 3 + 5 ) = 64 forces addition to precede exponentiation. Contents 1 Definition 1.1 Examples 1.2 Exceptions 2 Mnemonics 3 Special cases 4 Calculators 5 Programming languages 6 See also 7 Notes 8 References 9 External links Definition The order of operations used throughout mathematics, science, technology and many computer programming languages is expressed here : exponents and roots multiplication and division addition and subtraction This means that if a mathematical expression is preceded by one binary operator and followed by another, the operator higher on the list should be applied first. The commutative and associative laws of addition and multiplication allow adding terms in any order, and multiplying factors in any order -- but mixed operations must obey the standard order of operations. It is helpful to treat division as multiplication by the reciprocal ( multiplicative inverse ) and subtraction as addition of the opposite ( additive inverse ). Thus 3 ÷ 4 = 3 × 1⁄4 ; in other words the quotient of 3 and 4 equals the product of 3 and 1⁄4. Also 3 − 4 = 3 + ( − 4 ) ; in other words the difference of 3 and 4 equals the sum of 3 and − 4. Thus, 1 − 3 + 7 can be thought of as the sum of 1, − 3, and 7, and add in any order : ( 1 − 3 ) + 7 = − 2 + 7 = 5 and in reverse order ( 7 − 3 ) + 1 = 4 + 1 = 5, always keeping the negative sign with the 3. The root symbol √ requires a symbol of grouping around the radicand. The usual symbol of grouping is a bar ( called vinculum ) over the radicand. Other functions use parentheses around the input to avoid ambiguity. The parentheses are sometimes omitted if the input is a monomial. Thus, sin 3x = sin ( 3x ), but sin x + y = sin ( x ) + y, because x + y is not a monomial. Some calculators and programming languages require parentheses around function inputs, some do not. Symbols of grouping can be used to override the usual order of operations. Grouped symbols can be treated as a single expression. Symbols of grouping can be removed using the associative and distributive laws, also they can be removed if the expression inside the symbol of grouping is sufficiently simplified so no ambiguity results from their removal. Examples 1 + 3 + 5 = 4 + 5 = 2 + 5 = 7. ( displaystyle ( sqrt ( 1 + 3 ) ) + 5 = ( sqrt ( 4 ) ) + 5 = 2 + 5 = 7. ) A horizontal fractional line also acts as a symbol of grouping : 1 + 2 3 + 4 + 5 = 3 7 + 5. ( displaystyle ( \frac ( 1 + 2 ) ( 3 + 4 ) ) + 5 = ( \frac ( 3 ) ( 7 ) ) + 5. ) For ease in reading, other grouping symbols, such as curly braces ( ) or square brackets ( ), are often used along with parentheses ( ). For example : ( ( 1 + 2 ) − 3 ) − ( 4 − 5 ) = ( 3 − 3 ) − ( − 1 ) = 1. ( displaystyle ( ( 1 + 2 ) - 3 ) - ( 4 - 5 ) = ( 3 - 3 ) - ( - 1 ) = 1. ) Exceptions There are differing conventions concerning the unary operator − ( usually read `` minus '' ). In written or printed mathematics, the expression − 3 is interpreted to mean 0 − ( 3 ) = − 9, but in some applications and programming languages, notably Microsoft Excel ( and other spreadsheet applications ) and the programming language bc, unary operators have a higher priority than binary operators, that is, the unary minus has higher precedence than exponentiation, so in those languages − 3 will be interpreted as ( − 3 ) = 9. This does not apply to the binary minus operator − ; for example while the formulas = - 2 ^ 2 and = 0 + - 2 ^ 2 return 4 in Microsoft Excel, the formula = 0 - 2 ^ 2 returns − 4. In cases where there is the possibility that the notation might be misinterpreted, a binary minus operation can be enforced by explicitly specifying a leading 0 ( as in 0 - 2 ^ 2 instead of just - 2 ^ 2 ), or parentheses can be used to clarify the intended meaning. Similarly, there can be ambiguity in the use of the slash symbol / in expressions such as 1 / 2x. If one rewrites this expression as 1 ÷ 2x and then interprets the division symbol as indicating multiplication by the reciprocal, this becomes : 1 ÷ 2 × x = 1 × 1⁄2 × x = 1⁄2 × x. With this interpretation 1 ÷ 2x is equal to ( 1 ÷ 2 ) x. However, in some of the academic literature, multiplication denoted by juxtaposition ( also known as implied multiplication ) is interpreted as having higher precedence than division, so that 1 ÷ 2x equals 1 ÷ ( 2x ), not ( 1 ÷ 2 ) x. For example, the manuscript submission instructions for the Physical Review journals state that multiplication is of higher precedence than division with a slash, and this is also the convention observed in prominent physics textbooks such as the Course of Theoretical Physics by Landau and Lifshitz and the Feynman Lectures on Physics. Mnemonics Mnemonics are often used to help students remember the rules, involving the first letters of words representing various operations. Different mnemonics are in use in different countries. In the United States, the acronym PEMDAS is common. It stands for Parentheses, Exponents, Multiplication / Division, Addition / Subtraction. PEMDAS is often expanded to the mnemonic `` Please Excuse My Dear Aunt Sally ''. Canada and New Zealand use BEDMAS, standing for Brackets, Exponents, Division / Multiplication, Addition / Subtraction. Most common in the UK, India and Australia are BODMAS meaning Brackets, Order, Division / Multiplication, Addition / Subtraction. Nigeria and some other West African countries also use BODMAS. Similarly in the UK, BIDMAS is used, standing for Brackets, Indices, Division / Multiplication, Addition / Subtraction. These mnemonics may be misleading when written this way. For example, using any of the above rules in the order `` addition first, subtraction afterward '' would incorrectly evaluate the expression 10 − 3 + 2. The correct value is 9 ( and not 5, as if the addition would be carried out first and the result used with the subtraction afterwards ). Special cases If exponentiation is indicated by stacked symbols, the usual rule is to work from the top down, because exponentiation is right - associative in mathematics thus : a = a which typically is not equal to ( a ). However, some computer systems may resolve the ambiguous expression differently. For example, Microsoft Excel evaluates a ^ b ^ c as ( a ), which is opposite of normally accepted convention of top - down order of execution for exponentiation. Thus 4 ^ 3 ^ 2 is evaluated to 4,096 instead of 262,144. Another difference in Microsoft Excel is - a ^ b which is evaluated as ( - a ) ^ b instead of - ( a ^ b ). For compatibility, the same behavior is observed on LibreOffice. The computational programming language MATLAB is another example of a computer system resolving the stacked exponentiation in the non-standard way. Calculators Main article : Calculator input methods Different calculators follow different orders of operations. Many simple calculators without a stack implement chain input working left to right without any priority given to different operators, for example typing 1 + 2 × 3 yields 9, while more sophisticated calculators will use a more standard priority, for example typing 1 + 2 × 3 yields 7. The Microsoft Calculator program uses the former in its standard view and the latter in its scientific and programmer views. Chain input expects two operands and an operator. When the next operator is pressed, the expression is immediately evaluated and the answer becomes the left hand of the next operator. Advanced calculators allow entry of the whole expression, grouped as necessary, and evaluates only when the user uses the equals sign. Calculators may associate exponents to the left or to the right depending on the model or the evaluation mode. For example, the expression a ^ b ^ c is interpreted as a on the TI - 92 and the TI - 30XS MultiView in `` Mathprint mode '', whereas it is interpreted as ( a ) on the TI - 30XII and the TI - 30XS MultiView in `` Classic mode ''. An expression like 1 / 2x is interpreted as 1 / ( 2x ) by TI - 82, but as ( 1 / 2 ) x by TI - 83 and every other TI calculator released since 1996, as well as by all Hewlett - Packard calculators with algebraic notation. While the first interpretation may be expected by some users, only the latter is in agreement with the standard rule that multiplication and division are of equal precedence, so 1 / 2x is read one divided by two and the answer multiplied by x. When the user is unsure how a calculator will interpret an expression, it is a good idea to use parentheses so there is no ambiguity. Calculators that utilize reverse Polish notation ( RPN ), also known as postfix notation, use a stack to enter formulas without the need for parentheses. Programming languages Some programming languages use precedence levels that conform to the order commonly used in mathematics, though others, such as APL, Smalltalk or Occam, have no operator precedence rules ( in APL, evaluation is strictly right to left ; in Smalltalk and Occam, it is strictly left to right ). In addition, because many operators are not associative, the order within any single level is usually defined by grouping left to right so that 16 / 4 / 4 is interpreted as ( 16 / 4 ) / 4 = 1 rather than 16 / ( 4 / 4 ) = 16 ; such operators are perhaps misleadingly referred to as `` left associative ''. Exceptions exist ; for example, languages with operators corresponding to the cons operation on lists usually make them group right to left ( `` right associative '' ), e.g. in Haskell, 1 : 2 : 3 : 4 : ( ) = = 1 : ( 2 : ( 3 : ( 4 : ( ) ) ) ) = = ( 1, 2, 3, 4 ). The logical bitwise operators in C ( and all programming languages that borrow precedence rules from C, for example, C++, Perl and PHP ) have a precedence level that the creator of the C language considered unsatisfactory. However, many programmers have become accustomed to this order. The relative precedence levels of operators found in many C - style languages are as follows : 1 ( ) ( ) - >. : : Function call, scope, array / member access ! ~ - + * & sizeof type cast + + -- ( most ) unary operators, sizeof and type casts ( right to left ) * / % MOD Multiplication, division, modulo + - Addition and subtraction 5 < < > > Bitwise shift left and right 6 < < = > > = Comparisons : less - than and greater - than 7 = = ! = Comparisons : equal and not equal 8 & Bitwise AND 9 Bitwise exclusive OR ( XOR ) 10 Bitwise inclusive ( normal ) OR 11 && Logical AND 12 Logical OR 13 ? : Conditional expression ( ternary ) 14 = + = - = * = / = % = & = = ^ = < < = > > = Assignment operators ( right to left ) 15, Comma operator Examples : ( Note : in the examples below, ' ≡ ' is used to mean `` is equivalent to '', and not to be interpreted as an actual assignment operator used as part of the example expression. ) ! A + ! B ≡ ( ! A ) + ( ! B) + + A + ! B ≡ ( + + A ) + ( ! B) A + B * C ≡ A + ( B * C ) A B && C ≡ A ( B && C ) A && B = = C ≡ A && ( B = = C ) A & B = = C ≡ A & ( B = = C ) Source - to - source compilers that compile to multiple languages need to explicitly deal with the issue of different order of operations across languages. Haxe for example standardizes the order and enforces it by inserting brackets where it is appropriate. The accuracy of software developer knowledge about binary operator precedence has been found to closely follow their frequency of occurrence in source code. See also Associativity Common operator notation ( for a more formal description ) Commutativity Distributivity Hyperoperation Operator ( programming ) Operator associativity Operator overloading Operator precedence in C and C++ Polish notation Reverse Polish notation Notes Jump up ^ For example, the third edition of Mechanics by Landau and Lifshitz contains expressions such as hP / 2π ( p. 22 ), and the first volume of the Feynman Lectures contains expressions such as 1 / 2 √ N ( p. 6 -- 7 ). In both books these expressions are written with the convention that the solidus is evaluated last. References ^ Jump up to : Bronstein, Ilja Nikolaevič ; Semendjajew, Konstantin Adolfovič ( 1987 ) ( 1945 ). `` 2.4. 1.1. ''. In Grosche, Günter ; Ziegler, Viktor ; Ziegler, Dorothea. Taschenbuch der Mathematik ( in German ). 1. Translated by Ziegler, Viktor. Weiß, Jürgen ( 23 ed. ). Thun and Frankfurt am Main : Verlag Harri Deutsch ( and B.G. Teubner Verlagsgesellschaft, Leipzig ). pp. 115 -- 120. ISBN 3 - 87144 - 492 - 8. Jump up ^ `` Ask Dr. Math ''. Math Forum. 22 November 2000. Retrieved 5 March 2012. Jump up ^ `` Order of Operations Lessons ''. Algebra. Help. Retrieved 5 March 2012. Jump up ^ Allen R. Angel, Elementary Algebra for College Students 8 / E ; Chapter 1, Section 9, Objective 3 Jump up ^ `` Formula Returns Unexpected Positive Value ''. Support.microsoft.com. 15 August 2005. Retrieved 5 March 2012. ^ Jump up to : Ball, John A. ( 1978 ). Algorithms for RPN calculators ( 1 ed. ). Cambridge, Massachusetts, USA : Wiley - Interscience, John Wiley & Sons, Inc. p. 31. ISBN 0 - 471 - 03070 - 8. Jump up ^ `` division and multiplication have the same priority '', http://www.mathcentre.ac.uk/resources/uploaded/mc-ty-rules-2009-1.pdf Jump up ^ `` Physical Review Style and Notation Guide '' ( PDF ). American Physical Society. Section IV -- E -- 2 -- e. Retrieved 5 August 2012. Jump up ^ http://www.mathcentre.ac.uk/resources/uploaded/mc-ty-rules-2009-1.pdf Jump up ^ `` Please Excuse My Dear Aunt Sally ( PEMDAS ) -- Forever ! ''. Education Week - Coach G 's Teaching Tips. 1 January 2011. Jump up ^ `` What is PEMDAS ? - Definition, Rule & Examples ''. Study.com. Jump up ^ http://syllabus.bos.nsw.edu.au/assets/global/files/maths_s3_sampleu1.doc Jump up ^ Olver, Frank W.J. ; Lozier, Daniel W. ; Boisvert, Ronald F. ; Clark, Charles W., eds. ( 2010 ). NIST Handbook of Mathematical Functions. National Institute of Standards and Technology ( NIST ), U.S. Department of Commerce, Cambridge University Press. ISBN 978 - 0 - 521 - 19225 - 5. MR 2723248. ( 1 ) ^ Jump up to : Exponentiation Associativity and Standard Math Notation Codeplea. 23 Aug 2016. Retrieved 20 Sep 2016. Jump up ^ `` Implied Multiplication Versus Explicit Multiplication on TI Graphing Calculators ''. Texas Instruments. 2011 - 01 - 16. 11773. Archived from the original on 2016 - 04 - 17. Retrieved 2015 - 08 - 24. Jump up ^ Zachary, Joseph L. ( 1997 ). `` Introduction to scientific programming - Computational problem solving using Maple and C - Operator precedence worksheet ''. Retrieved 2015 - 08 - 25. Jump up ^ Zachary, Joseph L. ( 1997 ). `` Introduction to scientific programming - Computational problem solving using Mathematica and C - Operator precedence notebook ''. Retrieved 2015 - 08 - 25. Jump up ^ Dennis M. Ritchie : The Development of the C Language. In History of Programming Languages, 2nd ed., ACM Press 1996. Jump up ^ 6 ÷ 2 ( 1 + 2 ) = ? Andy Li 's Blog. 2 May 2011. Retrieved 31 December 2012. Jump up ^ `` Developer beliefs about binary operator precedence '' Derek M. Jones, CVu 18 ( 4 ) : 14 -- 21 External links `` Order of operations ''. PlanetMath. Retrieved from `` https://en.wikipedia.org/w/index.php?title=Order_of_operations&oldid=841873951 '' Categories : Abstract algebra Algebra Mnemonics Operators ( programming ) Hidden categories : CS1 German - language sources ( de ) Use dmy dates from February 2015 Talk Contents About Wikipedia Wikibooks Bân - lâm - gú Català Čeština Dansk Deutsch Ελληνικά Español Euskara فارسی Français 한국어 Bahasa Indonesia Íslenska Italiano עברית Nederlands 日本 語 Norsk Polski Português Română Русский Shqip Simple English Српски / srpski Suomi Svenska தமிழ் ไทย Türkçe Українська Tiếng Việt 中文 25 more Edit links This page was last edited on 18 May 2018, at 16 : 44. Text is available under the Creative Commons Attribution - ShareAlike License ; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia ® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. About Wikipedia

Question: why do we need the order of operations rule
Answer: in order to evaluate a given mathematical expression