Bifurcating Continued Fractions II
|
|
- Ξένα Πρωτονοτάριος
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Bifurcating Continued Fractions II Ashok Kumar Mittal Department of Physics Allahabad University, Allahabad , India ( address: Ashok Kumar Gupta Department of Electronics and Communication Allahabad University, Allahabad , INDIA ( address: akgjkiapt@hotmail.com) Abstract: In an earlier paper 1 we introduced the notion of 'bifurcating continued fractions' in a heuristic manner. In this paper a formal theory is developed for the bifurcating continued fractions. Keywords: Continued fractions, Quadratic irrational, Cubic irrational, Golden Mean, Fibonacci sequence, Tribonacci sequence. 1. Introduction Continued fractions provide deep insight into mathematical problems; particularly into the nature of numbers. 2 Continued fractions have found applications in various areas 3 of Physics such as Fabry-Perot interferometry, quasi-amorphous states of matter and chaos. Any eventually periodic continued fraction represents a quadratic irrational. Conversely, Lagrange's theorem asserts that the continued fraction expansion of every quadratic irrational is eventually periodic. A purely periodic continued fraction represents a quadratic irrational of a special kind called a reduced quadratic irrational. A quadratic irrational is said to be reduced if it is greater than 1 and the other root of the quadratic equation that it satisfies, lies between -1 and 0. Conversely, the continued fraction expansion of a reduced quadratic irrational is purely periodic. The continued fraction expansion consisting of the number 1 repeated indefinitely represents the 'golden mean'. This satisfies the quadratic equation x 2 = x + 1. The convergents of the continued fraction are obtained as the ratio of the successive terms of the Fibonacci sequence. Each term of the Fibonacci sequence is obtained by summing the previous two terms of the sequence. A straightforward generalization of the Fibonacci sequence is that of the Tribonacci sequence, in which each term is obtained by summing the previous three terms of the sequence. Tribonacci number, the limiting ratio of the successive terms of the Tribonacci sequence satisfy the Tribonacci equation x 3 = x 2 + x + 1. However, the conventional continued fraction expansion of the Tribonacci number offers no satisfying pattern that would reflect the simple generalization from the 'golden mean'.
2 In our earlier paper 1, a method to generalize the continued fraction expansion so as to remove this deficiency of the conventional continued fractions was suggested in a heuristic manner. This method associates two coupled non-negative integer sequences with two real numbers and based on these sequences a 'bifurcating continued fraction' expansion is obtained. The 'bifurcating continued fraction' resembles the conventional continued fraction, except that both the numerator and the denominator bifurcate in a Fibonacci Tree like manner, whereas in conventional continued fractions only the denominator bifurcates. In particular, two sequences consisting of the number 1 repeated indefinitely represent the Tribonacci number. Other cubic variants 4 of the 'golden mean', like the Moore number satisfying the cubic equation x 3 = x 2 + 1, also find very simple and elegant representation as a 'bifurcating continued fraction'. Bifurcating continued fraction representations reveal the secret beauty of many numbers. In this paper a formal theory of Bifurcating Continued Fractions (BCF) is developed. In Sec 2 the BCF algorithm for obtaining two integer sequences with an ordered pair of positive real numbers (α, β) is stated. How the pair (α, β) can be recovered by use of a Fibonacci Tree associated with the two integer sequences is described. Sec 3 gives a formal development of the BCF theory. There are two processes, which are converse to each other. First, given an ordered pair of real numbers (α, β) one can obtain a pair of sequences of non-negative integers by the BCF algorithm. This pair of sequences is called the BCF expansion of (α, β). Second, given a pair of sequences of non-negative integers, one can associate a pair of Fibonacci Trees with it using simple bifurcating rules. These trees, when they are finite, have straightforward interpretation as a pair of rational numbers. If appropriate limits exist, the pair of Fibonacci Trees associated with an ordered pair of infinite sequences of nonnegative integers may represent a pair of real numbers. In this case we say that the ordered pair of integer sequences is a Fibonacci Tree representation of (α, β). (α, β) may have more than one Fibonacci Tree representation. In Theorem 1, it is shown that the BCF expansion of (α, β) is a Fibonacci Tree representation of (α, β). This provides formal justification for the heuristics of our earlier paper 1. In order to establish Theorem 1, the notions of proper BCF representation and appropriate BCF representations were introduced. These are shown to be equivalent in Lemma 4. In Lemma 5, it is shown that the BCF expansion of (α, β) is the only proper BCF representation of (α, β). In Lemma 6, necessary conditions for an ordered pair of non-negative integer sequences to be a proper BCF representation of an ordered pair of real numbers is obtained. In Theorem 2 these conditions are shown to be sufficient. By Lemma 5, if these conditions are satisfied by an ordered pair of non-negative integer sequences, they are the BCF expansions of (α, β) for some α, β and by Theorem 1 these sequences are the Fibonacci Tree representation of (α, β). As a corollary there is only one Fibonacci Tree representation of (α, β) which satisfies these conditions.
3 2. Generalizing the Continued Fractions Given a positive real number α, the continued fraction expansion of α is given by a sequence of non-negative integers [a 0, a 1,.a i.], obtained by the recurrence relation where α 0 = α. a i = int(α i ), α i+1 = 1/(α i a i ), (1) Our generalization of the method of continued fraction is based on a generalization of equation (1). In this generalization we obtain an ordered pair of integer sequences {{a 0, a 1,,a i, }, {b 0, b 1,..,b i, }} from a given ordered pair {α,β} of positive real numbers by using the recurrence relations a i = int(α i ), b i = int(β i ), α i+1 = 1/(β i b i ), β i+1 = (α i a i )/β i - b i ), (2) where α 0 = α and β 0 = β. The numbers α and β can be recovered heuristically from the two integer sequences {a i } and {b i } by using the recurrence relations α i = a i + (β i+1 / α i+1 ), β i = b i + (1/α i+1 ) (3) Given the integer sequences {a i } and {b i }, one can write down the bifurcating continued fractions by the bifurcating rule: b i+1 a i a i a i+1 and 1 b i b i a i+1 where q p = p + r q r To get α, one begins with a 0 and to get β one begins with b 0. In this notation
4 b 3 a b 1 b 3 a 4 a 2 b 4 a 3 α = a 0 a 4 1 b 2 a 1 a 4 1 b 3 a 2 a 4 b 4 a 3 a 3 b 4 1 a 4 β = b 0 1 b 2 b 4 a 3 a 4 a 1 1 a 2 b 4 a 3 a 4
5 The Fibonacci tree structure of these expansions is obvious, in as much as at any branching level, the number of a s (#a) equals the sum of number of a s at the previous two levels. The same holds for the b s. #a n = #a n-1 + #a n-2, #b n = #b n-1 + #b n Formal development of Bifurcating Continued Fraction Theory In our earlier paper 1 we demonstrated how the BCF algorithm represented by the set of equations (2) appear to be a very attractive candidate for generalizing the conventional continued fraction algorithm. Hence there is a need to develop a formal theory of BCF along lines parallel to that of the conventional continued fractions. Def 1. Given an ordered pair {α, β} of positive real numbers, the ordered pair of integer sequences {{a 0, a 1,,a i, }, {b 0, b 1,..,b i, }} obtained by the Bifurcating Continued Fraction algorithm of equations (2) is called the BCF expansion of {α, β}. The algorithm is undefined if β i becomes an integer for some i = n (say); in this case we say that the BCF expansion of {α, β} is finite and is given by the ordered pair of finite sequences {{a 0, a 1,,a i, a n-1, α n }, {b 0, b 1,..,b i, b n }} where a i, b i are integers and α n is real. Lemma 1. If {{a 0, a 1,,a i, }, {b 0, b 1,..,b i, }} is the BCF expansion of the ordered pair {α, β}, then 1 a i b i for i 1 and if a n = b n for some n 1 then b n+1 = 0. Proof: We have, a i = int(α i ), b i = int(β i ), α i+1 = 1/(β i b i ), (4) β i+1 = (α i a i )/(β i - b i ), where α 0 = α and β 0 = β. Hence, α i+1 > 1 for i 0 (5) Therefore, a i = int(α i ) 1 for i 1 (6) Further,
6 Therefore, Hence, α i+1 /β i+1 = 1/(α i a i ) > 1 for i 0 (7) α i > β i for i 1 (8) int(α i ) int(β i ) i.e., a i b i for i 1 (9) If a n = b n for some n 1, then by (4) and (8), we must have β n+1 > 1 and therefore b n+1 0. Lemma 2 If α, β are positive rational numbers, the BCF expansion of the ordered pair {α, β} is finite. Proof: α, β are positive rational numbers implies α i, β i are positive rational for all i. Hence one can find integers u i, v i, w i such that α i = u i /w i and β i = v i /w i (10) Moreover, 1 < α i > β i for i 1. Therefore, Then, w i < u i > v i for i 1 (11) u i+1 /w i+1 = α i+1 = 1/(β i b i ) = 1/{(v i /w i ) - b i } = w i /(v i - b i w i ) v i+1 /w i+1 = β i+1 = (α i - a i )/(β i b i ) = {(u i /w i ) - a i }/{(v i /w i ) - b i } = (u i - a i w i )/(v i - b i w i ) (12) These are satisfied by u i+1 = w i, v i+1 = u i - a i w i, w i+1 = v i - b i w i (13) It follows from the BCF algorithm that w i+1 < w i for all i. Thus w i is a strictly decreasing sequence of natural numbers and therefore there must exist an n such that w n+1 = 0. But that implies β n = v n /w n = b n is an integer and therefore the BCF algorithm terminates. Def 2. The Fibonacci Tree sum of an ordered pair of sequences {{a 0, a 1,,a n, α n+1 }, {b 0, b 1,..,b n, β n+1 }} where a i, b i are non-negative integers and α n+1, β n+1 are positive reals, is defined as the ordered pair of real numbers (α, β) = (α 0, β 0 ) denoted by [{a 0, a 1,,a n, α n+1 }, {b 0, b 1,.., b n, β n+1 }] ) and obtained by the recurrence relations
7 [{a 0, a 1,,a n, α n+1 }, {b 0, b 1,..,b n, β n+1 }] = [{a 0, a 1,,a n-1, a n + (β n+1 /α n+1 )}, {b 0, b 1,..,b n-1, b n + (1/α n+1 }] (14) with the terminating condition [{α 0 }, {β 0 }] = (α 0, β 0 ) (15) Lemma 3. If [{a 0, a 1,,a n, α n+1 }, {b 0, b 1,..,b n, β n+1 }] = [{a 0, a 1,,a n, α' n+1 }, {b 0, b 1,..,b n, β' n+1 }] then α' n+1 = α n+1 and β' n+1 = β n+1. then Proof: The Lemma holds for n = 0. For, if [{a 0, α 1 }, {b 0, β 1 }] = [{a 0, α' 1 }, {b 0, β' 1 }] a 0 + (β 1 /α 1 ) = a 0 + (β' 1 /α' 1 ) (16) and b 0 + (1/α 1 ) = b 0 + (1/α' 1 ) (17) whence equation (17) implies α' 1 = α 1 and then equation (16) yields β' 1 = β 1. Assume as an induction hypothesis that the Lemma holds for n = 0, 1,.., k-1, so that if [{a 0, a 1,,a k-1, α k }, {b 0, b 1,..,b k-1, β k }] = [{a 0, a 1,,a k-1, α' k }, {b 0, b 1,..,b k-1, β' k }] then α' k = α k and β' k = β k. If [{a 0, a 1,,a k, α k+1 }, {b 0, b 1,..,b k, β k+1 }] = [{a 0, a 1,,a k, α' k+1 }, {b 0, b 1,..,b k, β' k+1 }] then [{a 0, a 1,,a k-1, a k + (β k+1 /α k+1 )}, {b 0, b 1,..,b k-1, b k + (1/α k+1 }] = [{a 0, a 1,,a k-1, a k + (β' k+1 /α' k+1 )}, {b 0, b 1,..,b k-1, b k + (1/α' k+1 }] (18) By induction hypothesis eqn (18) implies a k + (β k+1 /α k+1 ) = a k + (β' k+1 /α' k+1 ) (19) and b k + (1/α k+1 ) = b k + (1/α' k+1 ) (20) whence equation (20) implies α' k+1 = α k+1 and then equation (19) yields β' k+1 = β k+1. Thus the Lemma holds for n = 0 and further, if the Lemma holds for n = 0, 1,.., k-1, it holds for n = k. Hence the Lemma holds for all n.
8 Def 3. The n-term Fibonacci Tree sum of an ordered pair of non-negative integer sequences ({a 0, a 1,,a i, }, {b 0, b 1,..,b i, }) is defined by (α (n), β (n) ) = [{a 0, a 1,,a n-1, a n }, {b 0, b 1,..,b n-1, b n }] (21) If lim n (α (n), β (n) ) = (α, β) the ordered pair of integer sequences is called a Fibonacci Tree representation of (α, β). Example: The ordered pair of sequences ({1, 1, 1, }, {2, 2, 2, }) is a Fibonacci Tree representation of (α, β) where α satisfies α 3 = α 2 + 2α + 1 and β = 2 + (1/α). However the BCF expansion of (α, β) is ({2, 2, 3, 2, 3, 2, 3, 2, }, {2, 0, 0, 0, }). Def 4. An ordered pair of non-negative integer sequences ({a 0, a 1,,a i, }, {b 0, b 1,., b i, }) is called a proper BCF representation of (α, β), where α, β are positive real numbers, if for every n there exist positive reals α n and β n such that (α, β) = [{a 0, a 1,,a n-1, α n }, {b 0, b 1,..,b n-1, β n }] (22) and 1 < α n > β n for all n 1. Def 5. An ordered pair of non-negative integer sequences ({a 0, a 1,,a i, }, {b 0, b 1,..,b i, }) is called an appropriate BCF representation of (α, β), where α, β are positive real numbers, if for every n there exist positive reals α n and β n such that (α, β) = [{a 0, a 1,,a n-1, α n }, {b 0, b 1,..,b n-1, β n }] (23) and int(α n ) = a n, int(β n ) = b n. Lemma 4. An ordered pair of non-negative integer sequences ({a 0, a 1,,a i, }, {b 0, b 1,..,b i, }) is a proper BCF representation of (α, β) iff it is an appropriate BCF representation of (α, β) Proof: Suppose ({a 0, a 1,,a i, }, {b 0, b 1,..,b i, }) is a proper BCF representation of (α, β). Then for every n there exist positive reals α n and β n such that (α, β) = [{a 0, a 1,,a n-1, α n }, {b 0, b 1,..,b n-1, β n }] (24) and 1 < α n > β n for all n 1. Clearly, we must have [{a 0, a 1,,a n, α n+1 }, {b 0, b 1,..,b n, β n+1 }] = [{a 0, a 1,,a n-1, α n }, {b 0, b 1,..,b n-1, β n }] (25)
9 Applying eqn (14) and Lemma 3 to eqn (25) we get, α n = a n + (β n+1 / α n+1 ), β n = b n + (1/α n+1 ) (26) Since 0 < β n+1 /α n+1 < 1 and 0 < 1/α n+1 < 1 for all n, it follows from eqns (26) that a n = int(α n ) and b n = int(β n ). So the given pair of non-negative integer sequences is an appropriate BCF representation of (α, β). Conversely, suppose that the given pair of non-negative integer sequences is an appropriate BCF representation of (α, β). Then there exist reals α n and β n satisfying eqns (24) and (26). Moreover, a n = int(α n ) and b n = int(β n ). But then from eqns (26) it follows that 1 < α n > β n for all n 1. So the given pair of non-negative integer sequences is a proper BCF representation of (α, β). (α, β). Lemma 5. The BCF expansion of (α, β) is the only proper BCF representation of Proof: The BCF expansion of (α, β) gives rise to real numbers α i, β i by the algorithm α 0 = α, β 0 = β a i = int(α i ), b i = int(β i ) (27) α i+1 = 1/(β i - b i ), β i+1 = (α i - a i )/(β i - b i ) It is straightforward to verify that for every n (α, β) = [{a 0, a 1,,a n-1, α n }, {b 0, b 1,..,b n-1, β n }] (28) and α n+1 = 1/(β n - b n ) > 1, β n+1 /α n+1 = (α n - a n ) < 1 (29) so that 1 < α n > β n for all n 1. Hence the BCF expansion of (α, β) is a proper BCF representation of (α, β). Let {{a' 0, a' 1,,a' i, }, {b' 0, b' 1,..,b' i, }} be another proper BCF representation of (α, β). Then for every n there exist positive reals α' n and β' n such that (α, β) = [{a' 0, a' 1,,a' n-1, α' n }, {b' 0, b' 1,..,b' n-1, β' n }] (30) and 1 < α' n > β' n for all n 1. Then by eqn (26) α' n = a' n + (β' n+1 / α' n+1 ), β' n = b' n + (1/α' n+1 ) (31)
10 But α' 0 = α 0 = a 0 + (β 1 /α 1 ), β' 0 = β 0 = b 0 + (1/α 1 ) (32) Hence a 0 + (β 1 /α 1 ) = a' 0 + (β' 1 /α' 1 ), b 0 + (1/α 1 ) = b' 0 + (1/α' 1 ) (33) Because b 0, b' 0 are integers and α 1, α' 1 > 1 it follows that b 0 = b' 0 and α 1 = α' 1. Again because a 0, a' 0 are integers and β 1 /α 1 and β' 1 /α' 1 < 1 it follows that a 0 = a' 0 and β 1 = β' 1. By induction it is straightforward to show that a' n = a n and b n = b' n for all n. Lemma 6. If an ordered pair of non-negative integer sequences ({a 0, a 1,,a i, }, {b 0,b 1,..,b i, }) is a proper BCF representation of (α, β), then (i) 1 a n b n (ii) a n = b n for any n 1 implies b n+1 0. Proof: For every n there exist positive reals α n and β n such that and 1 < α n > β n if n 1. (i) By Lemma 4, (α, β) = [{a 0, a 1,,a n-1, α n }, {b 0, b 1,..,b n-1, β n }] (34) a n = int(α n ) 1 (ii) and a n = int(α n ) int(β n ) = b n Suppose a n = b n for some n 1 and b n+1 = 0. Then, β n+1 = (b n+1 + 1/α n+2 ) < 1 so that α n = (a n + β n+1 /α n+1 ) < (b n + 1/α n+1 ) = β n which contradicts the hypothesis. Lemma 7. [{a m, a m+1,,a n }, {b m, b m+1,..,b n }] = ((A m,n /A m+1, n ),(B m,n / A m+1, n )) where A m,n and B m,n satisfy the recurrence relations A m,n = a m A m+1,n + b m+1 A m+2,n + A m+3,n and B m,n = b m A m+1,n + A m+2,n, 0 m n <, with the notional initial conditions, A n+3,n = 0, A n+2,n = 0, A n+1,n = 1. Proof: The Lemma holds for m = n, because [{a n }, {b n }] = (a n, b n ) = ((A n,n /A n+1, n ),(B n,n /A n+1, n )). The Lemma also holds for m = n-1, because
11 [{a n-1, a n }, {b n-1, b n }] = (a n-1 + (b n /a n ), b n-1 + (1/a n )) = ((a n-1 a n + b n )/a n, (b n-1 a n + 1)/a n ) = ((a n-1 A n,n + b n A n+1,n + A n+2,n )/A n,n, (b n-1 A n,n + A n+1,n )/A n,n ) = ((A n-1,n /A n, n ),(B n-1,n / A n, n )) (35) Suppose that the Lemma holds for m = n-1, n-2,,n-k. Then, [{a n-k, a n-k+1,,a n }, {b n-k, b n-k+1,..,b n }] = ((A n-k,n /A n-k+1, n ),(B n-k,n / A n-k+1, n )) (36) where A n-k,n = a n-k A n-k+1,n + b n-k+1 A n-k+2,n + A n-k+3,n (37) and B n-k,n = b n-k A n-k+1,n + A n-k+2,n (38) Therefore, [{a n-k-1, a n-k,,a n }, {b n-k-1, b n-k,..,b n }] = [{a n-k-1, A n-k,n /A n-k+1, n }, {b n-k-1, B n-k,n / A n-k+1, n }] = ( a n-k-1 + (B n-k,n / A n-k+1, n )/ (A n-k,n /A n-k+1, n ), b n-k-1 + (1/ (A n-k,n /A n-k+1, n )) = ( a n-k-1 + (B n-k,n / A n-k,n ), b n-k-1 + (A n-k+1, n / A n-k,n )) = (( a n-k-1 A n-k,n + b n-k A n-k+1,n + A n-k+2,n )/ A n-k,n, (b n-k-1 A n-k,n + A n-k+1,n )/ A n-k,n ) = ((A n-k-1,n /A n-k, n ),(B n-k-1,n / A n-k, n )) ( 39) where A n-k-1,n = a n-k-1 A n-k,n + b n-k A n-k+1,n + A n-k+2,n (40) and B n-k-1,n = b n-k-1 A n-k,n + A n-k+1,n (41) Hence the Lemma holds for m = n - k-1 and therefore, by induction for all non-negative integer values of m less than or equal to n. Lemma 8. A m,n = a n A m, n-1 + b n A m,n-2 + A m,n-3 Proof: The Lemma holds for n = m because by Lemma 7 and the notional initial conditions we have,
12 A m, m = a m A m+1,m + b m+1 A m+2,m + A m+3,m = a m = a m A m,m-1 + b m A m,m-2 + A m,m-3 (42) The Lemma holds for n = m+1 because A m,m+1 = a m A m+1,m+1 + b m+1 A m+2,m+1 + A m+3,m+1 = a m a m+1 + b m+1 = a m+1 a m + b m+1 = a m+1 A m,m + b m+1 A m,m-1 + A m,m-2 (43) The Lemma holds for n = m + 2 because A m,m+2 = a m A m+1,m+2 + b m+1 A m+2,m+2 + A m+3,m+2 = a m (a m+1 a m+2 + b m+2 ) + b m+1 a m = a m+2 (a m a m+1 + b m+1 ) + b m+2 a m + 1 = a m+2 A m,m+1 + b m+2 A m,m + A m,m-1 (44) Assume as an induction hypothesis that the Lemma holds for n = m, m+1, m+2,, m+k so that, A m,m+k = a m+k A m,m+k-1 + b m+k A m,m+k-2 + A m,m+k-3 (45) We have by Lemma 7, A m,m+k+1 = a m A m+1,m+k+1 + b m+1 A m+2,m+k+1 + A m+3,m+k+1 = a m (a m+k+1 A m+1,m+k + b m+k+1 A m+1,m+k-1 + A m+1,m+k-2 ) + b m+1 (a m+k+1 A m+2,m+k + b m+k+1 A m+2,m+k-1 + A m+2,m+k-2 ) + (a m+k+1 A m+3,m+k + b m+k+1 A m+3,m+k-1 + A m+3,m+k-2 ) = a m+k+1 (a m A m+1,m+k + b m+1 A m+2,m+k + A m+3,m+k ) + b m+k+1 (a m A m+1,m+k-1 + b m+1 A m+2,m+k-1 + A m+3,m+k-1 ) + (a m A m+1,m+k-2 + b m+1 A m+2,m+k-2 + A m+3,m+k-2 ) = a m+k+1 A m,m+k + b m+k+1 A m,m+k-1 + A m,m+k-2 (46) Hence the Lemma holds for n = m + k + 1 and therefore for all integer values of n greater than or equal to m.
13 Lemma 9. B m,n = a n B m, n-1 + b n B m,n-2 + B m,n-3 Proof: We have by Lemma 7 and 8 B m,n = b m A m+1,n + A m+2,n = b m (a n A m+1,n-1 + b n A m+1,n-2 + A m+1,n-3 ) + (a n A m+2,n-1 + b n A m+2,n-2 + A m+2,n-3 ) = a n (b m A m+1,n-1 + A m+2,n-1 ) + b n (b m A m+1,n-2 + A m+2,n-2 ) + (b m A m+1,n-3 + A m+2,n-3 ) = a n B m,n-1 + b m B m, n-2 + B m,n-3 (47) Lemma 10. A n A n-1 A n-2 det B n B n-1 B n-2 = 1 C n C n-1 C n-2 where A i = A 0,i, B i = B 0,i and C i = A 1,i Proof: For n > 2, using Lemmas 8 and 9, we have A n A n-1 A n-2 a n A n-1 + b n A n-2 + A n-3 A n-1 A n-2 det B n B n-1 B n-2 = det a n B n-1 + b n B n-2 + B n-3 B n-1 B n-2 C n C n-1 C n-2 a n C n-1 + b n C n-2 + C n-3 C n-1 C n-2 A n-3 A n-1 A n-2 A n-1 A n-2 A n-3 = det B n-3 B n-1 B n-2 = det B n-1 B n-2 B n-3 =.. =.. C n-3 C n-1 C n-2 C n-1 C n-2 C n-3 A 2 A 1 A 0 A 0,2 A 0,1 A 0,0 = det B 2 B 1 B 0 = det B 0,2 B 0,1 B 0,0 C 2 C 1 C 0 A 1,2 A 1,1 A 1,0 a 0 A 1,2 + b 1 A 2,2 + 1 a 0 A 1,1 + b 1 a 0 = det b 0 A 1,2 + A 2,2 b 0 A 1,1 + 1 b 0 (using Lemma 7) A 1,2 A 1,1 1 b 1 A 2,2 + 1 b = det A 2,2 1 0 = det A 2,2 1 0 = 1 (48) A 1,2 A 1,1 1 A 1,2 A 1,1 1
14 Cor 1: A n, B n, C n cannot have a common factor Cor 2: (α (n) - α (n-1) )(β (n-1) - β (n-2) ) - (α (n-1) - α (n-2) )(β (n) - β (n-1) ) = 1/(C n-2 C n-1 C n ) (49) Proof: Using def 3, Lemma 7 and Lemma 9, we have A n A n-1 A n-2 α (n) α (n-1) α (n-2) det B n B n-1 B n-2 = C n C n-1 C n-2 β (n) β (n-1) β (n-2) = 1 (50) C n C n-1 C n Therefore, α (n) (β (n-1) - β (n-2) ) + α (n-1) (β (n-2) - β (n) ) + α (n-2) (β (n) - β (n-1) ) = 1/(C n C n-1 C n-2 ) (51) which yields eqn (49). Lemma 11. If 1 a i b i for all i 1 then the ordered pair of integer sequences ({a 0, a 1,, a i, }, {b 0, b 1,, b i, }) is a Fibonacci Tree representation of (α, β) for some real numbers α and β. Proof: In view of definition 3, Lemmas 7-9 and notation of Lemma 1, we have to show that lim n α (n) lim n A n /C n (52) and lim n β (n) lim n B n /C n (53) exist, where A n = a n A n-1 + b n A n-2 + A n-3 B n = a n B n-1 + b n B n-2 + B n-3 (54) From eqns (54), we get, C n = a n C n-1 + b n C n-2 + C n-3 (A n /A n-1 - C n /C n-1 ) = b n (A n-2 /A n-1 - C n-2 /C n-1 ) + (A n-3 /A n-1 - C n-3 /C n-1 ) But from eqns (54), we also get, = b n (C n-1 /C n-2 - A n-1 /A n-2 ) (A n-2 /A n-1 )( C n-2 /C n-1 ) + (C n-1 /C n-3 - A n-1 /A n-3 ) (A n-3 /A n-1 )(C n-3 /C n-1 ) (55) (A n /A n-2 - C n /C n-2 ) = a n (A n-1 /A n-2 - C n-1 /C n-2 ) + (A n-3 /A n-2 - C n-3 /C n-2 ) (56)
15 Using (56) in (55), we get, (A n /A n-1 - C n /C n-1 ) = b n (C n-1 /C n-2 - A n-1 /A n-2 )(A n-2 /A n-1 )(C n-2 /C n-1 ) + {a n-1 (C n-2 /C n-3 - A n-2 /A n-3 ) + (C n-4 /C n-3 - A n-4 /A n-3 )}(A n-3 /A n-1 )(C n-3 /C n-1 ) Therefore, = b n (C n-1 /C n-2 - A n-1 /A n-2 )(A n-2 /A n-1 )(C n-2 /C n-1 ) + a n-1 (C n-2 /C n-3 - A n-2 /A n-3 ) (A n-3 /A n-1 )(C n-3 /C n-1 ) + (A n-3 /A n-4 - C n-3 /C n-4 )(A n-4 /A n-1 )(C n-4 /C n-1 ) (57) (A n /C n - A n-1 /C n-1 )(C n /A n-1 ) = b n (A n-2 /C n-2 - A n-1 /C n-1 )(C n-2/a n-1 ) + a n-1 (A n-3 /C n-3 - A n-2 /C n-2 )(C n-2 /A n-1 )(C n-3 /C n-1 ) + (A n-3 /C n-3 - A n-4 /C n-4 )(C n-3 /A n-1 )(C n-4 /C n-1) (58) yielding Now, (A n /C n - A n-1 /C n-1 ) = b n (A n-2 /C n-2 - A n-1 /C n-1 )(C n-2/c n ) + a n-1 (A n-3 /C n-3 - A n-2 /C n-2 )(C n-2 /C n )(C n-3 /C n-1 ) + (A n-3 /C n-3 - A n-4 /C n-4 )(C n-3 /C n )(C n-4 /C n-1) (59) b n C n-2 /C n = b n C n-2 / (a n C n-1 + b n C n-2 + C n-3 ) = 0 ( if b n = 0) = 1/{(a n /b n )(C n-1 /C n-2 ) (1/b n ) (C n-3 /C n-2 )} (if b n 0) < 1/2 (because, C n-1 > C n-2 ) (60) and a n-1 (C n-2 /C n )(C n-3 /C n-1 ) = (C n-3 /C n ) {a n-1 C n-2 /(a n-1 C n-2 + b n-1 C n-3 + C n-4 ) < C n-3 /C n (61) But C n-3 /C n = C n-3 / (a n C n-1 + b n C n-2 + C n-3 ) = C n-3 / {a n (a n-1 C n-2 + b n-1 C n-3 + C n-4 ) + b n (a n-2 C n-3 + b n-2 C n-4 + C n-5 ) + C n-3 } < C n-3 /{a n a n-1 C n-2 + (b n a n-2 + b n-1 + 1)C n-3 } < 1/(a n a n-1 + b n a n-2 + b n-1 + 1) (because a n 1, C n-2 > C n-3 )
16 1/4 if b n 0, b n-1 0 < 1/3 if b n = 0, b n-1 0 or b n 0, b n-1 = 0 (62) 1/2 if b n = b n-1 = 0 Similarly, 1/4 if b n-1 0, b n-2 0 C n-4 /C n-1 < 1/3 if b n-1 = 0, b n-2 0 or b n-1 0, b n-2 = 0 (63) 1/2 if b n-1 = b n-2 = 0 Combining (62) and (63) 1/16 if b n 0, b n-1 0, b n-2 0 1/12 if b n 0, b n-1 0, b n-2 = 0 or b n = 0, b n-1 0, b n-2 0 (C n-3 /C n )(C n-4 /C n-1 ) < 1/9 if b n = 0, b n-1 0, b n-2 = 0 or b n 0, b n-1 = 0, b n-2 0 (64) 1/6 if b n 0, b n-1 = 0, b n-2 = 0 or b n = 0, b n-1 = 0, b n-2 0 1/4 if b n = 0, b n-1 = 0, b n-2 = 0 Let, n = (A n /C n - A n-1 /C n-1 ) (65) Then, by (60), (61), (62) and (64), we get, (1/2) n-2 + (1/4) n-3 (if b n = 0) (1/2) n-1 + (1/4) n-2 + (1/12) n-3 (if b n 0, b n-1 0) n < (1/2) n-1 + (1/3) n-2 + (1/9) n-3 (if b n 0, b n-1 0, b n-2 0) (66) (1/2) n-1 + (1/3) n-2 + (1/6) n-3 (if b n 0, b n-1 = 0, b n-2 = 0) Therefore, where Then, D n if b n 0, b n-1 = 0, b n-2 = 0 n < (67) (17/18) D n otherwise D n = max{ n-1, n-2, n-3 } (68) D n+1 = max{ n, n-1, n-2 } D n (69)
17 Hence {D n } is a non-increasing sequence of positive numbers. We show that there exists r < 1 such that D n+4 < r D n, wherefrom it follows that {D n } converges to zero. There are two cases to be considered. If b n 0, b n-1 = 0, b n-2 = 0 by (66), we get, n+1 < (1/2) n + (1/4) n-1 + (1/12) n-2 < (5/6) D n (by (67) and (68)) (70) n+2 < (1/2) n+1 + (1/3) n + (1/9) n-1 < (31/36) D n (by (67),(68) and (70)) (71) n+3 < (1/2) n+2 + (1/3) n+1 + (1/6) n < (7/8) D n (by (67), (70) and (71)) (72) Thus, D n+4 = max{ n+3, n+2, n+1 } < (7/8) D n (73) Otherwise, by (67), n < (17/18) D n (74) n+1 < (1/2) n + (1/3) n-1 + (1/6) n-2 < (35/36) D n (by (68) and (74)) (75) Therefore, n+2 < (1/2) n+1 + (1/3) n + (1/6) n-1 < (209/216) D n (by (68), (74) and (75)) (76) D n+3 = max{ n+2, n+1, n } < (35/36) D n (77) Hence, by (69), D n+4 D n+3 < (35/36) D n (78) Thus {D n } is a non-increasing sequence with D n+4 < r D n where r = 35/36 < 1. Hence {D n } converges to zero as n. From (71) it follows that the sequence { n } converges to zero, whence by eqn (65), lim n α (n) lim n A n /C n exists. Replacing A n by B n in the above proof, it can be shown that lim n β (n) lim n B n /C n exists. Hence if 1 a i b i for all i 1, then
18 the ordered pair of integer sequences ({a 0, a 1,, a i, }, {b 0, b 1,, b i, }) is a Fibonacci Tree representation of (α, β) for some real numbers α and β. Theorem 1. The BCF expansion of an ordered pair of real numbers (α, β) is a Fibonacci Tree representation of (α, β). Proof: Let ({a 0, a 1,.., a i, }, {b 0, b 1,.., b i, }) be the BCF expansion of the ordered pair (α, β). Then by Lemma 1, 1 a i b i for all i 1 and therefore by Lemma 11, there exist real numbers α' and β' such that lim n α (n) = α' (79) and lim n β (n) = β' (80) where α (n) = (A n / C n ) and β (n) = (B n / C n ) Now, where We have to show that α' = α and β' = β. α - α (n) = (α n A n-1 + β n A n-2 + A n-3 )/(α n C n-1 + β n C n-2 + C n-3 ) - (a n A n-1 + b n A n-2 + A n-3 )/(a n C n-1 + b n C n-2 + C n-3 ) = (A n + A ~ n)/(c n + C ~ n) - (A n /C n ) (81) A ~ n = (α n - a n ) A n-1 + (β n - b n ) A n-2 (82) and C ~ n = (α n - a n ) C n-1 + (β n - b n ) C n-2 (83) Then, α - α (n) = (A ~ n C n - A n C ~ n)/{c n (C n + C ~ n)} < (1/C n 2 ) A ~ n C n - A n C ~ n = (A n / C n ) (A ~ n / A n ) - (C ~ n / C n ) = (A n / C n ) (α n - a n ){(A n-1 /A n ) - (C n-1 /C n ) + (β n - b n ){(A n-2 /A n ) - (C n-2 /C n ) α (n) { (α (n-1) /α (n) - 1 (C n-1 /C n ) + (α (n-2) /α (n) - 1 (C n-2 /C n )} (84)
19 Hence, α - α' = lim n α - α (n) = 0 (because lim α (n) = α' ) (85) Therefore α' = α. Similarly it can be shown that β' = β. Theorem 2. If 1 a i b i for all i 1 and if a n = b n implies b n+1 0 then the ordered pair of integer sequences ({a 0, a 1,, a i, }, {b 0, b 1,, b i, }) is a proper BCF representation of (α, β) for some real numbers α and β. By Lemma 5, this must be the BCF expansion of (α, β). By Theorem 1, this must be a Fibonacci Tree representation of (α, β) Proof: By Lemma11, there exists real numbers α and β such that (α, β) = lim n (α (n), β (n) ) = lim n [{a 0, a 1,, a n }, {b 0, b 1,, b n }] (86) From the proof of Lemma 11, it is clear that for every m, lim n [{a m, a m+1,, a n }, {b m, b m+1,, b n }] exists. Let this limit be denoted by (α m, β m ). Thus for every m there exists α m, β m such that (α, β) = [{a 0, a 1,, a m-1, α m }, {b 0, b 1,, b m-1, β m }] (87) We have to show that 1 < α m > β m. Since, α m = lim n (A m,n / A m+1,n ) (88) and β m = lim n (B m,n / A m+1,n ) (89) we show that (A m,n / A m+1,n ) > 1 (90) and (A m,n / B m,n ) > 1 (91) so that 1 < α m > β m (92) By Lemma 7, A m,n = a m A m+1,n + b m+1 A m+2,n + A m+3,n (93) where given m, A m+3,n > 1 for sufficiently large n.
20 Thus, (A m,n /A m+1,n ) = a m + b m+1 (A m+2,n /A m+1,n ) + (A m+3,n /A m+1,n ) > 1 (94) Again by Lemma 7, (A m,n / B m,n ) = (a m A m+1,n + b m+1 A m+2,n + A m+3,n )/(b m A m+1,n + A m+2,n ) (95) If a m > b m, (A m,n / B m,n ) > 1 (because A m+1,n > A m+2,n by (90)) (96) If a m = b m, then b m+1 0 and again (A m,n / B m,n ) > 1 (97) Cor: There is only one Fibonacci Tree representation of (α, β) which satisfies the conditions (i) 1 a i b i for all i 1 and (ii) a n = b n implies b n+1 0 Theorem 3. If (α, β) has a purely periodic BCF expansion, then α satisfies a polynomial of degree at most three. Proof: Let the BCF expansion have period n + 1. Then, (α, β) = [{a 0, a 1,.., a n,α}, {b 0, b 1,..,b n, β}] (98) Hence, α = (αa n + βa n-1 + A n-2 )/ (αc n + βc n-1 + C n-2 ) (99) β = (αb n + βb n-1 + B n-2 )/ (αc n + βc n-1 + C n-2 ) (100) From (99) we get, C n α 2 + C n-1 αβ + (C n-2 - A n )α - A n-1 β - A n-2 = 0 (101) From (100) we get, C n-1 β 2 + C n αβ - B n α + (C n-2 - B n-1 )β - B n-2 = 0 (102) From (101) we get, β = {C n α 2 + (C n-2 - A n )α - A n-2 }/(A n-1 - C n-1 α) (103)
21 Putting (103) in (102), C n-1 {C n α 2 + (C n-2 - A n )α - A n-2 } 2 + (C n α + C n-2 - B n-1 ){C n α 2 + (C n-2 - A n )α - A n-2 }(A n-1 - C n-1 α) - (B n α + B n-2 )(A n-1 - C n-1 α) 2 = 0 (104) The coefficient of α 4 vanishes, therefore α satisfies an equation that is at most of degree three. Lemma 12. α n+1 (α n β n 1) = (α n+1 β n+1 1) a n b n Proof: R. H. S. = ((α n+1 a n + β n+1 ) (α n+1 b n + 1) α n+1 ) = α n+1 ((a n + β n+1 /α n+1 ) (b n + 1/α n+1 ) 1 ) = α n+1 ( α n β n 1 ) = L. H. S. Cor 1: α n+1 µ n T = µ n+1 T R n where µ n = (α n β n 1) T, (α n, β n ) = [{a n, a n+1,..},{b n, b n+1,..}], a n b n 1 R n = (105) Cor 2: µ 0 T = (µ 1 T R 0 )/α 1 = (µ 2 T R 1 R 0 )/(α 2 α 1 ) =.. = (µ n T R n-1 R n-2..r 0 )/(α n..α 1 ) or, µ 0 = (R 0 T R 1 T..R n-1 T µ n )/(α 1 α 2..α n ) (106) Cor 3: µ T n+1 = α n+1 µ T n R -1 n = α n+1 (α n β n 1) a n -b n Theorem 4. If the BCF expansion of (α, β) is eventually periodic then α satisfies a polynomial of degree at most three 5.
22 Proof: Let (α, β) = [{a 0, a 1,..,a n, a n+1, a n+2,.., a n+m, a n+1, a n+2,.., a n+m,.. }, {b 0, b 1,.b n, b n+1, b n+2,.. b n+m,, b n+1, b n+2,..b n+m,..}] (107) Then, (α n+1, β n+1 ) = [{a n+1, a n+2,.., a n+m, a n+1, a n+2,.., a n+m,.. }, {b n+1, b n+2,.. b n+m,, b n+1, b n+2,..b n+m,..}] (108) By Cor 2 of Lemma 12, we get, µ 0 T = (µ n+1 T R n R n-1..r 0 )/(α n+1 α n..α 1 ) µ n+1 T = (µ n+1 T R n+m R n+m-1..r n+2 R n+1 )/(α n+1 α n+m α n+m-1..α n+2 ) (109) Hence, µ T 0 = (µ T 0 R -1 0 R R -1 n R n+m R n+m-1..r n+2 R n+1 R n R n-1..r 1 R 0 )/(α n+1 α n+m ) (110) This equation may be written as λ (α β 1) = (α β 1) M 11 M 12 M 13 M 21 M 22 M 23 M 31 M 32 M 33 (111) Hence, M 11 α + M 21 β + M 31 = λ α M 12 α + M 22 β + M 32 = λ β M 13 α + M 23 β + M 33 = λ (112) Thus, M 11 α + M 21 β + M 31 = (M 13 α + M 23 β + M 33 ) α (113) which implies β = {M 31 + (M 11 - M 33 )α - M 13 α 2 }/(M 23 α - M 21 ) (114) Also, M 12 α + M 22 β + M 32 = (M 13 α + M 23 β + M 33 ) β (115) so that
23 Therefore, M 32 + M 12 α + (M 22 - M 33 - M 13 α){m 31 + (M 11 - M 33 )α - M 13 α 2 }/(M 23 α - M 21 ) - M 23 {M 31 + (M 11 - M 33 ) α - M 13 α 2 } 2 /(M 23 α - M 21 ) 2 = 0 (116) (M 32 + M 12 α)(m 23 α - M 21 ) 2 + (M 22 - M 33 - M 13 α){m 31 + (M 11 - M 33 ) α - M 13 α}(m 23 α - M 21 ) - M 23 {M 31 + (M 11 - M 33 ) α - M 13 α 2 } 2 = 0 (117) The coefficient of α 4 vanishes. Therefore α satisfies a polynomial of degree at most three. Conjecture: If α is a cubic irrational, there exists a cubic irrational β such that the BCF of (α, β) is eventually periodic. 4. Bibliography [1] Bifurcating Continued Fractions, A. K. Gupta and A. K. Mittal, LANL arxive math.gm/ [2] Continued Fractions, C. D. Olds. Mathematical Association of America Copyright 1963 by Yale University. [3] Continued Fractions and Chaos, R. Corless. [4] Cubic Variations of the Golden Mean, S. Finch. Copyright 1999 MathSoft Inc. [5] An outline of this proof was given (in a personal communication) by Prof. Thomas Garrity, Dept. of Mathematics, Williams College, Williamstown, MA USA 01267, tgarrity@williams.edu
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 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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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) =
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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.
Διαβάστε περισσότεραHomomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 :
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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)
Διαβάστε περισσότεραω ω ω ω ω ω+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 +
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (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
Διαβάστε περισσότεραMath 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCoefficient Inequalities for a New Subclass of K-uniformly Convex Functions
International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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).
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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(θ + θ)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραA General Note on δ-quasi Monotone and Increasing Sequence
International Mathematical Forum, 4, 2009, no. 3, 143-149 A General Note on δ-quasi Monotone and Increasing Sequence Santosh Kr. Saxena H. N. 419, Jawaharpuri, Badaun, U.P., India Presently working in
Διαβάστε περισσότεραLecture 21: Properties and robustness of LSE
Lecture 21: Properties and robustness of LSE BLUE: Robustness of LSE against normality We now study properties of l τ β and σ 2 under assumption A2, i.e., without the normality assumption on ε. From Theorem
Διαβάστε περισσότεραHomomorphism of Intuitionistic Fuzzy Groups
International Mathematical Forum, Vol. 6, 20, no. 64, 369-378 Homomorphism o Intuitionistic Fuzz Groups P. K. Sharma Department o Mathematics, D..V. College Jalandhar Cit, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCommutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
Διαβάστε περισσότερα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
Διαβάστε περισσότεραDIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS
GANIT J. Bangladesh Math. oc. IN 606-694) 0) -7 DIRECT PRODUCT AND WREATH PRODUCT OF TRANFORMATION EMIGROUP ubrata Majumdar, * Kalyan Kumar Dey and Mohd. Altab Hossain Department of Mathematics University
Διαβάστε περισσότεραMain source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1
Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a
Διαβάστε περισσότερα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,...,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραGenerating Set of the Complete Semigroups of Binary Relations
Applied Mathematics 06 7 98-07 Published Online January 06 in SciRes http://wwwscirporg/journal/am http://dxdoiorg/036/am067009 Generating Set of the Complete Semigroups of Binary Relations Yasha iasamidze
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότερα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 θ
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότεραJordan Journal of Mathematics and Statistics (JJMS) 4(2), 2011, pp
Jordan Journal of Mathematics and Statistics (JJMS) 4(2), 2011, pp.115-126. α, β, γ ORTHOGONALITY ABDALLA TALLAFHA Abstract. Orthogonality in inner product spaces can be expresed using the notion of norms.
Διαβάστε περισσότεραMean-Variance Analysis
Mean-Variance Analysis Jan Schneider McCombs School of Business University of Texas at Austin Jan Schneider Mean-Variance Analysis Beta Representation of the Risk Premium risk premium E t [Rt t+τ ] R1
Διαβάστε περισσότεραPg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is
Pg. 9. The perimeter is P = The area of a triangle is A = bh where b is the base, h is the height 0 h= btan 60 = b = b In our case b =, then the area is A = = 0. By Pythagorean theorem a + a = d a a =
Διαβάστε περισσότεραCHAPTER 101 FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD
CHAPTER FOURIER SERIES FOR PERIODIC FUNCTIONS OF PERIOD EXERCISE 36 Page 66. Determine the Fourier series for the periodic function: f(x), when x +, when x which is periodic outside this rge of period.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα1. Introduction and Preliminaries.
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:1 (2008), 97 106 ON δ SETS IN γ SPACES V. Renuka Devi and D. Sivaraj Abstract We
Διαβάστε περισσότεραF19MC2 Solutions 9 Complex Analysis
F9MC Solutions 9 Complex Analysis. (i) Let f(z) = eaz +z. Then f is ifferentiable except at z = ±i an so by Cauchy s Resiue Theorem e az z = πi[res(f,i)+res(f, i)]. +z C(,) Since + has zeros of orer at
Διαβάστε περισσότερα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
Διαβάστε περισσότεραIntuitionistic Fuzzy Ideals of Near Rings
International Mathematical Forum, Vol. 7, 202, no. 6, 769-776 Intuitionistic Fuzzy Ideals of Near Rings P. K. Sharma P.G. Department of Mathematics D.A.V. College Jalandhar city, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότεραStrukturalna poprawność argumentu.
Strukturalna poprawność argumentu. Marcin Selinger Uniwersytet Wrocławski Katedra Logiki i Metodologii Nauk marcisel@uni.wroc.pl Table of contents: 1. Definition of argument and further notions. 2. Operations
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr (T t N n) Pr (max (X 1,..., X N ) t N n) Pr (max
Διαβάστε περισσότερα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
Διαβάστε περισσότεραSome new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.
Bol. Soc. Paran. Mat. (3s.) v. 30 2 (2012): 71 77. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v30i2.13793 Some new generalized topologies via hereditary
Διαβάστε περισσότερα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.
Διαβάστε περισσότεραBounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Διαβάστε περισσότερα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
Διαβάστε περισσότεραMA 342N Assignment 1 Due 24 February 2016
M 342N ssignment Due 24 February 206 Id: 342N-s206-.m4,v. 206/02/5 2:25:36 john Exp john. Suppose that q, in addition to satisfying the assumptions from lecture, is an even function. Prove that η(λ = 0,
Διαβάστε περισσότεραSolution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max
Διαβάστε περισσότεραExercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
Διαβάστε περισσότερα