EXPONENTIATION (Second Edition)
|
|
- Ειρηναίος Ανδρεάδης
- 5 χρόνια πριν
- Προβολές:
Transcript
1 Mathematics Office: Ground Floor 163 Ditchling Rise Brighton BN1 4QR UK Saturday 25 th December 2010 by: Jim Adams Version M 4.5A EXPONENTIATION (Second Edition) 2008, 2009 Jim Adams
2 Exponentiation JIM ADAMS Original Version M th February Version M th February (Section 7). Version M th April (Sections 8 & 9). Version M th May Version M th July (Extended Sections 5 & 8). Version M th August (First Edition complete). Version M st December (Extended Section 8). Version M th January (Extended Section 12). Version M th June (Extended Sections 1 & 5, reorganisation incorporating Section 6 a reinsert of part of Section 11). Version M 4.2A. 5 th October (Section 1 reduced, Sections 9 14 removed, Section reorganisations) Version M 4.4A. 21 st December Introduction. In this outline of our conceptual work, a review largely based on elementary methods, which have been common mathematical currency for over two centuries, we describe explorations of the mathematical lscape concerning global field theorems for exponential powers. In Section 1.2, we introduce an exponential notation. Section 2.1 restates foundational rules for real exponentiation, providing proofs for the basic binomial exponent geometric exponent theorems. Section 2.2 continues with new cyclotomic variants of the Fermat subtraction, Fermat addition linear combination factorisation theorems, the latter being a formula that is a linear combination of the previous two. Section 2.3 develops in many variables the linear combination factorisation theorem. Prime number, factorisation divisibility theorems are discussed in Section 3. In particular, we obtain primality conditions not dealt with in most textbooks, e.g. for generalised Fermat numbers, for positive natural numbers γ or δ > 1 p, we prove that no number of the form γ p + δ p is prime, except for the possibilities p = 1 or p a power of 2. For generalised Mersenne numbers, no representations of primes are of the form γ p δ p, except for the possibilities p = 1, or δ = (γ 1) p prime. We 2
3 also discuss a linear combination of powers prime number theorem continue with a discussion on factorisation of pth powers γ p ± δ p. This Section also discusses extensions of Fermat s little theorem, including theorems connected with reciprocity. We make some remarks on Fermat s last theorem. Section 4 analyses using elliptic curves the number of solutions mod 4 of differences sums of pth different powers. Section 5 discusses generalised Quadronacci numbers each number is the sum of the previous four, generalised other such sequences Fibonacci, Lucas Tribonacci numbers. I would like to thank especially Doly García for discussions Roger Goodwin for his advice, to thank the mathematics department of the University of Sussex in providing facilities for checking some long computations on Quadronacci numbers. 1.2 The a b = a b Ackermann-Knuth notation for exponentiation. [4] We use sparingly a special symbolism to obtain our results think a supplementary notation for a b = a b is suggestive appropriate. a b must coexist with the current convention, so we would still use e.g. sin 2 θ. This has the advantages of being more compact than exp{b}, complicated expressions become more visible simpler to notate, long sequences of exponents of exponents become easy to write friendly on line spacing, the choice between (a b) c a (bc) allows flexibility nuance, because usually a (b c) (a b) c, the non-associative nature of exponentiation becomes easy to specify. 2.1 Fundamental exponential theorems for real numbers. Let a, b, to h, α, β, γ, δ R + be non-negative real numbers j, k, to z N be natural numbers. N starts from 1, unless 0 is otherwise indicated. Multiplication will take precedence over exponentiation in implicit bracketing. We admit ±[(-a) (±p)] ±[a (±b)] as terms, but not otherwise ±[(-a) (±b)]. Factorisation of real numbers, or of complex numbers a + ib, is not unique. Natural numbers factorise uniquely, there is a type of unique factorisation for Heegner numbers, given by p + q -1, p + q -2 or ½(p + q -r), where -r is one of -3, -7, -11, -19, -43, -67 or Since exponentiation is in general not associative, we need to underst both sides of (a b) c a (b c), which is one of the principal objectives of our paper. Now (a b) c = a (b x c), (a x b) c = (a c) x (b c), a (b + c) = (a b) x (a c) the binomial theorem is (a + b) q = Σ(r = 0, q)[q!/r!(q r)!]a r b q r. We adopt the convention that 0! = 1 writing linearly put a x q = Σ(r = 0, q 1) a, where the sum is 0 if q = 0, a q = Π(r = 0, q 1) a, where the product is 1 if q = 0. 3
4 Of course, a (b c) may be resolved immediately using the formula a (b (c + d)) = a [(b c)(b d)], or equivalently a (b c) = a {d[b (c log b d)]} = {a [b (c log b d)]} d. In comparison with the rule for a q in terms of products above, the binomial theorem for (1 + m) q gives an inductive formula for p q, p > 2, in terms of sums. p q = q!{ Σ(t = 0, p 3)[ Σ(r p 2 t = 0, q Σ(u = 0, t 1)r p 2 u )(1/r p 2 t!) [ Σ(r 0 = 0, q Σ(v = 0, t)r p 2 v )(1/r 0![q Σ(w = 0, t + 1)r p 2 w ]!)]]}. Proof. We employ a proof by induction. Using a new variable s, which starts from the first term s = 0, the (s + 1)th term in a binomial expansion of (1 + p) q is [q!/s!(q s)!][p (q s)]. Hence, putting s = r p 1, the sum of all these terms is A 1+p, q = q!{ Σ(r p 1 = 0, q)(1/r p 1!) [1/(q r p 1 )!] [p (q r p 1 )]}, so since the binomial theorem gives 2 (q r 1 ) = (1 + 1) (q r 1 ) = Σ(r 0 = 0, q r 1 ){(q r 1 )!/[r 0!(q r 1 r 0 )!]}, the binomial expansion, A 1+p, q, for (1 + p) q, p = 2, is equal to our postulated formula 3 q = q![ Σ(r 1 = 0, q)(1/r 1!){ Σ(r 0 = 0, q r 1 )[1/r 0!(q r 1 r 0 )!]}]. Now, assuming the formula for p r, with r = q r p 1 < q, above A 1+p, q = q!{ Σ(r p 1 = 0, q)(1/r p 1!) [1/(q r p 1 )!] {(q r p 1 )! Σ(t = 0, p 3) [ Σ(r p 2 t = 0, q Σ(u = 0, t )r p 1 u )(1/r p 2 t!) [ Σ(r 0 = 0, q Σ(v = 0, t + 1)r p 1 v )(1/r 0!(q Σ(w = 0, t + 2)r p 1 w )!)]]}}. Rearranging where t varies from 0 to p 3, cancelling terms A 1+p, q = q!{ Σ(t = 0, p 3)[ Σ(r p 1 = 0, q)(1/r p 1!) [ Σ(r p 2 t = 0, q Σ(u = 0, t )r p 1 u )(1/r p 2 t!) [ Σ(r 0 = 0, q Σ(v = 0, t + 1)r p 1 v )(1/r 0!(q Σ(w = 0, t + 2)r p 1 w )!)]]}}, so the second line summation starts from r p 2. This implies A 1+p, q = q!{ Σ(t = 0, p 2)[ Σ(r p 1 t = 0, q Σ(u = 0, t 1)r p 1 u )(1/r p 1 t!) [ Σ(r 0 = 0, q Σ(v = 0, t)r p 1 v )(1/r 0!(q Σ(w = 0, t + 1)r p 1 w )!)]]}, where t varies from 0, then 1 (e.g. r p 2 sum) to p 2, that is, A 1+p, q = (1 + p) q. Using a ( Σ(j = 0, k) z j ) = Π(j = 0, k)(a z j ), a (p q) can be exped out using the above formula to give the binomial exponent factorisation theorem (BEFT), or exped out fully as n (p q). The geometric exponent factorisation theorem (GEFT) for a (b cq ) is a (b cq ) = a{ Π(r = 0, q 1) a [(b c 1)b cr ]}. Proof. Consider the geometric series S n = α + αb c + αb 2c + + αb nc. The sum is S n = α[1 b c(n + 1) ]/[1 b c ]. Insert α = [b c 1] n = q 1. Then the sum becomes [b cq 1] = [b c 1]{(b c ) 0 + (b c ) (b c ) (q 1))}, yielding a [b cq 1] = Π(r = 0, q 1) a {[b c 1][b c r]}. 4
5 The geometric series is related to cyclotomic equations, studied in the generalised Fermat factorisation theorems of section 2.2. Incidentally, when the arithmetic (a special case of Bernoulli) series formula a q(q + 1) = [ Π(r = 0, q) a 2r ] is combined with the GEFT above, it gives the result a q = (a 1/2 ){ Π(r = 0, q) a [(4r 3/2(q + 1))/(2q + 3)]}, which reduces to q = ½ + Σ(r = 0, q)[(4r 3/2(q + 1))/(2q + 3)], as can be reconfirmed by routine calculation. A permutation of the argument gives q = -3/2 + Σ(r = 0, q)[(4r 3/2(q + 1))/(2q 1)]. Proof. We give a proof motivated by exponentiation. The arithmetic series sum is Σ(r = 0, q) r = q(q + 1)/2, thus a q(q + 1) = [ Π(r = 0, q) a r ] 2. Now q(q + 1) = (q + ½) 2 ¼. It follows that a (q + ½) 2 = a 1/4 [ Π(r = 0, q) a 2r ]. Applying the geometric formula gives a (q + ½) 2 = a{ Π(r = 0, 1) a [(q ½)((q + ½) r)]} = a[a (q ½)][a [(q ½)(q + ½)]] = a[a (q ½)] (q + 3/2). We deduce [a (q ½)] (q + 3/2) = a -3/4 [ Π(r = 0, q)a 2r ], the last product having q + 1 factors, from r = 0 to r = q. This right h side is [a -3(q + 1)/4(q + 1) ][ Π(r = 0, q) a 2r ] = Π(r = 0, q)a (2r 3/4(q + 1)). Thus exponentiating by 1/(q + 3/2) [a (q ½) ] = Π(r = 0, q) [a (2r 3/4(q + 1))] 2/(2q + 3), giving a q = a 1/2 Π(r = 0, q)[a (4r 3/2(q + 1))] 1/(2q + 3). If instead we interchange (q ½) (q + 3/2) exponentiate by 1/(q ½) a q = a -3/2 Π(r = 0, q)[a (4r 3/2(q + 1))] 1/(2q 1). 2.2 Generalised cyclotomic Fermat factorisation theorems. The qth Fermat number is F q = 2 (2 q) + 1. So F 0 = 3, F 1 = 5, F 2 = 17, F 3 = 257, F 4 = F 5 = Our theorems relate to generalised such F q. As Fermat knew, the extended Mersenne number F q 2 = Π(r = 0, q 1)F r. The second Fermat subtraction factorisation theorem example contains this result for a, p = 2 f = 1. An example of the first Fermat subtraction factorisation theorem (first FSFT) is a (p c ) = {[a (p c 1 ) 1][ Σ(s = 0, p 1)[(a (p c 1 )) s]]} + 1. The first FSFT is a [(bp) c ] f [(gp) h ] = {[a ((bp) c 1 )] b [f ((gp) h 1 )] g }{ Σ(s = 0, p 1) [(a [(bp) c 1 ]) bs][(f [(gp) h 1 ]) g(p 1 s)]}. 5
6 Proof. Introducing α = γ p β = δ p, we explore the cyclotomic formula γ p δ p = (γ δ)(γ p 1 + γ p 2 δ + γ p 3 δ δ p 1 ), which can be written in the form α β = [α 1/p β 1/p ]{ Σ(s = 0, p 1)[α s/p ][β 1 1/p s/p ]}. We obtain our result using α = a [(bp) c ] = a [(bp) 1 (bp) c 1 ] = (a [(bp) c 1 ]) bp similarly β = f [(gp) h ] = (f [(gp) h 1 ]) gp. An example of the second FSFT is a (p q ) f (p q ) = [a f] Π(r = 0, q 1) { Σ(s = 0, p 1)[a (s(p q 1 r ))][f ((p 1 s)(p q 1 r ))]}. The second FSFT for free parameter m is a ((bp) c ) f ((gp) h ) = {a [(b m )((bp) c m )] f [(g m )((gp) h m )]} Π(r = 0, m 1){ Σ(s = 0, p 1)[a (bs((bp) c 1 r ))(b r))] [f (g(p 1 s)((gp) h 1 r )(g r))]}. Proof. Consider the identity γ (p m ) δ (p m ) = (γ (p m 1 ) δ (p m 1 )) { Σ(s = 0, p 1)[(γ (p m 1 )) s][(δ (p m 1 )) (p 1 s)]}. The term (γ (p m 1 ) δ (p m 1 )) can be replaced for an nth general recursion to give γ (p m ) δ (p m ) = (γ (p m 1 n ) δ (p m 1 n )) Π(r = 0, n){ Σ(s = 0, p 1) [(γ (p m 1 r )) s][(δ (p m 1 r )) (p 1 s)]}. Hence allocating the maximum nth replacement to m 1, our star equation is (*) γ (p m ) δ (p m ) = [γ δ] Π(r = 0, m 1){ Σ(s = 0, p 1) [(γ (p m 1 r )) s][(δ (p m 1 r )) (p 1 s)]}. Put α = a ((bp) c ) = γ (p m ), leading to γ = γ (p 0) = γ [(p m )(p -m )] = [γ p m ] (p -m ) = α (p -m ). Now, as can be confirmed by multiplying both sides by (b -m), p -m = (bp) -m b m, so γ = a [b m ((bp) c m )]. If we likewise allocate β = f (gp) h = δ (p m ), reducing to δ = β (p -m ) then we obtain similarly 6
7 δ = f [g m ((gp) h m )]. In consequence a ((bp) c ) f ((gp) h ) = {a [b m (bp) c m )] f [g m (gp) h m ]} Π(r = 0, m 1){ Σ(s = 0, p 1) [(α (p -1 r )) s][(β (p -1 r )) (p 1 s)]}. For the first of the last two terms in [ ], assign α = a ((bp) c ) p -1 r = [(bp) -1 r ][b 1 + r ]. Then this term is {a [bs[(bp) c 1 r ]b r ]} the second term is by similar process {f [g(p 1 s)[(gp) h 1 r ]g r ]}. The first Fermat addition factorisation theorem (first FAFT) states: Let g, p N be odd numbers h N. Then a ((bp) c ) + f ((gp) h ) = {(a [(bp) c 1 ]) b + (f [(gp) h 1 ]) g }{ Σ(s = 0, p 1) [(a [(bp) c 1 ]) bs][((-f) [(gp) h 1 ]) g(p 1 s)]}. Proof. Introducing α = γ p, β = δ p, we revisit the first FSFT equation α β = [α 1/p β 1/p ]{ Σ(s = 0, p 1)[(α s/p )[β 1 1/p s/p ]}. Using α = a (bp) c = a [(bp) 1 (bp) c 1 ] = (a [(bp) c 1 ]) bp similarly β = f (gp) h = (f [(gp) h 1 ]) gp gives, under the transformation β -β, that β 1/p changes sign as δ -δ, since p is odd, which transforms f -f, since gp is odd in β = f (gp) h. Hence the result. The second Fermat addition factorisation theorem (second FAFT) for free parameter m states: Let g p N be odd numbers h N. Then a ((bp) c ) + f ((gp) h ) = {a [(b m )(bp) c m ] + f [(g m )(gp) h m ]} Π(r = 0, m 1){ Σ(s = 0, p 1)[a (bs[(bp) c 1 r ]b r )] [(-f) (g(p 1 s)[(gp) h 1 r ]g r )]}. Proof. The conditions are identical to the first FAFT, the proof follows by close analogy with the second FSFT proof. In particular, we note the following result, suitably amended, i.e. we have performed the transformation δ -δ. (**) γ (p m) + δ (p m) = [γ + δ] Π(r = 0, m 1){ Σ(s = 0, p 1) [(γ [p (m 1 r)]) s][((-δ) [p (m 1 r)]) (p 1 s)]}. We subsequently identify ε, η, θ C as complex numbers, e = i = -1. We now relax our conditions, to allow complex arithmetic on, but not further non- 7
8 real operations within, for example, a b = e (iπq/p) terms. A way of doing this is to consider a b expressions as scalars complex numbers as vectors. This is an idea found in K theory. We have stated that our factorisation theorems give unique factorisation when applied to natural numbers up to order of factors. For complex cyclotomics as used in the next lemma, uniqueness of factorisation depends on the class number [30]. That is why, in section 3 on prime number factorisation theorems, we prefer to use formulae developed for the real case. The next FAFT theorems have FSFT analogues. Here is Lemma 1. γ p + δ p = Π(s = 0, p 1)[γ δ(e iπ(2s + 1)/p)]. Proof. We first note that the leading term in the expansion is γ p. The trailing term is (-δ) p (e iπ[ Σ(s = 0, p 1)(2s + 1)/p]). Now the following arithmetic series sum has the value Σ(s = 0, p 1)s = p(p 1)/2, so the Σ summation in [ ] above is [2(p(p 1)/2) + p]/p = p. Hence, irrespective of whether p is even or odd, since e iπ(2s + 1) = -1, the trailing term is δ p. Now consider the nth term in the expansion. If n 0 or p 1, it consists of a summation Σ(r = 0, m)ε r γ p - n δ n each ε r is the product of n factors (e iπ(2t + 1)/p), where the product terms range over all combinations of t from 0 to p 1. If Σ r ε r 0, it consists of a non-zero vector in the complex plane. Permute the roots under the cyclic transformation s s + 1. Then ε r (e 2πin/p)ε r ε r, Σ r ε r remains the same, since it consists of the sum of all combinations. The rotation of roots implies the complex sum vector must also be rotated by an ε r multiplication 1, a contradiction unless the sum is zero. The third Fermat addition factorisation theorem (third FAFT) is a ((bp) c ) + f ((gp) h ) = Π(s = 0, p 1) {(a [(bp) c 1 ]) b (f [(gp) h 1 ]) g (e iπ(2s + 1)/p)}. Proof. Put α = γ p, β = δ p. Then using lemma 1, we obtain α + β = Π(s = 0, p 1)[α 1/p β 1/p (e iπ(2s + 1)/p)] with the substitutions α = a (bp c) = a [(bp 1)(bp (c 1)] = (a [bp (c 1)]) bp β = f (gp h) = (f [gp (h 1)]) gp, this results in the theorem. Lemma 2. Let p = j(2 k) with j odd k non-negative. Then e (iπ(2s + 1)/p) = (-1) (1/p) = p -1 has a real root (which is -1) only for k = 0. 8
9 Proof. Let k = 0, so p is an odd number. By applying (1/p) to the equations below -1 = (-1) p is a solution, for p odd, so p -1 has a real root, -1. If k 0, then p is even, implying -1 (-1) p -1 1 p. The norm of the root is 1, so there are no real root of -1 possibilities for p even. The fourth Fermat addition factorisation theorem (fourth FAFT) states: Let p N be an odd number. Then for free parameter m a ((bp) c ) + f ((gp) h ) = {a [(b m )(bp) c m ] + f [(g m )(gp) h m ]} Π(r = 0, m 1){ Π(s = 0, p 1, omit (p 1)/2) [(a (b[(bp) c 1 r ]b r )) (f (g[(gp) h 1 r ]g r ))(e iπ(2s + 1)/p)]}. Proof. Consider the following factorisation identity, beginning with the real root case, which corresponds to s = (p 1)/2, so by lemma 2, p is odd: γ (p m) + δ (p m) = {γ (p (m 1)) + δ (p (m 1))]} Π(s = 0, p 1, omit (p 1)/2) [γ (p (m 1)) [δ (p (m 1))](e iπ(2s + 1)/p)]. The term {γ (p (m 1)) + δ (p (m 1))} can be replaced for an nth general recursion to give γ (p m) + δ (p m) = {γ [p (m 1 n)] + δ [p (m 1 n)]} Π(r = 0, n)[ Π(s = 0, p 1, omit (p 1)/2) {γ [p (m 1 r)] (δ [p (m 1 r)])(e iπ(2s + 1)/p)]}. Hence allocating the maximum nth replacement to m 1, our equation is γ (p m) + δ (p m) = [γ + δ] Π(r = 0, m 1){ Π(s = 0, p 1, omit (p 1)/2) {γ [p (m 1 r)] (δ [p (m 1 r)])(e iπ(2s + 1)/p)}}. Our substitutions now follow the steps of the second FSFT. Put α = a (bp c) = γ (p m). We recall this leads to γ = α (p -m) = α [(bp -m)(b m)] = a [(b m)(bp (c m))]. If we likewise allocate β = f (gp h) = δ (p m), then we obtain similarly δ = f [(g m)(gp (h m))]. Consequently a (bp c) + f (gp h) = {a [(b m)(bp (c m))] + f [(g m)(gp (h m))]} Π(r = 0, m 1){ Π(s = 0, p 1, omit (p 1)/2) [(α [p (-1 r)]) (β [p (-1 r)])(e iπ(2s + 1)/p)]}. For the first term of the last expression in [ ], assign α = a (bp c) p (-1 r) = [bp (-1 r)](b (1 + r)). Then this term is {a (b[bp (c 1 r)](b r))} 9
10 in comparable manner the second term is {(f (g[gp (h 1 r)](g r)))(e iπ(2s + 1)/p)}. Under the FAFT constraints, say p odd, each of the FAFT FSFT equations is equivalent by if only if equivalence to the identity (γ, δ) = (γ, δ), so under FAFT constraints their equaliser (intersection) is also equivalent to this identity. Thus we can also form linear combinations of FAFT FSFT equations. These theorems we call linear combination factorisation theorems LCFT. Here is a typical example. Let g p N be odd, h N. Put A = a [(b m )(bp) c m ] B = f [(g m )(gp) h m ] C r = Σ(s = 0, (p 1)/2){a (2bs[(bp) c 1 r ]b r )} {f (g(p 1 2s)[(gp) h 1 r ]g r )} D r = Σ(s = 0, (p 3)/2){a (b(2s + 1)[(bp) c 1 r ]b r )} {f (g(p 2 2s)[(gp) h 1 r ]g r )}. Then η[a ((bp) c )] + θ[f ((gp) h )] = ½[(η + θ)(a + B) Π(r = 0, m 1)(C r D r ) + (η θ)(a B) Π(r = 0, m 1)(C r + D r )]. Our formula for difference of powers may be generalised by putting q = jk γ q δ q = [(γ k) (δ k)]{ Σ(s = 0, j 1)[γ ks][δ k(j 1 s)]}. Accordingly, with j = 2 n, ω 2j a primitive 2jth root of unity k odd γ q + δ q = [(γ k) + (ω 2j δ) k]{σ(s = 0, j 1)[γ ks][(-ω 2j δ) k(j 1 s)]}, or with the same j = 2 n k odd γ q + δ q = [(γ 2 n ) + (δ 2 n )] {Σ(s = 0, k 1)[γ 2 n s][(-(δ 2 n )) (k 1 s)]}. This can be compared with the binomial identity γ q + δ q = [(γ k) + (δ k)] j {Σ(s = 1, j 1)[(j 1)!/s!(j 1 s)!][γ ks][δ k(j 1 s)]}. Thus for q even as above an option is Z = η(γ q ) + θ(δ q ) = ½[(η + θ)(γ [2 n ] + δ [2 n ])U + (η θ)(γ [2 n ] δ [2 n ])V], with U = Σ(s = 0, k 1)[γ (2 n s)]{[-(δ 2 n )] (k 1 s)} V = Σ(s = 0, k 1)[γ (2 n s)]{δ [2 n (k 1 s)]}. The general LCFT formula for any p is then Z = ½[(1 (-1) p )(formula for odd p) + (1 + (-1) p )(formula for even p)]. 2.3 Extension of the LCFT to many variables. We now give a modified example of the LCFT (note that here firstly, p is odd) Z = η(γ p) + θ(δ p) = ½[(η + θ)(γ + δ)x + (η θ)(γ δ)y], 10
11 generated from essentially γ replaced by the sum of variables Σ(i = 0, n 1)γ i, δ replaced by the sum Σ(i = 0, n 1)δ i. This is suitably general, because if, for example, there are less variables δ i than γ i, say j of them, we can set δ i to zero for j < i < n 1. We will first give an example restricted to the case n = 3. The multinomial theorem is (γ 0 + γ γ n 1 ) p = Σp!/(p 0!p 1! p n 1!)[(γ 0 p 0 ) (γ n 1 p n 1 )], where the sum is extended over all non-negative p i with Σp i = p. For example, if n = 3 = p, then (γ 0 + γ 1 + γ 3 ) 3 = (γ γ γ 2 2 )γ 0 + (γ γ γ 0 2 )γ 1 + (γ γ γ 1 2 )γ 2 + 6γ 0 γ 1 γ 2. Let p be odd. Then the expansion of (γ 0 + γ γ n 1 ) p can be written as a sum Σ y,combinations for y J r x (γ r γ x ) where the number of terms in the sequence r, x is y, with y odd < n each coefficient J r x is invariant under any transformation γ s -γ s, r > s > x. Proof. Each term in the expansion is a scalar, α, times a product Π t γ t q, with Σq = p, p odd. This may be represented by απ j γ j u Π k γ k v, with u even v odd. Hence it may be represented by even parity terms invariant under γ s -γ s given by απ j γ j u Π k γ k v 1, each multiplied by odd parity terms (γ r γ x ) = Π k γ k. Collecting together all the even parity terms, we put J r x = Σ i α i Π j γ j u Π k γ k v 1. If there exists any term J r x Π k γ k, where k ranges over an even number of values, then J r x = Σ i α i Π k γ k w, where Σw is even for each i, since J r x is of even parity, which contradicts for each i that p = Σw + the range of k values, is odd. Hence y = the range of k values, is odd. If p > n, with p, n odd, then the number of J r x terms is 2 n 1. If p < n, the number of terms is Σ(k = 0, (p 1)/2)[n!/(2k + 1)!(n 2k 1)!]. Proof. If p > n, then the number of terms is the number of combinations of odd γ r...γ x = n + n(n 1)(n 2)/ n!/(2k + 1)!(n 2k 1)! = ½(1 + 1) n = 2 n 1. If p < n, n odd, it is the same series truncated after the ½(p + 1)th term. Consider for n = 3, p odd, (γ 0 + γ 1 + γ 2 ) p (δ 0 + δ 1 + δ 2 ) p = [γ 0 + γ 1 + γ 2 δ 0 δ 1 δ 2 ] [ Σ(s = 0, p 1)[(γ 0 + γ 1 + γ 2 ) s][(δ 0 + δ 1 + δ 2 ) (p 1 s)]], which by the above theorem can be equated to J 0 γ 0 + J 1 γ 1 + J 2 γ 2 + J 012 γ 0 γ 1 γ 2 + K 0 δ 0 + K 1 δ 1 + K 2 δ 2 + K 012 δ 0 δ 1 δ 2, where if p were = 1 then we would have J 012 = K 012 = 0. We wish to add together the following combination 11
12 a 0 [(γ 0 + γ 1 + γ 2 ) p (δ 0 + δ 1 + δ 2 ) p ] + a 1 [(-γ 0 + γ 1 + γ 2 ) p (δ 0 + δ 1 + δ 2 ) p ] a 2 [(γ 0 γ 1 + γ 2 ) p (δ 0 + δ 1 + δ 2 ) p ] + b 0 [(γ 0 + γ 1 + γ 2 ) p (-δ 0 δ 1 δ 2 ) p ] b 1 [(γ 0 + γ 1 + γ 2 ) p (δ 0 δ 1 δ 2 ) p ] + b 2 [(γ 0 + γ 1 + γ 2 ) p (-δ 0 + δ 1 δ 2 ) p ]. This linear combination may be equated to η 0 J 0 γ 0 + η 1 J 1 γ 1 + η 2 J 2 γ 2 + η 012 J 012 γ 0 γ 1 γ 2 + θ 0 K 0 δ 0 + θ 1 K 1 δ 1 + θ 2 K 2 δ 2 + θ 012 K 012 δ 0 δ 1 δ 2, where, for example, J 0 γ 0 = (-J 0 )(-γ 0 ) J 012 γ 0 γ 1 γ 2 = (-J 012 )(-γ 0 )(-γ 1 )(-γ 2 ), giving η 0 = a 0 a 1 + a 2 + b 0 + b 1 + b 2 η 1 = a 0 + a 1 a 2 + b 0 + b 1 + b 2 η 2 = a 0 + a 1 + a 2 + b 0 + b 1 + b 2 -θ 0 = a 0 + a 1 + a 2 b 0 + b 1 b 2 -θ 1 = a 0 + a 1 + a 2 b 0 b 1 + b 2 -θ 2 = a 0 + a 1 + a 2 b 0 b 1 b 2. We also have the supplementary equations η 012 = a 0 a 1 a 2 + b 0 + b 1 + b 2 -θ 012 = a 0 + a 1 + a 2 b 0 + b 1 + b 2. A little linear algebra then gives a 1 = (η 2 η 0 )/2, a 2 = (η 2 η 1 )/2 a 0 = (η 0 + η 1 η 2 θ 2 )/2. Likewise b 1 = (θ 2 θ 0 )/2, b 2 = (θ 2 θ 1 )/2 b 0 = (θ 0 + θ 1 θ 2 + η 2 )/2. These results, easily extended to many variables, imply η 012 = η 0 + η 1 η 2 θ 012 = θ 0 + θ 1 θ 2. We can express J 0 γ 0, J 1 γ 1, J 2 γ 2 J 012 γ 0 γ 1 γ 2 in terms of (γ 0 + γ 1 + γ 2 ) p. J 0 γ 0 = ¼[(γ 0 + γ 1 + γ 2 ) p (-γ 0 + γ 1 + γ 2 ) p + (γ 0 γ 1 + γ 2 ) p + (γ 0 + γ 1 γ 2 ) p ]. J 1 γ 1 = ¼[(γ 0 + γ 1 + γ 2 ) p + (-γ 0 + γ 1 + γ 2 ) p (γ 0 γ 1 + γ 2 ) p + (γ 0 + γ 1 γ 2 ) p ]. J 2 γ 2 = ¼[(γ 0 + γ 1 + γ 2 ) p + (-γ 0 + γ 1 + γ 2 ) p + (γ 0 γ 1 + γ 2 ) p (γ 0 + γ 1 γ 2 ) p ]. J 012 γ 0 γ 1 γ 2 = ¼[(γ 0 + γ 1 + γ 2 ) p (-γ 0 + γ 1 + γ 2 ) p (γ 0 γ 1 + γ 2 ) p (γ 0 + γ 1 γ 2 ) p ]. We now introduce the symbol X uvw,xyz, in which u is 0 if γ 0 is positive, u is 1 if γ 0 is negative, similarly with v for γ 1 w for γ 2. We adopt a similar type of 12
13 convention for x, y, z with respect to δ 0, δ 1 δ 2. Thus we have the expression for p odd (γ 0 + γ 1 + γ 2 ) p (δ 0 + δ 1 + δ 2 ) p = [γ 0 + γ 1 + γ 2 δ 0 δ 1 δ 2 ]X 000,000, with X 000,000 = [ Σ(s = 0, p 1)[(γ 0 + γ 1 + γ 2 ) s][(δ 0 + δ 1 + δ 2 ) (p 1 s)]]. Hence we have the following theorem. η 0 J 0 γ 0 + η 1 J 1 γ 1 + η 2 J 2 γ 2 + (η 0 + η 1 η 2 )J 012 γ 0 γ 1 γ 2 + θ 0 K 0 δ 0 + θ 1 K 1 δ 1 + θ 2 K 2 δ 2 + (θ 0 + θ 1 θ 2 )K 012 δ 0 δ 1 δ 2 = ½ [(η 0 + η 1 η 2 θ 2 )(γ 0 + γ 1 + γ 2 δ 0 δ 1 δ 2 )X 000,000 + (η 2 η 0 )(-γ 0 + γ 1 + γ 2 δ 0 δ 1 δ 2 )X 100,000 + (η 2 η 1 )(γ 0 γ 1 + γ 2 δ 0 δ 1 δ 2 )X 010,000 + (θ 0 + θ 1 θ 2 + η 2 )(γ 0 + γ 1 + γ 2 + δ 0 + δ 1 + δ 2 )X 000,111 + (θ 2 θ 0 )(γ 0 + γ 1 + γ 2 δ 0 + δ 1 + δ 2 )X 000,011 + (θ 2 θ 1 )(γ 0 + γ 1 + γ 2 + δ 0 δ 1 + δ 2 )X 000,101 ]. Consider the general case for p odd (Σ(i = 0, n 1)γ i ) p (Σ(i = 0, n 1)δ i ) p = [Σ(i = 0, n 1)(γ i δ i )] [ Σ(s = 0, p 1)[(Σ(i = 0, n 1)γ i ) s][(σ(i = 0, n 1)δ i ) (p 1 s)]], which by the above theorem can be equated to Σ y,combinations for y J r x (γ r γ x ) Σ y,combinations for y K r x (δ r δ x ), where we have introduced K r x for the coefficient of (δ r δ x ) similar to J r x for (γ r γ x ). If p < n, then for y > p, J r x = K r x = 0. We wish now to add together linear combinations of 2n independent equations, each of a type similar to the above, expressed in the n variables γ i the n variables δ i. Define the symbol ξ(i,j) by ξ(i,j) = 1 for i = j = 0 for i j. Then our general linear combination is Σ(s = 0, n 1)[a s (Σ(r = 0, n 1)(γ r 2ξ(s,r 1)γ r 1 )) p (Σ(r = 0, n 1)δ r ) p ] + Σ(s = 0, n 1)[b s (Σ(r = 0, n 1)γ r ) p (Σ(r = 0, n 1)(-δ r + 2ξ(s,r 1)δ r )) p ]. With y odd, our linear combination equals Σ y,combinations for y η r x J r x (γ r γ x ) + Σ y,combinations for y θ r x K r x (δ r δ x ), where J r x (γ r γ x ) = -J r x [(-γ r ) (-γ x )], K r x (δ r δ x ) = -K r x [(-δ r ) (-δ x )]. This gives η r = Σ(s = 0, n 1)[a s 2ξ(r + 1,s)a r b s ] -θ r = Σ(s = 0, n 1)[a s b s + 2ξ(r + 1,s)b r + 1 ]. 13
14 Introducing, say, η(012) for η 012, we also have the supplementary equations η(r 0 r y 1 ) = Σ(s = 0, n 1)[a s 2Σ(t = 0, y 1)ξ(r t + 1,s)a t b s ] -θ(r 0 r y 1 ) = Σ(s = 0, n 1)[a s b s + 2Σ(t = 0, y 1)ξ(r t + 1,s)b t + 1 ], where we consider the set of variables (r 0 r y 1 ) to be any suitable combination for y. Applying linear algebra, where s goes from 0 to n 2, we obtain a s + 1 = (η n 1 η s )/2, a 0 = ((-n + 2)η n 1 + Σ(s = 0, n 2)η s θ n 1 )/2. Likewise b s + 1 = (θ n 1 θ s )/2, b 0 = ((-n + 2)θ n 1 + Σ(s = 0, n 2)θ s + η n 1 )/2. These results imply η(r 0 r y 1 ) = ½[(-n + 4)η n 1 + (-n + 2)θ n 1 ] Σ(s = 0, n 1)[Σ(t = 0, y 1)ξ(r t + 1,s)(η n 1 η t )]. -θ(r 0 r y 1 ) = ½[(n 4)θ n 1 + (-n + 2)η n 1 ] + Σ(s = 0, n 1)[Σ(t = 0, y 1)ξ(r t + 1,s)(θ n 1 θ t )]. J r x (γ r γ x ) can then be computed explicitly. We now introduce the symbol X(v 0 v 1 v n 1, x 0 x 1 x n 1 ), in which v i is 0 if γ i is positive, v i is 1 if γ i is negative, likewise for x i with respect to δ i. Thus we have the expression (Σ(s = 0, n 1)γ s ) p (Σ(s = 0, n 1)δ s ) p = [Σ(s = 0, n 1)γ s Σ(s = 0, n 1)δ s ]X(0 0,0 0) with X(0 0,0 0) = [Σ(r = 0, p 1)[(Σ(s = 0, n 1)γ s ) r][(σ(s = 0, n 1)δ s ) (p 1 r)]]. Writing, say, J(012) for J 012 γ(0) for γ 0, we have the following theorem. Σ y,combinations for y η(r 0 r y 1 )J(r 0 r y 1 )(γ(r 0 ) γ(r y 1 )) + Σ y,combinations for y θ(r 0 r y 1 )K(r 0 r y 1 )(δ(r 0 ) δ(r y 1 )) = Σ y,combinations for y ½[(-n + 4)η n 1 + (-n + 2)θ n 1 2Σ(s = 0, n 1) [Σ(t = 0, y 1)ξ(r t + 1,s)(η n 1 η t )]] [Σ(s = 0, n 1)[(1 2v s )γ s δ s ]X(v 0 v 1 v n 1, 0 0)] Σ y,combinations for y ½[(n 4)θ n 1 + (-n + 2)η n 1 + 2Σ(s = 0, n 1) [Σ(t = 0, y 1)ξ(r t + 1,s)(θ n 1 θ t )]] [Σ(s = 0, n 1)[γ s + (1 2x s )δ s ]X(0 0, x 0 x 1 x n 1 )]. If q is even = (2 n )k, with k odd, then a formula for even q is obtained from the above formula under the transformation p k, γ s γ s 2 n, δ s δ s 2 n. Alternatively, for q even, a complex cyclotomic formula can be utilised, where we set q = jk = (2 n )k, with k odd ω 2j a primitive 2jth root of unity, obtainable from the above under the transformation p j, γ s γ s k, δ s (-ω 2j δ s ) k. We recall, given u = p or q, the general LCFT formula for Z is then Z = ½{[1 (-1) u ](formula for u odd) + [1 + (-1) u ](formula for u even)}. 14
15 3. Prime number, factorisation divisibility theorems. For γ or δ > 1 N, no representations of primes are of the form γ p + δ p, except for the possibilities p = 1 or p a power of 2, the latter subsumed under p = 2. Proof. Let p be odd. Then by (**), supposing the above expression is prime γ (p m ) + δ (p m ) = [γ + δ] Π(r = 0, m 1) { Σ(s = 0, p 1)[(γ [p m 1 r ]) s][((-δ) [p m 1 r ]) (p 1 s)]}. Since the prime number γ + δ are positive, so is the subsequent expression in [ ] which is a summation of integers, m = 1, otherwise the expression factorises. Since γ + δ > 1, the summation of integers is 1. This implies γ p + δ p = γ + δ, which is clearly only the case for γ = δ = 1 or p = 1. Hence if p 1, it is not odd. Now if p 1 is not a power of 2, there exists an odd factor q 1 so that p = kq (γ k) q + (δ k) q is prime, which we have proved is not the case. Hence p = 1, or p = 2z is a power of 2, so all the latter such primes can be written as (γ z) 2 + (δ z) 2. We note the following stard results, given e.g. in [3]. No prime of the form 4k + 3 is a sum of two squares. Any prime of the form 4k + 1 can be represented uniquely (aside from the order of summs) as a sum of two squares. Let p be odd, η ±θ 0 be integers, γ δ 0 natural numbers, X = Σ(s = 0, p 1)[γ s ][(-δ) p 1 s ], Y = Σ(s = 0, p 1)[γ s ][δ p 1 s ] Z = η(γ p ) + θ(δ p ) > 0. If the product of (η + θ), (γ + δ) X has two prime factors in common with the product (η θ), (γ δ) Y, excluding at most one factor of ±2, then Z is not prime. Proof. By the LCFT η(γ p ) + θ(δ p ) = ½[(η + θ)(γ + δ)x + (η θ)(γ δ)y]. Hence under these conditions, for the expression to be prime, there are two distinct factors on the right h side, one of which must be ±2. We cannot modify these conditions by just reducing two prime factors down to one, because taking p = 1, η = 5, θ = -6, γ = 15 δ = 12, then Z = 3 is prime, but we construct a proof of this modification under the further constraint η θ 0 N. We mention related results. When the expression γ 2 + δ 2 = ½[(γ + δ)(γ + δ) + (γ δ)(γ δ)] is prime, then γ δ does not share any prime factor with γ + δ. Any integer may be represented by ±Z (put, say, δ = 1. We allow here Z = 0). 15
16 Let η θ 0 γ δ 0 be natural numbers p, X, Y Z be as in the previous theorem. If the product of (γ δ), (η θ) Y has a prime factor in common with the product (γ + δ), (η + θ) X, excluding at most one factor of ±2 for the pairings of (γ δ) with (γ + δ) or (η θ) with (η + θ), then Z is not prime. Sketch of proof. If A B have a prime common factor, we write ja = kb, where the common factor is (A/k) = (B/j). We allocate j k as positive where possible. Let p be odd. Define 2W = Y X. We will need the following identities. (γ + δ)x = γ p + δ p γx + (γ δ)w = γ p, δx + (δ γ)w = δ p. We immediately mention that for pairings of (γ δ) with (γ + δ), for p = 3, η = 1, θ = 2, γ = 3 δ = 1, that Z = 29 is prime, so the exclusion of at most one factor of ±2 is necessary. The same goes for the pairing of (η θ) with (η + θ), for p = 1, η = 3, θ = 1, γ = 1 δ = 2, when Z = 5 is prime. But if such pairings occur simultaneously, so both η θ are either odd or even, likewise γ δ, then Z is even 2. Let j(γ δ) = k(γ + δ) choose arbitrarily γ > δ. Then Z = ½((γ δ)/k)[η((j + k)x + 2kW) + θ((j k)x 2kW)]. For Z to factorise in the way specified, we need to ensure the θ term cannot be negative, so that the term in [ ] is not 1 or 2. The θ term is θ((j k)x 2kW) = θ{(j k)[ Σ(s = 0, (p 1)/2)[((j + k)/(j k)) p 1 2s ]] (j + k)[ Σ(s = 0, (p 3)/2)[((j + k)/(j k)) p 2 2s ]]}δ p 1. This equates to θ(j k)(δ p 1 ), so for (γ δ)/k > 2, Z is not prime. If j(γ δ) = k(η + θ), then choosing j k positive, i.e. (γ δ)/k > 1, we have Z = (γ δ)[(j/k)δ p + η(x + 2W)], so Z factorises. With j(γ δ) = kx under scrutiny, we obtain Z = (γ δ)[η((j/k)γ + W) + θ((j/k)δ W)]. Suppose the term in [ ] was 1, then we would have (j/k)δ < W, so we would deduce Xδ < (γ δ)w = Xδ δ p, which is impossible, hence Z is not prime. If j(η θ) = k(γ + δ), then Z = (η θ)[(j/k)θx + γ p ], Z factorises, because (η θ)/k > 1. If j(η θ) = k(η + θ), then choosing arbitrarily η > θ, Z = ½(η θ)[((j/k) + 1)γ p + ((j/k) 1)δ p ] so since j/k > 1 in this instance we specify (η θ)/k > 2, Z again factorises. For the case j(η θ) = kx, allocating η > θ, the value of Z is Z = (η θ)[(j/k)(γ + δ)θ + γ p ]. Since (η θ)/k > 1, Z factorises. 16
17 Suppose jx = ky. Then Z = ½X[η((γ + δ) + (γ δ)(j/k)) + θ((γ + δ) (γ δ)(j/k))]. We can choose arbitrarily γ > δ. To ensure the term in [ ] is not 1 or 2, we need to evaluate the θ term. Now j/k = 1 + {2(δγ p γδ p )/((γ δ)(γ p δ p ))}, so the θ term is the positive value θ((γ + δ) (γ δ)(j/k)) = 2θδ p (γ + δ)/(γ p δ p ). If X/k is even, so are γ δ. For X/k odd, the k[ ] term is even. So Z is not prime. Now consider j(γ + δ) = ky, which gives Z = (γ + δ)[(ηγ + θδ)(j/k) W)]. So combining the facts (ηγ + θδ) > γ + δ Y W > Y 2W = X, we verify that the term in [ ] is positive > 1, implying that Z factorises. Lastly, for j(η + θ) = ky, we evaluate that Z = (η + θ)[γy W(γ + δ) + θ(γ δ)(j/k)] so that Z = (η + θ)[γx + W(γ δ) + θ(γ δ)(j/k)], choosing arbitrarily γ > δ gives Z is not prime. The same theorem carries over for η θ integers, with two prime factors instead of one, because the terms in [ ] can now be ±1 or ±2. No representations of primes are of the form γ p δ p, except for the possibilities p = 1, or δ = (γ 1) p prime. Proof. If α β = γ (p m ) δ (p m ) is prime, with α, β, γ, δ, ε, µ N from now on, then the second FSFT gives m = 1 (otherwise (*) above factorises), α β = [α 1/p β 1/p ]{ Σ(s = 0, p 1)[α s/p ][β (p 1 s)/p ]} is prime, the derivation of which implies α β are powers of p, i.e. α = γ p, β = δ p, either γ δ = 1 or Σ(s = 0, p 1)[γ s ][δ p 1 s ] = 1, the latter corresponding to p = 1, so we choose the former. If p is not prime, say p = jq, then because γ = α 1/p = α 1/qj = (α 1/q ) (1/j) is a natural number, so is α 1/q, similarly for β 1/q. Then the prime α β can be represented by the product (***) [α 1/q β 1/q ]{ Σ(s = 0, q 1)[α s/q ][β (q 1 s)/q ]}. Now if a > 1 x > y, we obtain the inequality 17
18 (x y) a = (x y) a 1 (x y) < x a 1 (x y) < x a y a. Inserting x = α 1/p, y = β 1/p a = p/q has the consequence 1 = [α 1/p β 1/p ] = [α 1/p β 1/p ] (p/q) < [α 1/q β 1/q ]. Thus in (***) the first second terms 1, all terms involve sums of natural numbers a contradiction. Hence p is prime. Under the conditions of the previous theorem, p divides γ p δ p 1. Proof. By Fermat s theorem, if p is any prime γ δ are integers, then p divides (γ p γ) (δ δ p ), so p divides (γ p δ p γ + δ) = (γ p δ p 1). Let p > 2 be even, γ > δ 1 γ δ 1, then γ p δ p has at least three factors. Proof. Consider γ p δ p. This may, for even p, be factorised as (γ δ)(γ p 1 + γ p 2 δ + γ p 3 δ δ p 1 ) or as (γ + δ)(γ p 1 γ p 2 δ + γ p 3 δ 2 δ p 1 ). Since γ δ γ + δ, if there are only two factors, which is the minimum if γ δ 1, then γ δ = (γ p 1 γ p 2 δ + γ p 3 δ 2 δ p 1 ) γ + δ = (γ p 1 + γ p 2 δ + γ p 3 δ δ p 1 ), so adding these gives successively γ = γ p 1 + γ p 3 δ γδ p 2 γ γ p 1 + γ p γ, which is impossible. We cannot dispense with the condition γ δ 1, because if γ = 2, δ = 1 p = 4, then γ p δ p = 15. A more general theorem follows next. Let p = (2 k 0 )Π(i = 1, n)(q i k i ), where the q i are distinct odd primes, γ > δ 1. Then γ p δ p has at least Σ(i = 0, n)k i factors, at least 1 + Σ(i = 0, n)k i factors when γ δ 1. Proof. Let q 0 = 2. For the first pass through, consider all factors of p = Π(i = 0, n) (q i k i ) except for one unexponentiated factor q r. This product is just x r = Π(i = 0, n) Π(j = 0, k i 1, omit r for one i)(q i ). Then p = (x r )(q r ). By the equation at the end of section 2.2 γ p δ p = [(γ x r ) (δ x r )][ Σ(s = 0, q r 1)[γ x r s][δ x r (q r 1 s)]]. We now have at least two factors. We can then exp out (γ x r ) (δ x r ) recursively, using the same formula, yielding at least one extra factor each time. 18
19 We continue iteratively, until we end up with γ δ, which can be a proper factor or the trivial factor 1, which we ignore. We have now Σ(i = 0, n)k i iterations, giving at least Σ(i = 0, n)k i factors if γ δ = 1 or at least 1 + Σ(i = 0, n)k i factors otherwise. Let p = (2 k 0 )t, where t = Π(i = 1, n)(q i k i ), the q i are distinct odd primes, arrange γ > δ 1. Then γ p + δ p has at least 1 + Σ(i = 1, n)k i factors. Proof. t is odd, may be represented in a similar manner as before as t = (y r )(q r ). By another formula at the end of section 2.2 ε t + µ t = [(ε y r ) + (µ y r )][ Σ(s = 0, q r 1)[ ε y r s][(-µ) y r (q r 1 s)]]. Put ε = γ (2 k 0 ) µ = δ (2 k 0 ). The number of factors is obtained by recursion as previously, where, if prime, the final factor ε + µ will not add to the result. If p 1, χ 1 = (δ p) + (ε p) is prime χ 2 = (ε p) (µ p) is prime then χ 1 χ 2 is not prime unless χ 1 = 5 χ 2 = 3. Proof. χ 1 χ 2 = (δ p) + (µ p) is even 2 or = 2, otherwise χ 1 = 2 or χ 2 = 2. Now both p = 2 t p is prime, so p = 2. If χ 1 χ 2 = 2, then δ = µ = 1, so (ε 1) = 1, ε = 2 χ 1 = 5 χ 2 = 3. If χ 1 = 2 then δ = ε = 1 χ 2 = 1 µ 2, which is impossible. So χ 2 = 2 = (ε µ)(ε + µ), if (ε µ) = 1 then 2 = 2µ + 1, which is impossible. Hence χ 1 χ 2 is not prime or χ 1 = 5 χ 2 = 3. If p 1, χ 3 = (δ p) + (ε p) is prime χ 4 = (ε p) + (µ p) is prime then χ 3 χ 4 is not prime unless χ 3 = 5 χ 4 = 2. Proof. This results from the previous theorem. Alternatively, assume χ 3 χ 4 is prime. We prove a partial contradiction. Then χ 3 χ 4 = (δ p) (µ p), so both p = 2 t p is prime, so p = 2 (δ µ) = 1. Suppose χ 3 2 χ 4 2, then for χ 3 χ 4 to be prime it must = 2. Hence 2 = δ 2 (δ 1) 2 = 2δ 1, which is impossible. Hence we have primes χ 3 = δ 2 + ε 2 2 χ 4 = (δ 1) 2 + ε 2 = 2, so ε = 1, δ = 2 χ 3 = = 5. We note that the binomial expansion of γ p δ p for γ = (δ + 1) is Σ(r = 1, p)[p!/r!(p r)!]δ p r. That p divides (δ + 1) p δ p 1 is easy to prove directly by a binomial expansion, the expression being pδ p 1 + [p(p 1)/2]δ p pδ, so if p is prime the factorial denominators do not divide p. We extend the above result. For p prime, p divides (δ + 1) p (δ x) p x 1. Proof. For two adjacent numbers, p divides (δ + 1) p δ p 1 δ p (δ 1) p 1. Hence p divides their sum. The result follows by induction. 19
20 Corollary. If p is prime, then p divides y p (y x) p w if only if x w (mod p). Putting y = x, this gives Fermat s little theorem, y p y 0 (mod p), from the binomial theorem. With z = y x, we find that if y z (mod p) then Σ(r = 1, p)[y p-r z r-1 ] 1 (mod p). If y p y is divisible by p, then so is y n(p-1)+1 y. Proof. Since y 2p-1 y p = y p-1 (y p y) is divisible by p, the sum (y 2p-1 y p ) + (y p y) is also, with the general result following by recursion. The proof extends to divisibility by any natural number m instead of a prime p. Examples. Putting p = 3, we have for any odd natural number q y q y 0 (mod 6), putting p = 5, so q = 4n + 1, or p = 7, giving q = 6n + 1, etc. implies y q y 0 (mod 6p). Expressions with Bernoulli numbers B k inside quotation marks will be written as a sum of terms, each of which is a power of B times some number. The powers of B are then interpreted as Bernoulli numbers. Thus Faulhaber s formula becomes 1 k k m k-1 = [ (m + B) k B k ]/k, summing the Fermat little theorem terms (1 p 1) + (2 p 2) + + (y p y) entails the following expression is divisible by p: {[ (y + B) p+1 B p+1 ]/(p + 1)} ½y(y + 1). If we carry out the derivation for Fermat s little theorem again, this time explicitly, we find the general identity for any not necessarily prime q y q y = qσ(r = 1, q 1){[(q 1)!/(r!(q r)!)] [ (y + B 1) q-r+1 B q-r+1 ]/(q r + 1)}. A related use of the binomial theorem is, for n > 1 p prime > n 2, the expression y p (y p) p + Σ(k = 1, n 2)(-1) k [p!/(k!(p k)!)]p k y p-k 0 (mod p n). Let p be odd > 5. The following expressions are divisible by p, also p 2, if prime. (δ + 1) p δ p 1 pδ[δ p-2 + [(p 1)/2]δ(δ p-4 + 1) + 1], (δ + 1) p (δ 1) p pδ 2 [p 1 + 2δ p-3 ] 2 (δ + 1) p 2δ p + (δ 1) p pδ[(p 1)δ p-3 + 2]. 20
21 Proof. The first expression is derived from a binomial expansion of (δ + 1) p, with the first three last three terms subtracted. Considering factorial denominators, it is divisible by p or p 2 when either of these are prime, or both when both are prime. The second third expressions are obtained from the first under the transformation δ -δ, respectively adding or subtracting this result from the first. Let n be even p be odd, with p > 2n + 1. Then the following expressions are divisible by all primes between (p n) p inclusive: (δ + 1) p (r = 0, n){p!/[r!(p r)!]}δ r (δ p-2r + 1), (δ + 1) p (δ 1) p 2{ (r = 0, n/2)[p!/[(2r)!(p 2r)!]]δ 2r + (r = 1, n/2)[p!/[(2r 1)!(p 2r + 1)!]]δ p-2r+1 } (δ + 1) p + (δ 1) p 2{ (r = 0, n/2)[p!/[(2r)!(p 2r)!]]δ p-2r + (r = 1, n/2)[p!/[(2r 1)!(p 2r + 1)!]]δ 2r-1 }. Proof. By the binomial theorem, the first expression is equal to (s = n + 1, (p + 1)/2)[p!/[s!(p s)!]]δ s (δ p-2s + 1). To determine the summation range, there are p + 1 terms in the expansion of (δ + 1) p, we are subtracting 2(n + 1) terms, so the number remaining is p 2n 1. The upper range in the summation is (p 2n 1)/2 + n + 1 = (p + 1)/2. To show p > 2n + 1, for there to be no cancellations with primes, the lowest factor term of the largest p!/(p s)! is (p n), if prime this must be greater than the concurrent greatest divisor term of p!/(p s)! by s = n + 1. Thus no factorial denominators divide primes in the numerator between (p n) p. Under the transformation δ -δ, we obtain -(δ 1) p { (r = 0, n/2)[p!/[(2r)!(p 2r)!]]δ 2r (1 δ p-4r ) + (r = 1, n/2)[p!/[(2r 1)!(p 2r + 1)!]]δ 2r-1 (1 δ p-4r+2 )} is divisible by all primes between (p n) p inclusive. Hence by adding this expression with the corresponding expression for +δ, or by subtracting it, we obtain the two subsequent divisibility results. We investigate analogues of Fermat s little theorem for primes between (p n) p. Let n be even p be odd, with p > 2n + 1. Then the following expressions are divisible by all primes between (p n) p inclusive: (δ + 1) p (δ x) p x 1 (r = 1, n)[p!/[r!(p r)!]] {[ [(δ + B) p-r+1 (δ x 1 + B) p-r+1 ] /(p r + 1)] + [ [(δ + B) r+1 (δ x 1 + B) r+1 ] /(r + 1)]}, (δ + 1) p (δ 1) p (δ x) p + (δ + x) p 2x 2 2 (r = 1, n/2){[p!/[(2r!)(p 2r)!]] [ [(δ + B) 2r+1 (δ x 1 + B) 2r+1 ] /(2r + 1)] + [1/[(2r 1)!)(p 2r + 1)!]] [ [(δ + B) p-2r+2 (δ x 1 + B) p-2r+2 ] /(p 2r + 2)]}] (δ + 1) p + (δ 1) p (δ x) p (δ + x) p 2 (r = 1, n/2){[p!/[(2r!)(p 2r)!]] 21
22 [ [(δ + B) p-2r+1 (δ x 1 + B) p-2r+1 ] /(p 2r + 1)] + [1/[(2r 1)!)(p 2r + 1)!]] [ [(δ + B) 2r (δ x 1 + B) 2r ] /2r]}]. Proof. We use Faulhaber s formula, noting (s = 0, x)(δ s) q = (s = 0, δ)s q (s = 0, δ x 1)s q. Put y = δ + 1 = x + 1. Then by direct transcription the following expressions are divisible by all primes between (p n) p, for n even, p odd p > 2n + 1: y p y (r = 1, n)[p!/[r!(p r)!]] {[ [(y + B 1) p-r+1 (B 1) p-r+1 ] /(p r + 1)] + [ [(y + B 1) r+1 (B 1) r+1 ] /(r + 1)]}, y p (y 2) p + 2(y 1) p 2y 2 [ (r = 1, n/2){[p!/[(2r!)(p 2r)!]] [ [(y + B 1) 2r+1 (B 1) 2r+1 ] /(2r + 1)] + [1/[(2r 1)!)(p 2r + 1)!]] [ [(y + B 1) p-2r+2 (B 1) p-2r+2 ] /(p 2r + 2)]}] y p + (y 2) p 2(y 1) p 2[ (r = 1, n/2){[p!/[(2r!)(p 2r)!]] [ [(y + B 1) p-2r+1 (B 1) p-2r+1 ] /(p 2r + 1)] + [1/[(2r 1)!)(p 2r + 1)!]] [ [(y + B 1) 2r (B 1) 2r ] /2r]}]. We now consider polynomial forms. If x i y i (mod n) r i s i (mod n) then r i [x i t i ] s i [y i t i ] (mod n). If n is prime t i = K i n + u i, then by Fermat s little theorem r i [x i t i ] s i [y i (K i + u i )] (mod n). For m, p > 0, n, q > 1 N, there is an isomorphism between additive k (mod n), for fixed q, multiplicative q k, so for k = p m, by the second FSFT example of section 4 with f = 1, we obtain q (p m ) 1 (mod (q 1)). Consequently q ( (p i m i )) 1 (mod (q 1)), so for any u i > 0 N we derive the implication (t = 1, u i )(p i m i ) = u i (p i m i ), q ( u i (p i m i )) 1 (mod (q 1)). By the FAFT, we also obtain the following results for p odd: q (p m ) -1 (mod (q + 1)) q ( (i = 1, j)(p i m i )) (-1) j (mod (q + 1)), which indicates a corresponding equation extending to p i even (put p i = 1, u i = v i m i ) q ( u i (p i m i )) (-1) ( u i p i ) (mod (q + 1)). 22
23 For p odd prime quadratic reciprocity theorems follow from Fermat s little theorem by considering y(y (p-1)/2 1)(y (p-1)/2 + 1) y((y 2 ) (p-1)/2 1) 0 (mod p), so all squares 0 (mod p) belong to the (y (p-1)/2 1) equivalence class [31]. Both y (p-1)/2 1 y (p-1)/2-1 (mod p) have (p 1)/2 root positions. For squares, we assert (the occupancy theorem, proved next) that these are all occupied by specific numbers, so there is an isomorphism between complex roots y (p-1)/2 = 1 at one extremity non-empty equivalence classes of y 2 (mod p) with y (p-1)/2 1 (mod p) at the other. We now prove the occupancy theorem, also applicable on adding γp to all ranges. Assigning all numbers (mod p), p prime, m 2 n 2 if only if m n m (p n). Proof. A two way implication holds. We will prove that m 2 n 2 0 (mod p) leads to a contradiction, which would mean (m n)(m + n) = νp for some ν. Put m > n m, n < (p 1)/2, so (m + n) < p 1 also (m n) < (p 1)/2. But p, being prime, must be a factor of (m n), (m + n) or both, this is impossible. If p > m n > (p 1)/2, then 2p 1 > (m + n) > p (p 3)/2 > (m n) > 1, so neither (m + n) nor (m n) is divisible by p If say n < (p 1)/2 p > m > (p 1)/2 then the only possibility is (m + n) = p, since (m n)(m + n) = [a number < p][a number > (p 1)/2]. The little theorem is more generally written as yu(y (p-1)/2 u (p-1)/2 )(y (p-1)/2 + u (p-1)/2 ), for which the LCFT implies u(y p ) y(u p ) = (y 2 u 2 )W = (y 2 u 2 )Σ(r = 0, (p 3)/2)[y 2r+1 u p-2r-2 ] 0 (mod p), so that W factorises. For p odd prime, quadratic reciprocity theorems give a factorisation of the Fermat expression y n(p-1)+1 y, by considering y(y n(p-1)/2 1)(y n(p-1)/2 + 1). Our alternative formulation of the expression is yu{[y n(p 1)/2 ] [u n(p 1)/2 ]}{[y n(p 1)/2 ] + [u n(p 1)/2 ]}, so this time the LCFT implies u(y n(p-1)+1 ) y(u n(p-1)+1 ) = (y 2 u 2 )W = (y 2 u 2 )Σ(r = 0, (n(p 1)/2) 1)[y 2r+1 u n(p-1)-2r-1 ] 0 (mod p), W again factorises further. Note also the variation that for p prime j > 0 0 (mod p) [(y p) y] [p (j 1)], since intermediate terms in the binomial expansion are 0 (mod p) 0 (mod p) [y (p j)] + {(-y) [p (j 1)]} y{y [(p j) 1] + (-1) j}. We derive the result when p is an odd prime that if j is odd 0 (mod p) y{y {[(p j) 1]/2} 1}{y {[(p j) 1]/2} + 1}, if j is even -2y (mod p) the same expression. 23
24 If y 0 (mod p) in the latter, -2 (mod p) uniquely factorises as either (-1)(2) (mod p) so 0, 1, 3 or -2 (mod p) y {[(p j) 1]/2} or as (1)(-2) (mod p) so 0, 2, -1 or -3 (mod p) y {[(p j) 1]/2}. The above technique can be used in the context of solving an nth degree polynomial equation with Heegner integer coefficients at least (n 4) such integer solutions. We note that y 0 (mod p) y 1 (mod p) are always present, the latter as a square (mod p). The following theorem is useful in determining some further ±1 (mod p) interrelationships between various y (p-1)/2. Let 0 < y < p, with p odd (for example p prime) m N, then y (p-1)/2 (-1) (p-1)/2 (mp y) (p-1)/2 (mod p). Proof. Firstly, consider (p 1)/2 even. Then a binomial expansion of the right h side, leaving out terms in mp to a power, which are 0 (mod p), indicates that y (p-1)/2 (-y) (p-1)/2 (mod p). If (p 1)/2 is odd, then the binomial expansion gives y (p-1)/2 -(-y) (p-1)/2 (mod p). Our theorem has the following consequences. Taking the typical example for the p = 11 table below, y 5 repeats mod 11 in three regions, A, B C, the above equation representing symmetries in regions B C. Table: p = 11, (p 1)/2 = 5. y (mod p) y 5 y 5 (mod 11) region A B 0 < n < (p 1)/ C (p 1)/2 < n < p (mod 11) repeats For (p 1)/2 odd, if 0 < n < (p 1)/2, i.e. region B, then there are k terms 1 (mod p) (p 1)/2 k terms -1 (mod p), so there must be in the (p 1)/2 < n < p region C, k terms -1 (mod p) (p 1)/2 k terms +1 (mod p), giving the complete set of (p 1)/2 root positions for both 1 (mod p) -1 (mod p). 24
25 Table: p = 17, (p 1)/2 = 8. y (mod p) y 8 y 8 (mod 17) region A B 0 < n < (p 1)/ C (p 1)/2 < n < p (mod 17) repeats If (p 1)/2 is even, with the k terms 1 (mod p) for region B below, there are k terms 1 (mod p) in region C, opposite in sign to the odd case. Thus there are 2k slots for 2k = (p 1)/2 quadratic residues of 1 2 to 4k 2 in the combined B C region, these slots in B ( C) are completely occupied. So k = (p 1)/4 in the B region, similarly the residues -1 (mod p) occupy k slots in this region, likewise in region C. Note the generalised Fermat little theorem with q = (p 1)/2 prime gives a formula for y (p-1)/2 (mod p). We now prove the occupancy theorem. If m n < (p 1)/2, with p prime, then m 2 n 2 (mod p). Proof. We will prove that m 2 n 2 0 (mod p) leads to a contradiction, which would mean (m n)(m + n) = kp for some k. Say m > n, then n < (p 1)/2, so m + n < p 1 < p likewise (m n) < p 1. But p, being prime, must be a factor of (m n), (m + n) or both, this is impossible. Since 1 is a square, it follows from the above considerations that when (p 1)/2 is even, (-1) (p-1)/2 1 (mod p), when (p 1)/2 is odd, (-1) (p-1)/2-1 (mod p). We have dealt with recurrence relations between numbers of the form y (p-1)/2 (mod p). Another useful relation to determine the value of y (p-1)/2 (mod p) is (uv) (p-1)/2 (mod p) [u (p-1)/2 (mod p)][v (p-1)/2 (mod p)]. A basic question is then: when is a prime a square (mod p)? If we look at the table for squares, say in the (mod 7) example that follows, there are p squares from 0 to p 2 1 (mod p 2 ), being 0 2, 1 2, (p 1) 2. 25
26 Table: p = 7, squares (underlined) to p 2 = 49. Region E columns = region F columns. region D 0 region E region F next p 2 49 Since, by the binomial theorem for squares, (p + n) 2 n 2 (mod p), these p squares fill, in p iterations (mod p), all the squares that are possible (mod p 2 ). Likewise, since (p n) 2 n 2 (mod p), those squares which are non-zero (mod p 2 ), repeat in just two non-overlapping sets (mod p 2 ), regions E F. Although the non-constructive pigeon hole principle can act as a barrier to understing, we now apply this principle here. We have previously proved that there are (p 1)/2 non-zero squares (mod p). The first overlapping set 0, in region E, being the first (p 1)/2 squares (mod p 2 ), maps to precisely (p 1)/2 separate squares (mod p), because otherwise there would be less than (p 1)/2 of them. We are using here full occupancy of the square slots. A crossing out method can be used, analogous to the sieve of Eratosthenes for primes, for determining whether a number is or is not a square (mod p). Set up a grid of width p depth > (p 1) 2 /4p < [(p 1) 2 /4p] + 1 with the first column labelled 0. Determine the column for a number n given by n (mod p). Put an X in column 0, an X in column 1 with no space between columns 0 1, an X in column 4 with two spaces between columns 1 4, so on, increasing the number of spaces by two each time continuing into other rows if necessary. If the column corresponding to n is reached, it is a square (mod p), otherwise it is not. Quadratic reciprocity is often introduced through binary quadratic forms, discussed in a later work, where we will prove the following supplementary law: 2 (p-1)/2 1 (mod p) if p = ±1 (mod 8), 2 (p-1)/2-1 (mod p) if p = ±3 (mod 8) quadratic reciprocity itself, which states, for p q distinct odd primes [10] [p (q-1)/2 (mod q)][q (p-1)/2 (mod p)] (-1) (p-1)(q-1)/4. If we recast this as [p (q-1)/2 (mod q)] [(-1 (q-1)/2 q) (p-1)/2 (mod p)], the theorem is seen to be equivalent to the form in which Gauss put it 26
EE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότεραFinite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραOrdinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραSrednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Διαβάστε περισσότερα2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.
EAMCET-. THEORY OF EQUATIONS PREVIOUS EAMCET Bits. Each of the roots of the equation x 6x + 6x 5= are increased by k so that the new transformed equation does not contain term. Then k =... - 4. - Sol.
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότεραQuadratic Expressions
Quadratic Expressions. The standard form of a quadratic equation is ax + bx + c = 0 where a, b, c R and a 0. The roots of ax + bx + c = 0 are b ± b a 4ac. 3. For the equation ax +bx+c = 0, sum of the roots
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότεραforms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with
Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότεραUniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότερα6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραPARTIAL NOTES for 6.1 Trigonometric Identities
PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραFourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραSOLVING CUBICS AND QUARTICS BY RADICALS
SOLVING CUBICS AND QUARTICS BY RADICALS The purpose of this handout is to record the classical formulas expressing the roots of degree three and degree four polynomials in terms of radicals. We begin with
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραMath 6 SL Probability Distributions Practice Test Mark Scheme
Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry
Διαβάστε περισσότεραNumerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 12 Periodic data A function g has period P if g(x + P ) = g(x) Model: Trigonometric polynomial of order M T M (x) =
Διαβάστε περισσότεραSection 9.2 Polar Equations and Graphs
180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότεραSecond Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Διαβάστε περισσότεραDerivations of Useful Trigonometric Identities
Derivations of Useful Trigonometric Identities Pythagorean Identity This is a basic and very useful relationship which comes directly from the definition of the trigonometric ratios of sine and cosine
Διαβάστε περισσότεραLecture 13 - Root Space Decomposition II
Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότεραDESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.
DESIGN OF MACHINERY SOLUTION MANUAL -7-1! PROBLEM -7 Statement: Design a double-dwell cam to move a follower from to 25 6, dwell for 12, fall 25 and dwell for the remader The total cycle must take 4 sec
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραFinite difference method for 2-D heat equation
Finite difference method for 2-D heat equation Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραA Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
Διαβάστε περισσότεραJesse Maassen and Mark Lundstrom Purdue University November 25, 2013
Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering
Διαβάστε περισσότεραPractice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1
Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the
Διαβάστε περισσότεραLecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Διαβάστε περισσότεραChapter 3: Ordinal Numbers
Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What
Διαβάστε περισσότεραSCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Διαβάστε περισσότεραTridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότεραSOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
Διαβάστε περισσότεραCHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS
CHAPTER 48 APPLICATIONS OF MATRICES AND DETERMINANTS EXERCISE 01 Page 545 1. Use matrices to solve: 3x + 4y x + 5y + 7 3x + 4y x + 5y 7 Hence, 3 4 x 0 5 y 7 The inverse of 3 4 5 is: 1 5 4 1 5 4 15 8 3
Διαβάστε περισσότεραTrigonometric Formula Sheet
Trigonometric Formula Sheet Definition of the Trig Functions Right Triangle Definition Assume that: 0 < θ < or 0 < θ < 90 Unit Circle Definition Assume θ can be any angle. y x, y hypotenuse opposite θ
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότερα( ) 2 and compare to M.
Problems and Solutions for Section 4.2 4.9 through 4.33) 4.9 Calculate the square root of the matrix 3!0 M!0 8 Hint: Let M / 2 a!b ; calculate M / 2!b c ) 2 and compare to M. Solution: Given: 3!0 M!0 8
Διαβάστε περισσότεραArithmetical applications of lagrangian interpolation. Tanguy Rivoal. Institut Fourier CNRS and Université de Grenoble 1
Arithmetical applications of lagrangian interpolation Tanguy Rivoal Institut Fourier CNRS and Université de Grenoble Conference Diophantine and Analytic Problems in Number Theory, The 00th anniversary
Διαβάστε περισσότεραMATH423 String Theory Solutions 4. = 0 τ = f(s). (1) dτ ds = dxµ dτ f (s) (2) dτ 2 [f (s)] 2 + dxµ. dτ f (s) (3)
1. MATH43 String Theory Solutions 4 x = 0 τ = fs). 1) = = f s) ) x = x [f s)] + f s) 3) equation of motion is x = 0 if an only if f s) = 0 i.e. fs) = As + B with A, B constants. i.e. allowe reparametrisations
Διαβάστε περισσότερα2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
Διαβάστε περισσότεραNotes on the Open Economy
Notes on the Open Econom Ben J. Heijdra Universit of Groningen April 24 Introduction In this note we stud the two-countr model of Table.4 in more detail. restated here for convenience. The model is Table.4.
Διαβάστε περισσότεραCyclic or elementary abelian Covers of K 4
Cyclic or elementary abelian Covers of K 4 Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China Summer School, Rogla, Slovenian 2011-06 Outline 1 Question 2 Main results 3
Διαβάστε περισσότεραMINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed
Διαβάστε περισσότεραNew bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Διαβάστε περισσότεραSpace-Time Symmetries
Chapter Space-Time Symmetries In classical fiel theory any continuous symmetry of the action generates a conserve current by Noether's proceure. If the Lagrangian is not invariant but only shifts by a
Διαβάστε περισσότεραEcon 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότερα= λ 1 1 e. = λ 1 =12. has the properties e 1. e 3,V(Y
Stat 50 Homework Solutions Spring 005. (a λ λ λ 44 (b trace( λ + λ + λ 0 (c V (e x e e λ e e λ e (λ e by definition, the eigenvector e has the properties e λ e and e e. (d λ e e + λ e e + λ e e 8 6 4 4
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότερα( y) Partial Differential Equations
Partial Dierential Equations Linear P.D.Es. contains no owers roducts o the deendent variables / an o its derivatives can occasionall be solved. Consider eamle ( ) a (sometimes written as a ) we can integrate
Διαβάστε περισσότεραD Alembert s Solution to the Wave Equation
D Alembert s Solution to the Wave Equation MATH 467 Partial Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Objectives In this lesson we will learn: a change of variable technique
Διαβάστε περισσότεραRoman Witu la 1. Let ξ = exp(i2π/5). Then, the following formulas hold true [6]:
Novi Sad J. Math. Vol. 43 No. 1 013 9- δ-fibonacci NUMBERS PART II Roman Witu la 1 Abstract. This is a continuation of paper [6]. We study fundamental properties applications of the so called δ-fibonacci
Διαβάστε περισσότεραDERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C
DERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C By Tom Irvine Email: tomirvine@aol.com August 6, 8 Introduction The obective is to derive a Miles equation which gives the overall response
Διαβάστε περισσότερα= {{D α, D α }, D α }. = [D α, 4iσ µ α α D α µ ] = 4iσ µ α α [Dα, D α ] µ.
PHY 396 T: SUSY Solutions for problem set #1. Problem 2(a): First of all, [D α, D 2 D α D α ] = {D α, D α }D α D α {D α, D α } = {D α, D α }D α + D α {D α, D α } (S.1) = {{D α, D α }, D α }. Second, {D
Διαβάστε περισσότεραEQUATIONS OF DEGREE 3 AND 4.
EQUATIONS OF DEGREE AND 4. IAN KIMING Consider the equation. Equations of degree. x + ax 2 + bx + c = 0, with a, b, c R. Substituting y := x + a, we find for y an equation of the form: ( ) y + py + 2q
Διαβάστε περισσότεραProblem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ.
Chemistry 362 Dr Jean M Standard Problem Set 9 Solutions The ˆ L 2 operator is defined as Verify that the angular wavefunction Y θ,φ) Also verify that the eigenvalue is given by 2! 2 & L ˆ 2! 2 2 θ 2 +
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότεραHomework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Διαβάστε περισσότεραω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω
0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +
Διαβάστε περισσότεραPotential Dividers. 46 minutes. 46 marks. Page 1 of 11
Potential Dividers 46 minutes 46 marks Page 1 of 11 Q1. In the circuit shown in the figure below, the battery, of negligible internal resistance, has an emf of 30 V. The pd across the lamp is 6.0 V and
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότεραECE Spring Prof. David R. Jackson ECE Dept. Notes 2
ECE 634 Spring 6 Prof. David R. Jackson ECE Dept. Notes Fields in a Source-Free Region Example: Radiation from an aperture y PEC E t x Aperture Assume the following choice of vector potentials: A F = =
Διαβάστε περισσότεραAbstract Storage Devices
Abstract Storage Devices Robert König Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009 Outline 1. Motivation: Storage Devices 2. Abstract Storage Devices (ASD s) 3. Reducibility 4. Factoring ASD
Διαβάστε περισσότερα