MTH 355 Lecture Notes - Lecture 19: Prime Factor, Xyy Syndrome

27 views2 pages

taupealpaca220

9 Mar 2019

School

Oregon State University

Department

Mathematics

Course

MTH 355

Professor

T. Schmidt

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

To prove this , we must show that. To do this , hxeir , it suffices to show that. Xei cx , a ) in other words x ax that is for r=x x et ar b) I r eir xe ar } since each. That is x e ar when r= x. , an ) is a list real numbers then of h. Recently you proved ( 2k -d= ri. A ) / c xn - y whenever. Y ) ( xty ) n =3. Cx - y ) goes into x3 how many times work way your through. Cx - b) gg , g) . Ant " ( x y ) h ( . , y ) x ( xn ) xofcx. = c y ) ( x ( x x t. Y ) y xyhtxyn ycyn ) xcxm-xbnitcxyn-ycy. net yn ) t y ( x is ) ex - b) c.

Related Questions

These questions are asking about subrgoups, groups, isormorphic.

actually, after 2day, I got a midterm for abstract math test,and I got a sample of midterm test, so I hope to get a solution ofall these question. I think it is a lot, but I hope that pleaseshow me the answer and I want to know why these answer is this.

The reason why these problems are bunch of questions, so I willgive big pts for this questions. thanks.

you guys can upload by the picture.

(below question)

SAMPLE MIDTERM 1, MATH 120A

(1) 1. Write the denition of group.

2. Give an example of a group of order 2011.

3. Give an example of a non-abelian group with 12 elements.

(2) Let (G,*) and (H . ) be groups.

1. Dene what it means for G and H to be isomorphic.

2. Assume that G has exactly two solutions to the equation x^2 =e.

Prove, directly from the denition in (1), that if G and H areiso-

morphic, then H has exactly two solutions to the equation x^2 =e.

3. Prove or disprove: (R, +) is isomorphic (R+, . ). Here R+ ={x is subset of R : x>0}.

4. Prove or disprove: (R, +) is isomorphic (R*, . ). Here R* ={x is subset of R : x is not 0}

(3) Let G be the group Z_20, with addition modulo 20.

1. Draw the subgroup diagram of G, giving a generator for eachsubgroup

2. Find the subgroup H =< 16 > of G.

3. Find a subgroup K of U_20 isomorphic to H.

(4) Let (G, . ) be a group and let H be a subgroup of H. Fix anelement a of

G and let K = { aha^-1 : h is subset of H}

1. Prove that K is a subgroup of G.

2. Prove that the map psi : H -> K, h -> aha^-1 isan isomorphism of groups.

(5) Let (G, . ) be a group and let a be an element of G.

1. Dene the order of a.

2. Give an example of an element of order 4 in GL(2,R).

3. Find the order of 16 in Z_20.

you must use matlab or octave program. others are not allowed T.T. please use only above the two program to get solution.

Problem 3: The Inverse Transformation Method A general method for simulating a RV having a continuous distribution called the inverse transformation method is based on the following result (see also Section 10.2 of the textbook and Quiz 2) Proposition 2.1. The Inverse Transformation Method). L UN U(0,1). For any continuous et distribution function F, X F-1(U) has distribution function F. (F-1(ar) is defined to equal that value y for which F(y) r.) In order to simulate X n Exp(1), for example, generate an U U(0,1) and let X log(1 -U) (see Quiz 2(c)). In fact, X log(U) is also Exp(1), since 1 U (0,1). Since X Exp(A) if X Exp(1) (why?), it follows that log(U)A has an Exp(1) distribution. This can be easily illustrated in Octave xi -log Grand (100,1)); 100 random samples from Exp (1) x2 -log (rand (100, 1))/2; 100 random samples from Exp(2) x3 -log Grand (100, 1))*2; 100 random samples from Exp(0.5) [mean (x1) mean(x2) mean (x3)] check their mean values In addition, Y X Gamma(n, A) if X Xn are i.i.d. Exp(A). Therefore, if Un are i.i.d. U(0, 1), log (Ui) 1 log Ui Gamma(n, A) (1) i-1 i-1 (a) Write an Octave code to generate 100 random samples from Gamma(10, A) by using the inverse transformation method (1). Let A 0.5, 1, 2. Plot histograms for the Gamma random samples. Octave also has a built-in gamma RV generator gamrnd (google it for reference!). Generate 100 random samples of Gamma(10, A) using gamrnd, make histograms, and compare two results. (b) As a function of U U(0, 1), create a new RV W with CDF F(w) 1 e-ti (w 0). (This is Quiz 2 (b).) Write an Octave code to generate 100 random samples of W F using the inverse transformation method (c) Consider a method for generating Weibull(a,B) RVs that have the following CDF F(z) exp(-ar 0 z oo, a Note that W in (b) is in fact Weibull(1,2). Write an Octave function myweibrnd.m that will generate n random samples for given parameters a and B. It should have the following format function CRJ myweibrnd n, alpha, beta) this function receives sample size n and parameters alpha and beta as input arguments and return R Ca vector of n random samples) (put your code here) Using your myweibrnd function, generate 1000 simulated values when (i) (a, B) (1,2) and (ii) (a,B) (2,1), respectively. Plot histograms and estimate their mean and variance

Show transcribed image text Problem 3: The Inverse Transformation Method A general method for simulating a RV having a continuous distribution called the inverse transformation method is based on the following result (see also Section 10.2 of the textbook and Quiz 2) Proposition 2.1. The Inverse Transformation Method). L UN U(0,1). For any continuous et distribution function F, X F-1(U) has distribution function F. (F-1(ar) is defined to equal that value y for which F(y) r.) In order to simulate X n Exp(1), for example, generate an U U(0,1) and let X log(1 -U) (see Quiz 2(c)). In fact, X log(U) is also Exp(1), since 1 U (0,1). Since X Exp(A) if X Exp(1) (why?), it follows that log(U)A has an Exp(1) distribution. This can be easily illustrated in Octave xi -log Grand (100,1)); 100 random samples from Exp (1) x2 -log (rand (100, 1))/2; 100 random samples from Exp(2) x3 -log Grand (100, 1))*2; 100 random samples from Exp(0.5) [mean (x1) mean(x2) mean (x3)] check their mean values In addition, Y X Gamma(n, A) if X Xn are i.i.d. Exp(A). Therefore, if Un are i.i.d. U(0, 1), log (Ui) 1 log Ui Gamma(n, A) (1) i-1 i-1 (a) Write an Octave code to generate 100 random samples from Gamma(10, A) by using the inverse transformation method (1). Let A 0.5, 1, 2. Plot histograms for the Gamma random samples. Octave also has a built-in gamma RV generator gamrnd (google it for reference!). Generate 100 random samples of Gamma(10, A) using gamrnd, make histograms, and compare two results. (b) As a function of U U(0, 1), create a new RV W with CDF F(w) 1 e-ti (w 0). (This is Quiz 2 (b).) Write an Octave code to generate 100 random samples of W F using the inverse transformation method (c) Consider a method for generating Weibull(a,B) RVs that have the following CDF F(z) exp(-ar 0 z oo, a Note that W in (b) is in fact Weibull(1,2). Write an Octave function myweibrnd.m that will generate n random samples for given parameters a and B. It should have the following format function CRJ myweibrnd n, alpha, beta) this function receives sample size n and parameters alpha and beta as input arguments and return R Ca vector of n random samples) (put your code here) Using your myweibrnd function, generate 1000 simulated values when (i) (a, B) (1,2) and (ii) (a,B) (2,1), respectively. Plot histograms and estimate their mean and variance

burgundywhale451

MTH 355 Lecture Notes - Lecture 19: Prime Factor, Xyy Syndrome

Document Summary

Get access

Related Documents

MTH 355 Lecture 10: 01302019

MTH 355 Lecture 6: 01182019

MTH 355 Lecture Notes - Lecture 9: Contraposition, Qi, Allied Irish Banks

Related Questions