Design Inspirations from Multivariate Polynomials, Part 2

Similar documents
Design Inspirations From Multivariate Polynomials, Part 1

Algebraic Expressions

Continuing discussion of CRC s, especially looking at two-bit errors

Commutative Rings and Fields

Clock Arithmetic. 1. If it is 9 o clock and you get out of school in 4 hours, when do you get out of school?

Q 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today?

STEP Support Programme. Hints and Partial Solutions for Assignment 17

Section 1.3 Review of Complex Numbers

Sect Complex Numbers

8 Primes and Modular Arithmetic

3 The fundamentals: Algorithms, the integers, and matrices

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

Cool Results on Primes

RMT 2013 Power Round Solutions February 2, 2013

CPSC 467: Cryptography and Computer Security

Algebra. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Eby, MATH 0310 Spring 2017 Page 53. Parentheses are IMPORTANT!! Exponents only change what they! So if a is not inside parentheses, then it

Polynomial Division. You may also see this kind of problem written like this: Perform the division x2 +2x 3

Chapter 4 Finite Fields

Rings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.

4 Number Theory and Cryptography

A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:

8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)

Sums and Products. a i = a 1. i=1. a i = a i a n. n 1

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.

2 so Q[ 2] is closed under both additive and multiplicative inverses. a 2 2b 2 + b

Lecture 11 - Basic Number Theory.

4.4 Solving Congruences using Inverses

Basic elements of number theory

Basic elements of number theory

SQUARE PATTERNS AND INFINITUDE OF PRIMES

Number Theory Notes Spring 2011

Part I, Number Systems. CS131 Mathematics for Computer Scientists II Note 1 INTEGERS

1. Prove that the number cannot be represented as a 2 +3b 2 for any integers a and b. (Hint: Consider the remainder mod 3).

Lecture 2. The Euclidean Algorithm and Numbers in Other Bases

Math Lecture 18 Notes

7. Prime Numbers Part VI of PJE

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

Number Theory Homework.

Chapter 5. Number Theory. 5.1 Base b representations

MATH 310: Homework 7

CHAPTER 3. Congruences. Congruence: definitions and properties

[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]

FACTORING IN QUADRATIC FIELDS. 1. Introduction

Number Theory A focused introduction

GMAT Arithmetic: Challenge (Excerpt)

P-adic numbers. Rich Schwartz. October 24, 2014

Solutions I.N. Herstein- Second Edition

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS

MODULAR ARITHMETIC KEITH CONRAD

Divisibility = 16, = 9, = 2, = 5. (Negative!)

SMT 2013 Power Round Solutions February 2, 2013

Infinite series, improper integrals, and Taylor series

CPSC 467b: Cryptography and Computer Security

Polynomial Functions and Their Graphs

Computations/Applications

An Invitation to Mathematics Prof. Sankaran Vishwanath Institute of Mathematical Science, Chennai. Unit - I Polynomials Lecture 1B Long Division

COT 3100 Applications of Discrete Structures Dr. Michael P. Frank

Math 302 Module 4. Department of Mathematics College of the Redwoods. June 17, 2011

MODULAR ARITHMETIC I

Conversions between Decimal and Binary

This is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.

4. Congruence Classes

CYCLICITY OF (Z/(p))

Unit 6 Exponents and Polynomials Lecture Notes Introductory Algebra Page 1 of 10. = xa

a = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let

11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic

CMSC 330: Organization of Programming Languages

4.2 Reducing Rational Functions

NUMBERS AND CODES CHAPTER Numbers

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

Math 31 Lesson Plan. Day 5: Intro to Groups. Elizabeth Gillaspy. September 28, 2011

Chapter Two. Integers ASSIGNMENT EXERCISES H I J 8. 4 K C B

Remainders. We learned how to multiply and divide in elementary

TESTCRACKER CAT TOPPER s PROGRAM: QUANT. Factorial

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 7

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

Math 1302 Notes 2. How many solutions? What type of solution in the real number system? What kind of equation is it?

Arithmetic Problems. Chapter Reconstruction of division problems AMM E1 This is Problem E1 of the AMERICAN MATHEMATICAL MONTHLY: x x x x

Applied Cryptography and Computer Security CSE 664 Spring 2018

Math 2602 Finite and Linear Math Fall 14. Homework 8: Core solutions

Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn

Deducing Polynomial Division Algorithms using a Groebner Basis

Chapter 5: Exponents and Polynomials

Appendix: Synthetic Division

Example. Addition, subtraction, and multiplication in Z are binary operations; division in Z is not ( Z).

Contest Number Theory

COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635

ORDERS OF UNITS IN MODULAR ARITHMETIC

14:332:231 DIGITAL LOGIC DESIGN. 2 s-complement Representation

Jay Daigle Occidental College Math 401: Cryptology

MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST

EULER S THEOREM KEITH CONRAD

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION

Warm-Up. Simplify the following terms:

THE GAUSSIAN INTEGERS

3.3 Dividing Polynomials. Copyright Cengage Learning. All rights reserved.

Chapter 5 Rational Expressions

NORTHWESTERN UNIVERSITY Thrusday, Oct 6th, 2011 ANSWERS FALL 2011 NU PUTNAM SELECTION TEST

Transcription:

Design Inspirations from Multivariate Polynomials, Part 2 Review In the first of this series of articles [1], we described Ada Dietz s method of weave design using powers of multivariate polynomials with special properties: unit coefficients and all variables to the first power: (a 1 + a 2 + + a n ) k In this article, we ll consider other kinds of polynomials and various operations on polynomials. Other Kinds of Multivariate Polynomials Design sequences produced from Dietz polynomials have a very regular, rigid form. Every variable (representing, say, a block) appears in the sequence in the same way. Other kinds of polynomials give more varied results. For example, Raising a polynomial to a power is what gives the design sequence richness and variety. Raising to a power is, of course, multiplying a polynomial by itself. Another possibility is to multiply different polynomials together, as in (a + 2b 2 + 3c 3 ) (3a 2 + b 3 + 2c) which produces the design sequence aaaaaaaaaaabbaabbaabbaabbaabbaabbaacccaacccaaccc aacccaacccaacccaacccaacccaacccabbbabbbabbbacacaca cacacbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccbbbccc bbbcccbbbcccbbbcccbbbcccbbbcccbbbcccbbbcccbbcbbc bbcbbcbbcbbcbbcbbcbbcbbcbbcbbcccccccccccccccccccc ccccccccccccccccccccccccccccccccccccccccccccccccccc cc and the drawdown pattern shown in Figure 2. (a + 2b 2 + 3c 3 ) 2 produces the design sequence aaabbabbabbabbacccacccacccacccacccacccbbbbbbbbbb bbbbbbbbcccbbcccbbcccbbcccbbcccbbcccbbcccbbcccbb cccbbcccbbcccbbcccccccccccccccccccccccccccccccccccc ccccccccccccccccccccc Assigning a, b, and c to shafts 1, 2, and 3, respectively, and with a direct tie-up, treadled as drawn in, the drawdown pattern shown in Figure 1 results. Figure 2. (a + 2b 2 + 3c 3 ) (3a 2 + b 3 + 2c) in And, of course, polynomials can be added, as (a + 3b 2 + 2c 2 ) 2 + (4a 2 + b 3 + c 3 ) which produces the design sequence aaaaaaaaaaabbabbabbabbabbabbaccaccaccaccbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcc bbccbbccbbccbbccbbccbbccbbccbbccbbccbbccbbcccccc cccccccccccccccccccccccc and the drawdown pattern shown in Figure 3. Figure 1. (a + 2b 2 + 3c 3 ) 2 1 September 30, 2001; last modified December 3, 2002

Figure 3. (a + 3b 2 + 2c 2 ) 2 + (4a 2 + b 3 + c 3 ) We also can subtract polynomials, as well as allow negative coefficients. But this leads us into new territory. The Domain of Coefficients So far, all the coefficients have been positive integers. But negative coefficients, as in (a b + c) 2 (a c + 2d) 3 are natural, as is the subtraction of polynomials, as in (a + 3b 2 + 2c 2 ) 2 (4a 2 + b 3 + c 3 ) If there are negative terms, two new things may happen when the polynomial is multiplied out: (1) terms may be cancelled out by subtraction, and (2) there may be negative coefficients. The cancellation of terms may be used to shorten strings produced by repetition. For example, (a + b) 2 ab = a 2 + ab + b 2 Æ aaabbb If there are negative coefficients, the question is how to interpret them in the concatenation step. There is no inverse to concatenation like subtraction is to addition. One option is to discard terms with negative coefficients. Another is to ignore the signs in the concatenation step, which is equivalent to using the absolute values of coefficients. Neither of these alternatives makes any sense mathematically, but more important, they do not add anything to design possibilities. Instead, there is an opportunity here to add an additional degree of control in the construction of design sequences if a coefficient is negative, reverse the subsequent sequence of variables before repeating it; the sign of a term determines the direction. For example, a 2 3ab + b 2 Æ aababababb Of course, reversal makes no sense mathematically either, since while 3ab 3ab = 0 Æ [nothing] 3ab 3ab Æ abababbababa But we are not doing mathematics. We re using mathematics as a basis for artistic design. Why not have a little nonsense? Why restrict coefficients to integers? Why not fractions? But in producing design sequences, what are we to make of fractional coefficients in the concatenation step? One way would be to take their integer part, so that 2 September 30, 2001; last modified December 3, 2002 and Æ 0 Æ 1 An alternative that enriches design potential is to consider a fractional repetition as producing a corresponding fraction of the string of variables being repeated. Examples are ab Æ a ab Æ b ab Æ aba If a fraction of a string of variables doesn t come out even, we can take just as many as it encompasses, as in and aaabb Æ aa And why not admit all real numbers, so that abcde ª 1.414abcde Æ abcdeab

pabcde ª 3.1416abcdefgh Æ abcdefghabcdefghabcdefgha Operations on Polynomials So far we ve only considered the addition, subtraction, and multiplication of polynomials. There are two other elementary operations on polynomials: Division and modular reduction. Division The division of two multivariate polynomials is carried out with respect to one variable, the other variables being treats as constants. If n(a) and d(a) are two polynomials in a and d(a) π 0, then there is a unique representation Figure 4. (a + b + c ) 3 where q(a) is the quotient polynomial and r(a) is the remainder polynomial, and the degree of r(a) in a is less than the degree of a in n(a). Polynomial division is not difficult and is much like long division. Consider this simple example: Figure 5. Quotient of (a + b + c ) 3 /(a + 2b) Therefore, putting terms in order, q(a) = a 2 ab + 3b 2 and r(a) = 3b 3 + bc 3. To see what may happen in design, consider the Dietz polynomial (a + b + c) 3 divided by a + 2b. In this case the quotient and remainder polynomials are q(a) = a 2 + 2ab + 3ac + b 2 + 3c 2 r(a) = b 3 + 3b 2 c 3bc 2 + c 3 The drawdown patterns for this Dietz polynomial and the quotient and remainder are shown in Figures 4-6. Figure 6. Remainder of (a + b + c ) 3 /(a + 2b) Modular Reduction Modular reduction of a polynomial by a constant is simple: The coefficients of individual terms are take modulo the constant. Consider, for ex- 3 September 30, 2001; last modified December 3, 2002

ample, the example of adding two polynomials given earlier (a + 3b 2 + 2c 2 ) 2 + (4a 2 + b 3 + c 3 ) When multiplied out, the result is 5a 2 + 6ab 2 + 4ac 2 + 4b 3 + 9b 4 + 12b 2 c 2 + 4c 3 + 4c 4 and the design polynomial is made up from the terms as follows 5a 2 6ab 2 4ac 2 4b 3 9b 4 12b 2 c 2 4c 3 4c 4 aaaaaaaaaa abbabbabbabbabbabb accaccaccacc bbbbbbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb bbccbbccbbccbbccbbccbbccbbccbbccbbccbbccbbccbbcc cccccccccccc cccccccccccccccc Concatenation gives aaaaaaaaaaabbabbabbabbabbabbaccaccaccaccbbbbbbb bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbccb bccbbccbbccbbccbbccbbccbbccbbccbbccbbccbbcccccccc cccccccccccccccccccccc Now consider this polynomial modulo 8: 5a 2 + 6ab 2 + 4ac 2 + 4b 3 + b 4 + 4b 2 c 2 + 4c 3 + 4c 4 Only the coefficients 9 and 12 are affected, the other being less than 8. The terms for the design polynomial now are 5a 2 6ab 2 4ac 2 4b 3 b 4 4b 2 c 2 4c 3 4c 4 aaaaaaaaaa abbabbabbabbabbabb accaccaccacc bbbbbbbbbbbb bbbb bbccbbccbbccbbcc cccccccccccc cccccccccccccccc and the design polynomial is: aaaaaaaaaaabbabbabbabbabbabbaccaccaccaccbbbbbbb bbbbbbbbbbbccbbccbbccbbcccccccccccccccccccccccccc cccc The resulting drawdown pattern is shown in Figure 7. Figure 7. ((a + 3b 2 + 2c 2 ) 2 + (4a 2 + b 3 + c 3 )) 8 Modular reduction is a way of shortening otherwise overly long design sequences and thus provides interesting design possibilities. When performing modular reduction on a polynomial, there is no affect unless the modulus is less than one of the coefficients. For example, moduli 12 and greater have no affect on the polynomial in the example above. When the modulus is the same as a coefficient, the term vanishes and makes no contribution to the design sequence. As the modulus decreases, the maximum possible polynomial coefficient value decreases, shortening the design sequence. Little is left for modulus 2. See Appendix A. A variety of other operations can be performed on multivariate polynomials to produce new polynomials. Differentiation and integration derivatives and integrals are the most obvious possibilities. Differentiation Differentiation is performed with respect to a specified variable and reduces the power of the polynomial in that variable. The partial derivative with respect to one variable treats other variables as constants. The partial derivative of a polynomial p with respect to the variable a, which is denoted by (p)/ a, requires application of only a few simple rules: 4 September 30, 2001; last modified December 3, 2002

a n / a = na n 1 (p + q)/ a = p/ a + q/ a k/ a = 0 where k is a constant (indicated by roman type style rather than italic style); that is, a term not containing a. This includes bc, for example. then and For example, if p = a 5 + 5a 4 b + 10a 3 b 2 + 10a 2 b 3 + 5ab 4 p/ a = 5a 4 + 20a 3 b + 30a 2 b 2 + 20ab 3 + 5b 4 p/ b = 5a 4 + 20a 3 b + 30a 2 b 2 + 20ab 3 The derivative of a polynomial can, of course, be differentiated. The second derivative of p with respect to a ( p/ a)/ a is abbreviated as 2 p/ a 2 and so on. For example, and Therefore (a 2 + 5)/ a = 2a (a 2 + 101)/ a = 2a Ú2ada = a 2 + k but k can have any value. This indeterminate k is called the constant of integration. The constant of integration makes a difference in subsequent integrations, as in and then ÚÚ2a(da) 2 = Ú(a 2 + k)da = ÚÚÚ2a(da) 3 = ÚÚ(a 2 + k) (da) 2 = Ú( = a 4 + ka 2 + ja + i a 3 + ka + j a 3 + ka + j)da and so on. In constructing design polynomials using integration, this problem could be handled in several ways. One is to take all constants of integration to be 0, in which case we have Úada= a 2 and p 2 / a 2 = 20a 3 + 60a 2 b + 60ab 2 + 20b 3 3 p/ a 3 = 60a 2 + 120ab + 60b 2 ÚÚa(da) 2 = a 3 ÚÚÚa(da) 3 = a 4 If differentiation continues with the same variable, the powers in the variable decrease, terms without an instance of the variable of differentiation vanish, and the result eventually becomes a constant, which does not yield a design sequence. See Appendix A. Integration Indefinite integration of an expression p with respect to a variable a, denoted by Úpdx, is the (approximate) inverse of differentiation. It is approximate because k/ a = 0 regardless of the value of k. For example, Another way is to take constants of integration to be parameters of the result, producing different polynomials depending on the values assigned to these constants. This opens the door to many possibilities but also increases the complexity of the problem. We ll take the constants of integration to be zero for the examples here. If the constants of integration are taken to be zero and integration is repeatedly applied with the same variable of integration, the powers of the variable increase correspondingly but the coefficients become smaller and smaller until eventually the design sequence becomes empty. This happens very quickly for Dietz polynomials, which have unit coefficients. See Appendix C. 5 September 30, 2001; last modified December 3, 2002

Conclusions We have just touched on the possibilities for design based on multivariate polynomials and operations on them. Any one of the subjects mentioned here could be extended into a substantial studt on its own. One question, of course, is why? The now trite answer is because they are there. A better question, for which there is no present answer, is how polynomial structure is related to the visual interest and attractiveness of weaves based on their design sequences. A bit of mysticism may help here numerology has its uses. Reference 1. Design Inspirations from Multivariate Polynomials, Ralph E. Griswold, 2001: http://www.cs.arizona.edu/patterns/ weaving/webdocs/gre_pol1.pdf. Ralph E. Griswold Department of Computer Science The University of Arizona, Tucson, Arizona 2001, 2002 Ralph E. Griswold 6 September 30, 2001; last modified December 3, 2002

Appendix A Modular Reduction ((a +3b 2 + 2c 2 ) 2 + (4a 2 + b 3 + c 3 )) mod 10 mod 12 mod 9 mod 11 mod 8 7 September 30, 2001; last modified December 3, 2002

mod 7 mod 4 mod 6 mod 3 mod 5 mod 2 8 September 30, 2001; last modified December 3, 2002

Appendix B Differentiation (a + b + c) 4 = a 4 + 4a 3 b + 4ac 3 + 6a 2 b 2 + 12a 2 bc + 6a 2 c 2 + 4ab 3 + 12ab 2 c + 12abc 2 + 4bc 3 + b 4 + 4b 3 c + 6b 2 c 2 + c 4 aaaaaaabaaabaaabaaabaaacaaacaaacaaacaabbaabbaabbaabbaabbaabbaabcaabcaabcaabcaabcaabcaabcaabcaabcaabcaabcaabcaa ccaaccaaccaaccaaccaaccabbbabbbabbbabbbabbcabbcabbcabbcabbcabbcabbcabbcabbcabbcabbcabbcabccabccabccabccabccabcca bccabccabccabccabccabccacccacccacccacccbbbbbbbcbbbcbbbcbbbcbbccbbccbbccbbccbbccbbccbcccbcccbcccbccccccc ((a + b + c) 4 )/ a = 4a 3 + 12a 2 b + 12a 2 c + 12ab 2 + 24abc + 12ac 2 + 4b 3 + 12b 2 c + 12bc 2 +4c 3 aaaaaaaaaaaaaabaabaabaabaabaabaabaabaabaabaabaabaacaacaacaacaacaacaacaacaacaacaacaacabbabbabbabbabbabbabbabbab babbabbabbabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcaccaccaccaccaccaccaccaccaccacc accaccbbbbbbbbbbbbbbcbbcbbcbbcbbcbbcbbcbbcbbcbbcbbcbbcbccbccbccbccbccbccbccbccbccbccbccbcccccccccccccc 2 ((a + b + c) 4 )/( a) 2 = 12a 2 + 24ab + 24ac + 12b 2 + 24bc + 12c 2 aaaaaaaaaaaaaaaaaaaaaaaaababababababababababababababababababababababababacacacacacacacacacacacacacacacacacacac acacacacacbbbbbbbbbbbbbbbbbbbbbbbbbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbcbccccccccccccccccccccccccc 3 ((a + b + c) 4 )/( a) 3 = 24a + 24b + 24c aaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbcccccccccccccccccccccccc 4 ((a + b + c) 4 )/( a) 4 = 24 (a + b + c) 4 ((a + b + c) 4 )/ a 2 ((a + b + c) 4 )/ a 2 3 ((a + b + c) 4 )/ a 3 9 September 30, 2001; last modified December 3, 2002

Appendix C Integration (a + b + c) 4 = a 4 + 4a 3 b + 4ac 3 + 6a 2 b 2 + 12a 2 bc + 6a 2 c 2 + 4ab 3 + 12ab 2 c + 12abc 2 + 4bc 3 + b 4 + 4b 3 c + 6b 2 c 2 + c 4 aaaaaaabaaabaaabaaabaaacaaacaaacaaacaabbaabbaabbaabbaabbaabbaabcaabcaabcaabcaabcaabcaabcaabcaabcaabcaabcaabcaa ccaaccaaccaaccaaccaaccabbbabbbabbbabbbabbcabbcabbcabbcabbcabbcabbcabbcabbcabbcabbcabbcabccabccabccabccabccabcca bccabccabccabccabccabccacccacccacccacccbbbbbbbcbbbcbbbcbbbcbbccbbccbbccbbccbbccbbccbcccbcccbcccbccccccc Ú(a + b + c) 4 da = 0.2a 5 + a 4 b + a 4 c + 2a 3 b2 + 4a 3 bc + 2a 3 c 2 + 2a 2 b 3 + 6a 2 b 2 c + 6a 2 bc 2 + 2a 2 c 3 aaaaabaaaacaaabbaaabbaaabcaaabcaaabcaaabcaaaccaaaccaabbbaabbbaabbcaabbcaabbcaabbcaabbcaabbcaabccaabccaabccaabc caabccaabccaacccaaccc ÚÚ(a + b + c) 4 da 2 ª 0.033a 6 + 0.2a 5 b + 0.2a 5 c + 0.5a 4 b 2 + a 4 bc + 0.5a 4 c 2 + 0.667a 3 b 3 + 2a 3 b 2 c + 2a 3 bc 2 + 0.667a 3 c 3 aaaaaaaaabcaaaaaabaaabbcaaabbcaaabccaaabccaaac ÚÚÚ(a + b + c) 4 da 3 ª 0.005a 7 + 0.033a 6 b + 0.033a 6 c + 0.1a 5 b 2 + 0.2a 5 bc + 0.1a 5 c 2 + 0.167a 4 b 3 + 0.5a 4 b 2 c + 0.5a 4 bc 2 + 0.167a 4 c 3 aaaaaaaaa ÚÚÚÚ(a + b + c) 4 da 4 ª 0.001a 8 + 0.005a 7 b + 0.005a 7 c + 0.017a 6 b 2 + 0.033a 6 bc + 0.017a 6 c 2 + 0.033a 5 b 4 + 0.1a 5 b 2 c + 0.1a 5 bc 2 + 0.033a 5 c 3 (a + b + c) 4 Ú(a + b + c) 4 da ÚÚ(a + b + c) 4 da 2 ÚÚÚ(a + b + c) 4 da 3 10 September 30, 2001; last modified December 3, 2002