A New Algebraic Method to Search Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p q )
|
|
- Λυσιστράτη Παπάγος
- 5 χρόνια πριν
- Προβολές:
Transcript
1 A New Algebraic Method to Search Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p q ) Sankhanil Dey and Ranjan Ghosh 2 Institute of Radio Physics and Electronics University of Calcutta, 92 A. P. C. Road, Kolkata sankhanil2009@gmail.com, 2 rghosh47@yahoo.co.in Abstract. Irreducible polynomials play an important role till now, in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental polynomials of a monic irreducible polynomial over Galois Field GF(2 8 ) []. In this paper a new method to search monic Irreducible Polynomials (IPs) over Galois fields GF(p q ) has been introduced. Here the decimal equivalents of each monic elemental polynomial (ep), two at a time, are split into the p-nary coefficients of each term, of those two monic elemental polynomials. From those coefficients the p-nary coefficients of the resultant monic basic polynomials (BP) have been obtained. The decimal equivalents of resultant basic polynomials with p-nary coefficients are treated as decimal equivalents of the monic reducible polynomials, since monic reducible polynomials must have two monic elemental polynomials as its factor. The decimal equivalents of polynomials belonging to the list of reducible polynomials are cancelled leaving behind the monic irreducible polynomials. A non-monic irreducible polynomial is computed by multiplying a monic irreducible polynomial by α where α GF(p q ) and assumes values from 2 to (p-). General Terms: Algorithms, Irreducible polynomial. Keywords: Finite field, Galois field, Irreducible polynomials, Decimal Equivalents.. Introduction: A basic polynomial BP(x) over finite field or Galois Field GF(p q ) is expressed as, BP(x) = a q x q + a q- x q a x + a 0. B(x) has (q+) terms, where a q is non-zero and is termed as the leading coefficient [2]. A polynomial is monic if a q is unity, else it is non-monic. The GF(p q ) have (p q p) elemental polynomials ep(x) ranging from p to (p q -) each of whose representation involves q terms with leading coefficient a q. The expression of ep(x) is written as, ep(x) = a q- x q a x + a 0, where a to a q- are not simultaneously zero. Many of BP(x), which has an elemental polynomial as a factor under GF(p q ), are termed as reducible. Those of the BP(x) that have no factors are termed as irreducible polynomials IP(x) [3][4] and is expressed as, IP(x) = a q x q + a q- x q a x + a 0, where a q 0. In Galois field GF(p q ), the decimal equivalents of the basic polynomials of extension q vary from p q to (p q+ - ) while the elemental polynomials are those with decimal equivalents varying from p to (p q ). Some of the monic basic polynomials are irreducible, since it has no monic elemental polynomial as a factor. The method in this paper is to look for the decimal equivalents of the reducible polynomials with multiplication, addition and modulus, of the p-nary coefficients of each term of each two monic elemental polynomials to obtain the decimal equivalent of the p- nary coefficients of each term of the resultant monic basic polynomial. The resultant monic basic polynomials are termed as reducible polynomials, since it is the product of two monic elemental polynomials. The polynomials belonging to the list of reducible polynomials are cancelled leaving behind the monic irreducible polynomials. A non-monic irreducible polynomial is computed by multiplying a monic irreducible polynomial by α where α GF(p) and assumes values from 2 to (p-). In literatures, to the best knowledge of the present authors, there is no
2 mention of a paper in which the composite polynomial method is translated into an algorithm and in turn into a computer program. Since 967 researchers took algorithmic initiatives, followed by computational time-complexity analysis, to factorize basic polynomials on GF(p q ) with a view to get irreducible polynomials, many of them are probabilistic [5][6][7][8] in nature and few of them are deterministic [9][0]. One may note that the deterministic algorithms are able to find all irreducible polynomials, while the probabilistic ones are able to find many, but not all. The irreducible polynomial over GF(2 8 ) was first used in cryptography for designing an invertible 8-bit S-Box of AES [][2][3]. The technique involves finding all multiplicative inverses under an irreducible polynomial is available in [4][5][6][7]. For convenient understanding, the proposed algebraic method is presented in Sec. 2 for p=7 with q=7. The method can find all monic and non-monic irreducible polynomials IP(x) over GF(7 7 ). Sec. 3 is demonstrates the obtained results to show that the proposed searching algorithm is actually able to search for any extension of the Galois field with any prime of GF(p q ), where p= 3, 5, 7,...,0,..,p and q= 2, 3, 5, 7,,0,.q. In Sec.4 and 5, the conclusion of the paper and the references are illustrated. A sample list of the decimal equivalents of the monic irreducible polynomials over Galois Field GF(7 7 ) is given in Appendix. 2 Algebraic method to find Irreducible Polynomials over GF(p q ) The basic idea of the algebraic method is to split the decimal equivalents of each monic elemental polynomial of a monic Basic Polynomial, any two at a time, into p-nary coefficients of each term of those monic elemental polynomials. Then multiply the p-nary coefficients to obtain each coefficients of the term with equal degree of each term of monic basic polynomials. All the multiplied results are then added to obtain the decimal coefficients of each term of the resultant monic basic polynomial. The decimal coefficients of each term of resultant monic basic polynomial are then reduced to p-nary coefficients of each term of that polynomial. The decimal equivalents of resultant monic basic polynomials with p-nary coefficients of each term are the decimal equivalents of the monic reducible polynomials since it has two monic elemental polynomials as its factor. The polynomials belonging to the list of monic reducible polynomials are cancelled leaving behind the monic irreducible polynomials. A non-monic irreducible polynomial is computed by multiplying a monic irreducible polynomial by α where α GF(p) and assumes values from 2 to (p-). The algebraic method to find the monic Irreducible polynomial over GF(7 7 ) is demonstrated in section 2.2 and the extension to any Galois Field GF(p q ) is described in section 2.2. The general method to develop each block of the algorithm of the algebraic method is demonstrated in section 2.3. The pseudo code for the above algebraic method is described in section Algebraic method to find Irreducible Polynomials over Galois Field GF(7 7 ). Here the interest is to find the monic irreducible polynomials over Galois Field or GF(7 7 ).where p=7 is the prime field and q=7 is the extension of that prime field. Since the indices of multiplicand and multiplier are added to obtain the product. The extension q=7 can be demonstrated as a sum of two integers d and d 2, The degree of highest degree term present in elemental polynomials of GF(7 7 ) is (q-) = 6 to, since the polynomials with highest degree of term 0, are constant polynomials and they do not play any significant role here, so they are neglected. Hence the two set of monic elemental polynomials for which the multiplication is a monic basic polynomial where p=7, q=7, have the degree of highest degree terms d, d 2 where, d =,2,3, and the corresponding values of d 2 are, 6,5,4. Number of coefficients in the monic basic polynomial BP = (q+) = (7+) = 8; they are defined as BP 0, BP, BP 2, BP 3, BP 4, BP 5, BP 6, BP 7, the value of the suffix also indicates the degree of the term of the monic basic polynomial. For monic polynomials BP 7 =. Total number of blocks is the number of integers in d or d 2, i.e. 3 for this case.
3 Coefficients of each term in the st monic elemental polynomial EP 0 where, d =; are defined as EP 0 0, EP 0. Coefficients of each term in the 2 nd monic elemental polynomial EP where d 2 =6; are defined as EP 0, EP, EP 2, EP 3, EP 4, EP 5, EP 6.The value in suffix also gives the degree of the term of the monic elemental polynomials. Now, the algebraic method is as follows, st block: BP 0 = (EP 0 0 * EP 0 ) %7. BP = (EP 0 0 * EP + EP 0 * EP 0 ) %7. BP 2 = (EP 0 0 * EP 2 + EP 0 * EP ) %7. BP 3 = (EP 0 0 * EP 3 + EP 0 * EP 2 ) %7. BP 4 = (EP 0 0 * EP 4 + EP 0 * EP 3 ) %7. BP 5 = (EP 0 0 * EP 5 + EP 0 * EP 4 ) %7. BP 6 = (EP 0 0 * EP 6 + EP 0 * EP 5 ) %7. BP 7 = (EP 0 * EP 6 ) %7 =. Now the given basic monic polynomial is, BP(x) = BP 7 x 7 + BP 6 x 6 + BP 5 x 5 + BP 4 x 4 + BP 3 x 3 + BP 2 x 2 + BP x + BP 0 x 0. Decm_eqv(BP(x))= BP 7 * BP 6 * BP 5* BP 4 * BP 3 * BP 2 * BP * 7 + BP 0 * 7 0. Coefficients of each term in the st elemental monic polynomial EP where,d =2; are defined as EP 0, EP, EP 0 2. Coefficients of each term in the 2 nd elemental monic polynomial EP where d 2 =5; are defined as EP 0, EP, EP 2, EP 3, EP 4, EP 5.The value in suffix also gives the degree of the term of the monic elemental polynomials. Now, the algebraic method is as follows, 2 nd block: BP 0 = (EP 0 0 * EP 0 ) %7. BP = (EP 0 0 * EP + EP 0 * EP 0 ) %7. BP 2 = (EP 0 0 * EP 2 + EP 0 * EP + EP 0 2 * EP 0 ) %7. BP 3 = (EP 0 0 * EP 3 + EP 0 * EP 2 + EP 0 2 * EP ) %7. BP 4 = (EP 0 0 * EP 4 + EP 0 * EP 3 + EP 0 2 * EP 2 ) %7. BP 5 = (EP 0 0 * EP 5 + EP 0 * EP 4 + EP 0 2 * EP 3 ) %7. BP 6 = (EP 0 * EP 5 + EP 0 2 * EP 4 ) %7. BP 7 = (EP 0 2 * EP 5 ) %7=. Now the given basic monic polynomial is, BP(x) = BP 7 x 7 + BP 6 x 6 + BP 5 x 5 + BP 4 x 4 + BP 3 x 3 + BP 2 x 2 + BP x + BP 0 x 0. Decm_eqv(BP(x))= BP 7 * BP 6 * BP 5* BP 4 * BP 3 * BP 2 * BP * 7 + BP 0 * 7 0. Coefficients of each term in the st monic elemental polynomial EP 0 0 where, d =3; are defined as EP 0, EP 0 0 0,EP 2, EP 3, Coefficients of each term in the 2 nd monic elemental polynomial EP where d 2 =4; are defined as EP 0, EP, EP 2, EP 3, EP 4. The value in suffix also gives the degree of the term of the monic elemental polynomials. Now, the algebraic method is as follows, 3 rd block: BP 0 = (EP 0 0 * EP 0 ) %7. BP = (EP 0 0 * EP + EP 0 * EP 0 ) %7. BP 2 = (EP 0 0 * EP 2 + EP 0 * EP + EP 0 2 * EP 0 ) %7. BP 3 = (EP 0 0 * EP 3 + EP 0 * EP 2 + EP 0 2 * EP + EP 0 3 * EP 0 ) %7. BP 4 = (EP 0 0 * EP 4 + EP 0 * EP 3 + EP 0 3 * EP + EP 0 2 * EP 2 ) %7. BP 5 = (EP 0 * EP 4 + EP 0 2 * EP 3 + EP 0 3 * EP 2 ) %7. BP 6 = (EP 0 2 * EP 4 + EP 0 3 * EP 3 ) %7. BP 7 = (EP 0 3 * EP 4 ) %7=. Now the given basic monic polynomial is,
4 BP(x) = BP 7 x 7 + BP 6 x 6 + BP 5 x 5 + BP 4 x 4 + BP 3 x 3 + BP 2 x 2 + BP x + BP 0 x 0. Decm_eqv(BP(x))= BP 7 * BP 6 * BP 5* BP 4 * BP 3 * BP 2 * BP * 7 + BP 0 * 7 0. In this way the decimal equivalents of all the monic basic polynomials or monic reducible polynomials are pointed out. The polynomials belonging to the list of reducible polynomials are cancelled leaving behind the irreducible polynomials. Non-monic irreducible polynomials are computed by multiplying a monic irreducible polynomial by α where α GF(p) and assumes values from 2 to General Algebraic method to find Irreducible Polynomials over Galois Field GF(p q ). Here the interest is to find the monic irreducible polynomials over Galois Field GF(p q ), where p is the prime field and q is the extension of the field. Since the indices of multiplicand and multiplier are added to obtain the product. The extension q can be demonstrated as a sum of two integers, d and d 2, The degree of highest degree term present in elemental polynomials of GF(p q ) is (q-) to, since the polynomials with highest degree of term 0, are constant polynomials and they do not play any significant role here, so they are neglected. Hence the two set of monic elemental polynomials for which the multiplication is a monic basic polynomial, have the degree of highest degree terms d, d 2 where, d =,2,3,..,(q/2-), and the corresponding values of d 2 are, (q-), (q-2), (q-3).,...,q-(q/2-). Number of coefficients in the monic basic polynomial BP = (q+); they are defined as BP 0, BP, BP 2, BP 3, BP 4, BP 5, BP 6, BP 7.., BP q, the value of the suffix also indicates the degree of the term of the monic basic polynomial. For monic polynomials BP q =. Coefficients of each term in the st monic elemental polynomial EP 0, where, d =,2,..,(q/2-); are defined as EP 0 0, EP 0,., EP (q/2-) 0. Coefficients of each term in the 2 nd monic elemental polynomial EP where d 2 = (q-), (q-2), (q-3).,...,q-(q/2-); are defined as EP 0, EP, EP 2, EP 3, EP 4,, EP q-(q/2-). The value in suffix also gives the degree of the term of the monic elemental polynomials. Total number of blocks is the number of integers in d or d 2, i.e. (q/2-) for this example. Now, the algebraic method for (q/2-) th block is as follows, (q/2-) th block: BP 0 = (EP 0 0 * EP 0 ) %p. BP = (EP 0 0 * EP + EP 0 * EP 0 ) %p. BP 2 = (EP 0 0 * EP 2 + EP 0 * EP + EP 0 2 * EP 0 ) %p. BP 3 = (EP 0 0 * EP 3 + EP 0 * EP 2 + EP 0 2 * EP + EP 0 3 * EP 0 ) %p. BP q- = (EP 0 0 * EP (q-) + EP 0 * EP (q-2) +.+ EP 0 (q/2-) * EP (q-)-(q/2-) ) %p. BP q = (EP 0 (q/2-) * EP q-(q/2-) ) %p. Now the given basic monic polynomial is, BP(x) = BP q x q + BP q- x q- +.+ BP 5 x 5 + BP 4 x 4 + BP 3 x 3 + BP 2 x 2 + BP x + BP 0 x 0. Decm_eqv(BP(x))= BP q * p q + BP q- * p q- +.+ BP 5* p 5 + BP 4 * p 4 + BP 3 * p 3 + BP 2 * p 2 + BP * p + BP 0 * p 0. Similarly all the decimal equivalents of all the resultant basic polynomials or reducible polynomials for all a and its corresponding b values are calculated. The polynomials belonging to the list of reducible polynomials are cancelled leaving behind the irreducible polynomials. Non-monic irreducible polynomials are computed by multiplying a monic irreducible polynomial by α where α GF(p) and assumes values from 2 to (p-). 2.3 General Method to develop each block of the Algorithm of the New Algebraic Method. Prime field: p Extension of the field: q. d =,2,3,,(q/2-). d 2= (q-), (q-2), (q-3).,...,q-(q/2-).
5 Number of terms in st elemental polynomial: N(d ). Number of terms in st elemental polynomial: N(d 2 ). Number of terms in Basic Polynomial: p. Coefficients of Basic polynomial= BP indx, where < indx <p Coefficients of Elemental polynomials = EP indx_i, where <i<2. Here, N(d ) = N(d 2 ) = Total number of blocks. Each coefficient of basic polynomial can be derived as follows, BP indx = (ΣEP indx_ p +EP indx_2 p2 ) % p.(i) where< indx <p, <indx<(q/2-),(q-)>indx2> q-(q/2-). 0<p<N(d)-, 0<p2<N(d2)-, and indx = indx+indx Pseudo code: The pseudo code of the (q/2-) th block of above algebraic code for Galois Field GF(p q ) is described as follows, where ep[0] and ep[] are the arrays of all possible decimal equivalents of st and 2 nd monic elemental polynomials respectively. EP 0, EP are the arrays consists of P-nary coefficients of st and 2 nd monic elemental polynomials respectively. BP is the array consists of P-nary coefficients of the resultant monic basic polynomial. Decm_eqv(BP(x)) is the decimal equivalent of the resultant monic basic polynomial. ` for(ep[0]=p..p q/2-,ep[]=p q- p q-(q/2-) ;ep[0]<2*p..p q/2-,ep[0]<2*p q- p q-(q/2-) ;ep[0]++,ep[]++){ for(indx[0]=ep[0];indx[0]<2*ep[0];indx[0]++){ coeff_conv_st_deg (indx[0],ep 0 ); for(indx[]=ep[];indx[]<2*ep[];indx[]++){ coeff_conv_2nd_deg (indx[], EP ); BP 0 = (EP 0 0 * EP 0 ) %p; BP = (EP 0 0 * EP + EP 0 * EP 0 ) %p; BP 2 = (EP 0 0 * EP 2 + EP 0 * EP + EP 0 2 * EP 0 ) %p; BP 3 = (EP 0 0 * EP 3 + EP 0 * EP 2 + EP 0 2 * EP + EP 0 3 * EP 0 ) %p; BP q- = (EP 0 0 * EP (q-) + EP 0 * EP (q-2) +.+ EP 0 (q/2-) * EP (q-)-(q/2-) ) %p; BP q = (EP 0 (q/2-) * EP q-(q/2-) ) %p; BP(x) = BP q x q + BP q- x q- +.+ BP 5 x 5 + BP 4 x 4 + BP 3 x 3 + BP 2 x 2 + BP x + BP 0 x 0 ; Decm_eqv(BP(x))= BP q * p q + BP q- * p q- +.+ BP 5* p 5 + BP 4 * p 4 + BP 3 * p 3 + BP 2 * p 2 + BP * p + BP 0 * p 0 ; indx[2]++; End for. End for. End for 3. Results. The algebraic method or the above pseudo code has been tested on GF(7 3 ),GF( 3 ), GF(0 3 ) and GF(7 5 ). Numbers of monic Irreducible polynomials are same as in hands on as well as previous calculations [8]. The list of Numbers of monic irreducible polynomials are given below for the above four Extended Galois Fields. The list of all Irreducible monic basic polynomials of four extended Galois fields are available in reference [9][20][2][22]. The Sample list of monic Irreducible Polynomial over GF(7 7 ) is given in Appendix and also available in the link given[23]. GF GF(7 3 ) GF( 3 ) GF(0 3 ) GF(7 5 ) Number of IP
6 4. Conclusion. To the best knowledge of the present authors, there is no mention of a paper in which the composite polynomial method is translated into an algorithm and turn into a computer program. The new algebraic method is a much simpler method similar to composite polynomial method to find monic irreducible polynomials over Galois Field GF(p q ). It is able to determine decimal equivalents of the monic irreducible polynomials over Galois Field with a larger value of prime, also with large extensions. So this method can reduce the complexity to find monic Irreducible Polynomials over Galois Field with large value of prime and also with large extensions of the prime field. So this would help the crypto community to build S-Boxes or ciphers using irreducible polynomials over Galois Fields with a large value of prime, also with the large extensions of the prime field. 5. References. [] Canright, D, A very Compact S-box for AES, Link: [2] Lidl, R, Niederreiter, H, Finite Fields, Encyclopedia of Mathematics and its Applications, Vol. 20, Addison-Wesley Publishing Company, 983. [3] Church, R, Tables of Irreducible Polynomials for the first four Prime Moduli, Annals of Mathematics, Vol. 36(), pp , January, 935. [4] Chebolu, S,K, and Minac, J., Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle, Math. Mag., Vol. 84(5), pp , 20. [5] Berlekamp, E, R, Factoring Polynomial over finite fileds, Bell Syst. Tech. J., Vol. 46, pp , 967. [6] Adleman, L,M and Lenstra, H,W, Finding irreducible polynomials over finite fields, Proc. 8th ACM Conf. on The Theory of Computing, Berkeley, CA, pp , 986. [7] Cantor, D,G, On Arithmetical Algorithms over Finite Fields J. Combinatorial Theory Series A 9, pp (989). [8] Bach, E and Shoup, V, Factoring Polynomials using Random Bits, J. Symbolic Computation, Vol 9, pp , 990. [9] Berlekamp, E, R, Factoring Polynomial over large finite fileds, Math. Comput. Vol. 24 (), pp , 970. [0] Shoup, V, New algorithms for finding irreducible polynomials in finite fields, Math. Comput. Vol. 54, pp , 990. [] Daemen, J, Rijmen, V, AES Proposal: Rijndael, AES Algorithm Submission, September 3, 999. [2] FIPS Pub. 97, Announcing the Advanced Encryption Standard (AES), November 26, 200. [3] Stinson, D.R, Cryptography Theory and Practice (Boca Raton, Chapman & Hall, CRC, 3rd Edition, 2006). [4] Stallings, W, Cryptography and Network Security Principles and Practices, Delhi, Pearson Education, 4th Edition, [5] Forouzan, B.A, Mukhopadhyay D., Cryptography and Network Security, New Delhi, TMH, 2nd Edition, 20. [6] Hasan, M.A, Double-Basis Multiplicative Inversion Over GF(2m), IEEE Trans. Comp., Vol. 47,(9), pp , 998. [7] Arguello, F, Lehmer-based algorithm for computing inverses in Galois fields GF(2m), Electronics Letters, Vol. 42(5), [8] Zaman, J, K, M, Sadique, Uz, Dey, Sankhanil, Ghosh, Ranjan, An Algorithm to find the Irreducible Polynomials over Galois Field GF(p m ), International Journal of Computer Applications ( ,) Volume 09 No. 5, January 205,pp [9] Dey, Sankhanil The list of Decimal Equivalents of All the Monic Irreducible Polynomials over Galois Field GF(7^3), Link: [20] Dey, Sankhanil The list of Decimal Equivalents of All the Monic Irreducible Polynomials over Galois Field GF(^3), Link: 3_. [2] Dey, Sankhanil The list of Decimal Equivalents of All the Monic Irreducible Polynomials over Galois Field GF(0^3), Link: [22] Dey, Sankhanil The list of Decimal Equivalents of All the Monic Irreducible Polynomials over Galois Field GF(7^5), Link: [23] Dey, Sankhanil The Sample list of Decimal Equivalents of the Monic Irreducible Polynomials over Galois Field GF(7^7), Link: _GF_7_7_.
7 Appendi A sample list of Decimal Equivalents of Monic Irreducible Polynomials over Galois Field GF(7 7 ) is given below
8
9
10
11
12
13
14
15
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
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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) =
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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. 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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραAppendix to On the stability of a compressible axisymmetric rotating flow in a pipe. By Z. Rusak & J. H. Lee
Appendi to On the stability of a compressible aisymmetric rotating flow in a pipe By Z. Rusak & J. H. Lee Journal of Fluid Mechanics, vol. 5 4, pp. 5 4 This material has not been copy-edited or typeset
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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(θ + θ)
Διαβάστε περισσότερα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
Διαβάστε περισσότεραStrain gauge and rosettes
Strain gauge and rosettes Introduction A strain gauge is a device which is used to measure strain (deformation) on an object subjected to forces. Strain can be measured using various types of devices classified
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραJordan Form of a Square Matrix
Jordan Form of a Square Matrix Josh Engwer Texas Tech University josh.engwer@ttu.edu June 3 KEY CONCEPTS & DEFINITIONS: R Set of all real numbers C Set of all complex numbers = {a + bi : a b R and i =
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΑΚΑ ΗΜΙΑ ΕΜΠΟΡΙΚΟΥ ΝΑΥΤΙΚΟΥ ΜΑΚΕ ΟΝΙΑΣ ΣΧΟΛΗ ΜΗΧΑΝΙΚΩΝ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ
ΑΚΑ ΗΜΙΑ ΕΜΠΟΡΙΚΟΥ ΝΑΥΤΙΚΟΥ ΜΑΚΕ ΟΝΙΑΣ ΣΧΟΛΗ ΜΗΧΑΝΙΚΩΝ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΘΕΜΑ :ΤΥΠΟΙ ΑΕΡΟΣΥΜΠΙΕΣΤΩΝ ΚΑΙ ΤΡΟΠΟΙ ΛΕΙΤΟΥΡΓΙΑΣ ΣΠΟΥ ΑΣΤΡΙΑ: ΕΥΘΥΜΙΑ ΟΥ ΣΩΣΑΝΝΑ ΕΠΙΒΛΕΠΩΝ ΚΑΘΗΓΗΤΗΣ : ΓΟΥΛΟΠΟΥΛΟΣ ΑΘΑΝΑΣΙΟΣ 1 ΑΚΑ
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότερα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.
Διαβάστε περισσότεραOn a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 +
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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
Διαβάστε περισσότεραω ω ω ω ω ω+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 +
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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 :
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΑναερόβια Φυσική Κατάσταση
Αναερόβια Φυσική Κατάσταση Γιάννης Κουτεντάκης, BSc, MA. PhD Αναπληρωτής Καθηγητής ΤΕΦΑΑ, Πανεπιστήµιο Θεσσαλίας Περιεχόµενο Μαθήµατος Ορισµός της αναερόβιας φυσικής κατάστασης Σχέσης µε µηχανισµούς παραγωγής
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραTMA4115 Matematikk 3
TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΕργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 7 ο
Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων Εξάμηνο 7 ο Procedures and Functions Stored procedures and functions are named blocks of code that enable you to group and organize a series of SQL and PL/SQL
Διαβάστε περισσότεραΚΒΑΝΤΙΚΟΙ ΥΠΟΛΟΓΙΣΤΕΣ
Ανώτατο Εκπαιδευτικό Ίδρυμα Πειραιά Τεχνολογικού Τομέα Τμήμα Ηλεκτρονικών Μηχανικών Τ.Ε. ΚΒΑΝΤΙΚΟΙ ΥΠΟΛΟΓΙΣΤΕΣ Πτυχιακή Εργασία Φοιτητής: ΜIΧΑΗΛ ΖΑΓΟΡΙΑΝΑΚΟΣ ΑΜ: 38133 Επιβλέπων Καθηγητής Καθηγητής Ε.
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 24/3/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Όλοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα μικρότεροι του 10000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Αν κάπου κάνετε κάποιες υποθέσεις
Διαβάστε περισσότερα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) =
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCorrection Table for an Alcoholometer Calibrated at 20 o C
An alcoholometer is a device that measures the concentration of ethanol in a water-ethanol mixture (often in units of %abv percent alcohol by volume). The depth to which an alcoholometer sinks in a water-ethanol
Διαβάστε περισσότεραAdvanced Subsidiary Unit 1: Understanding and Written Response
Write your name here Surname Other names Edexcel GE entre Number andidate Number Greek dvanced Subsidiary Unit 1: Understanding and Written Response Thursday 16 May 2013 Morning Time: 2 hours 45 minutes
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραPhysical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.
B-Trees Index files can become quite large for large main files Indices on index files are possible 3 rd -level index 2 nd -level index 1 st -level index Main file 1 The 1 st -level index consists of pairs
Διαβάστε περισσότεραRight Rear Door. Let's now finish the door hinge saga with the right rear door
Right Rear Door Let's now finish the door hinge saga with the right rear door You may have been already guessed my steps, so there is not much to describe in detail. Old upper one file:///c /Documents
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραdepartment listing department name αχχουντσ ϕανε βαλικτ δδσϕηασδδη σδηφγ ασκϕηλκ τεχηνιχαλ αλαν ϕουν διξ τεχηνιχαλ ϕοην µαριανι
She selects the option. Jenny starts with the al listing. This has employees listed within She drills down through the employee. The inferred ER sttricture relates this to the redcords in the databasee
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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
Διαβάστε περισσότεραA summation formula ramified with hypergeometric function and involving recurrence relation
South Asian Journal of Mathematics 017, Vol. 7 ( 1): 1 4 www.sajm-online.com ISSN 51-151 RESEARCH ARTICLE A summation formula ramified with hypergeometric function and involving recurrence relation Salahuddin
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα( ) 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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραModels for Probabilistic Programs with an Adversary
Models for Probabilistic Programs with an Adversary Robert Rand, Steve Zdancewic University of Pennsylvania Probabilistic Programming Semantics 2016 Interactive Proofs 2/47 Interactive Proofs 2/47 Interactive
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότεραΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ
ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΨΥΧΟΛΟΓΙΚΕΣ ΕΠΙΠΤΩΣΕΙΣ ΣΕ ΓΥΝΑΙΚΕΣ ΜΕΤΑ ΑΠΟ ΜΑΣΤΕΚΤΟΜΗ ΓΕΩΡΓΙΑ ΤΡΙΣΟΚΚΑ Λευκωσία 2012 ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ
Διαβάστε περισσότεραMock Exam 7. 1 Hong Kong Educational Publishing Company. Section A 1. Reference: HKDSE Math M Q2 (a) (1 + kx) n 1M + 1A = (1) =
Mock Eam 7 Mock Eam 7 Section A. Reference: HKDSE Math M 0 Q (a) ( + k) n nn ( )( k) + nk ( ) + + nn ( ) k + nk + + + A nk... () nn ( ) k... () From (), k...() n Substituting () into (), nn ( ) n 76n 76n
Διαβάστε περισσότεραΣυστήματα Διαχείρισης Βάσεων Δεδομένων
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Συστήματα Διαχείρισης Βάσεων Δεδομένων Φροντιστήριο 9: Transactions - part 1 Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Tutorial on Undo, Redo and Undo/Redo
Διαβάστε περισσότερα1 Advanced Encryption Standard (AES)
Date: Monday, September 24, 2002 Prof.: Dr Jean-Yves Chouinard Design of Secure Computer Systems CSI4138/CEG4394 Notes on the Advanced Encryption Standard (AES) 1 Advanced Encryption Standard (AES) 1.1
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραIIT JEE (2013) (Trigonomtery 1) Solutions
L.K. Gupta (Mathematic Classes) www.pioeermathematics.com MOBILE: 985577, 677 (+) PAPER B IIT JEE (0) (Trigoomtery ) Solutios TOWARDS IIT JEE IS NOT A JOURNEY, IT S A BATTLE, ONLY THE TOUGHEST WILL SURVIVE
Διαβάστε περισσότεραA Method for Creating Shortcut Links by Considering Popularity of Contents in Structured P2P Networks
P2P 1,a) 1 1 1 P2P P2P P2P P2P A Method for Creating Shortcut Links by Considering Popularity of Contents in Structured P2P Networks NARISHIGE Yuki 1,a) ABE Kota 1 ISHIBASHI Hayato 1 MATSUURA Toshio 1
Διαβάστε περισσότερα