Explore BrainMass
Share

# Finite Element Method

### Determine which of the given strings are recognized by the given deterministic finite-state automaton.

Determine whether each of these strings is recognized by the given deterministic finite-state automaton (which is displayed in an attached .doc file): (a) 010 (b) 1101 (c) 1111110 (d) 010101010

### Finite Element Method Problem

Let F be a finite field. Show that every element of F is the sum of two squares. (hint: given , show that and each have more than elements. (See attached file for full problem description with proper symbols) ---

### Basis and Finite and Infinite Field Extensions

Find a basis for the extension of and also calculate We know already that is infinite. Give an example of fields and (with neither nor equal to ) such that: a) and are both infinite b) is infinite and is finite. (See attached file for full problem description with proper symbols) All gaps are Q,

### Newton's method approximation

Use Newton's method to approximate the x value of the point near x=3 of 2 functions 1. f(x) = 3 - x 2. g(x) = 1/(x^2) + 1 Do this problem for complete iterations to get an answer of about .001 of the real value hint let H(x) = f(x) - g(x)

### Repeat squaring method

What is the remainder if.... (See attached file for full problem description)

### Secant ( or Chord ) Method and Newton-Raphson Formula

Let f(x) = x^2 - x - 3 (a) Find the Newton-Raphson formula pk = g(pk-1). (b) Start with p0=1.6 and find p1,p2 and p3. (c) Start with p0=0.0 and find p1,p2, p3 and p4. What do you conjecture about this sequence.

### First Order Initial Value Problem: RK4 Method

Use the RK4 method, with a step size of h=0.5, to obtain an approximation... Please see the attached file for the fully formatted problem.

### Conjugacy Classes Non-Identity Elements

G is a finite group with elements a and b. Let the conjugacy classes of these elements be A and B respectively and suppose |A|^2, |B|^2 < |G|. Prove that there is a non-identity element x in G s.t. x commutes with both a and b.

### Test Binary Relations

Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity A) S = Q X p Y <-> ABS(X) <= ABS(Y) B) S = Z X p Y <-> x -y is an integral multiple of 3 C) S = N X P Y <-> X is odd D) S = Set of all squares in the place S1 p S2 <-> length of side of S1 = length of side S2 E)

### Finite-Element Method Description

Please see the attached files for full problem description. Using Finite-Element Methods, assuming that stiffness of each element is equal to f.

### It is dealing with finite automatons

(a)For each of the following languages over the unary alphabet {a}, construct a finite automaton accepting it. i. {a^2} ii. {a^2, a^3, a^4} (b) Let A be any finite nonempty subset of {a, a^2, a^3, a^4,...}. Is there always a finite automaton that accepts A?

### Wilson's Theorem : Cyclic Groups and Order of an Element

13.a) If G={g1,g1,....,gr} is an abelian group, show that g1,g2....gr equals the product of the elements of order 2. b) Prove Wilson's Theorem: If p is a prime then (p-1)! R (-1)(modp) note: R is a equivalence relation
{"ft_lang_label":"__label__en","ft_lang_prob":0.781925,"math_prob":0.9799995,"size":296,"snap":"2020-10-2020-16","text_gpt3_token_len":71,"char_repetition_ratio":0.14383562,"word_repetition_ratio":0.1,"special_character_ratio":0.27364865,"punctuation_ratio":0.06122449,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99926525,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-20T09:37:33Z\",\"WARC-Record-ID\":\"<urn:uuid:ad4bcf8b-5df4-48ee-a8db-02962f3baa55>\",\"Content-Length\":\"49197\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:71324dea-d0de-45ec-adfa-9f90b24fb2ee>\",\"WARC-Concurrent-To\":\"<urn:uuid:2ecbe886-cbd7-4361-b51e-f2967b688ed1>\",\"WARC-IP-Address\":\"65.39.198.123\",\"WARC-Target-URI\":\"https://brainmass.com/math/finite-element-method/pg2\",\"WARC-Payload-Digest\":\"sha1:Y6IYXTSK5U7NNVIUJVQNIVB2X2ZUA7AL\",\"WARC-Block-Digest\":\"sha1:ZEULDRIAXCWAMYIVB2SSNPWKEIVDJIWW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875144708.87_warc_CC-MAIN-20200220070221-20200220100221-00551.warc.gz\"}"}