Explore BrainMass

Explore BrainMass

    Number Theory

    Solve: Simplifying Polynomials

    Consider the following expression: Polynomial: (-5t^2 + 2t + 5) + (-8t^2 + 6t) - (9t^2 - 2t -3) Make sure to show all of your work.

    Algebraic Number Theory

    Problem 1: Prove that there are no integers x, y, and z such that x^2 +y^2 + z^2 = 999 Problem 2: Show that square root of 2 cubed is an irrational number. Problem 3: For each of the following pairs a and b, use the division algorithm to find quotient q and remainder r. (a) b=189, a=17

    Polynomials : Roots, Holes and Vertical Asymptotes

    #1: f(x)=(1x^3-18x^2+101x-168)/(1x^3-2x^2-41x+42) Find: All Roots:? All Holes:? All Vertical Asymptotes:? The answer to the 1st question is NOT 8 or -8. #2: f(x)= (-2x^3+37x^2-222x+432)/(1x^3+3x^2-64x-192) I need the roots: (I have two of them (9/2) and (6) but I need the third)? I need to know the hol

    Simplifying Polynomials and Collecting Like Terms

    Section 4.3 Collect like terms. 4 4 52. 3a - 2a + 2a + a Collect like terms and then arrange in descending order. 3 3 4 66. -1 + 5x - 3 - 7x + x + 5 Classify the polynomial as a monomial, binomial, trinomial, or none o

    Binary Representations and Prime Factors

    1- For n belongs to N (set of natural numbers) let B(n) denote the number of digits used in the binary representation of n. For example B(1) = 1; B(2) = 2; B(3) = 2; B(4) = 3: Find a closed formula for B(n) for an arbitrary n belongs to N. 2: Prove that if gcd(a, b) = d then a/d and b/d are relatively prime. 3- Find

    Theory of Numbers : Fibonacci Number

    Suppose that F1 = 1, F2 = 1, F3 =1, F4 = 3, F5 = 5, and in general Fn = Fn-1 + Fn-2 for n ≥ 3 ( Fn is called the nth Fibonacci number.) Prove that F1 + F2 + F3 +...+ Fn = F(n + 2) - 1

    Theory of Numbers - Primitive Root

    Assume that n is odd and a is a primitive root mod n. Let b be an integer with b ≡ a(mod n) and gcd (b, 2n) =1. Show that b is a primitive root mod 2n.

    Theory of numbers..

    Use Quadratic Congruences to evaluate the following fractions. See attached file for full problem description.

    Quadratic Congruences - Theory of Numbers

    Quadratic Congruences. See attached file for full problem description. Let p be an odd prime. Complete the proof of the question "For which odd primes p is LS(2, p) = 1?" by showing that if and that if .

    Irreducible Polynomials and Fields

    List all irreducible polynomial of degree 2, 3 and 4 over F22juu2332. Prove your assertion. Please see the attached file for the fully formatted problems.

    Fields and Polynomials

    List each of the 15 elements x, x^2,...,x^15 of F2[x]/<x^4 +x + 1> as polynomials of degree at most three over F22.j.uu2332 Please see the attached file for the fully formatted problems.

    Complex Polynomials, Roots and Residue Theory

    Let P(z) and Q(z) be complex polynomials of degree m and n respectively, such that Q(z) has distinct roots z1...zn. Assume that n >= m+2 . Prove that P(z1)/Q'(z1) +...+ P(zn)/Q'(zn) (hint: evaluate &#8747;c P(z)/Q(z) dz for a suitable curve C).