Share
Explore BrainMass

Number Theory

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

Primitive numbers

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.

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.

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 ∫c P(z)/Q(z) dz for a suitable curve C).

Primitive polynomials

1) How do I show x+1 is primitive? 2) How do I prove x^4+x^3+1 is an irreducible polynomial of degree 4 over Z mod?

Legendre Polynomials

17. The first three Legendre polynomials are P0(x) =1 , P1(x) = x and P2(x)=1/2(3x^2-1). If x = cos θ, then P0(cos θ)=1 and P1(cos θ)= cos θ. Show that p2(cos θ)= 1/4(3 cos 2θ +1). Book:- Differential Equations, by Dennis G Zill, page ,number 17.

Abstract Algebra (4 year College)

I had to prove 4 theorems two of them dealt with Abelian elements, automorphism of R2 under compontentwise addition. I want to keep my original work in tack as possble BUT I would like the follwing corrections made based on the following comments. THESE ARE THE ISSUES THAT NEED TO BE ADDRESSED The paper needs to provide

Derivatives of Polynomials and Exponential Functions

Chapter 3.1 Derivatives of Polynomials and Exponential Functions. I don’t understand how to get the answers provided. Please explain this step by step. Differentiate each function. Y = X2 + 4X +3 V(t)=t2 – 1 Z= A + BeY √ (X) 4√(t3) Y10 Answer Y’=3

Synthetic Division, Functions, and Interest

A geologist you spoke with is concerned about the rate of land erosion around the base of a dam. Another geologist is studying the magma activity within the earth in an area of New Zealand known for its volcanic activity. One of the shortcuts they apply when doing calculations in the field is to use synthetic division. After t

Legendre equation

(See attached file for full problem description) The problem is solved by integration and evaluation between the limits and algebraic manipulation