Math 453 Homework 10: Solutions to Various Mathematical Problems, Assignments of Mathematics

Mathematical problems from math 453 homework 10, including finding integer and positive integer solutions to equations, proving statements about integers, and computing representations of numbers. Problems involve the pythagorean equation, diophantine equations, and primitive roots.

Typology: Assignments

Pre 2010

Uploaded on 03/10/2009

koofers-user-xi8
koofers-user-xi8 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 453 Homework 10 Due Wed., Nov. 28, 2007
Note the due date. This will count as a double assignment, but is actually about 1.5
times the length of recent assignments.
1. Strayer Ch.5 13. (This is easier than #18 or #19.)
2. Strayer Ch.5 30e.
3. Strayer Ch.5 37.
4. (E) Find all solutions to the equation 4x+ 10y= 42 ...
a. ... In integers (x, y).
b. ... In positive integers (x, y).
5. (E) Find a primitive solutions to the Pythagorean equation x2+y2=z2for which (a)
x= 453, (b) x= 2008. (You do not have to multiply out your expressions, but make sure
they are primitive.)
6. (E) If integers (x, y, z) satisfy the equation x2+ 5y2=z2, then at least one of {x, y, z}
is divisible by 3. (Hint: Your proof (by contradiction) could begin: “Suppose neither x
nor yis divisible by 3”
7. (E) If integers (x, y, z) satisfy the equation x2+ 5y2=z2, then it is not true that at
least one of {x, y, z }is divisible by 7. (Hint: find a counterexample.)
8. (E) Find one solution to the Diophantine equation 400x2+ 53y2= 400z2in p ositive
integers (x, y, z). Observe that (x, y, z) = (1,0,1) is a solution to the equation but not
to the problem, because 0 is not a positive integer. This problem can be done in several
ways; you’re only asked for one.
9. (E) Each of these statements is either true, with a short proof, or false, with a simple
counterexample.
a. If (x, y , z) is a primitive solution to the equation x2+y2=z2, then x+y+z|xy.
b. ord31(2) = 30.
c. There do not exist positive integers xand zso that x2+ 1412=z2. (No restriction is
placed on gcd(x, z).)
10. (E) If w2+x2+y2=z2for integers (w, x, y, z ), prove that 6 |wxyz. (Example:
22+ 32+ 62= 72.)
11. (E) Suppose that gis a primitive root for an odd prime p7 and neither g3nor g5is
a primitive root mod p. Prove that p1mod 30.
12. Using any correct method, compute [2007]2,[2007]3,[2007]5, the base 2, base 3 and
base 5 representations of the current year.
13. Determine the largest integer rso that (6!)rdivides 2007!. (Hint: 6! = 24325.)
14. (Free problem) Happy Thanksgiving!

Partial preview of the text

Download Math 453 Homework 10: Solutions to Various Mathematical Problems and more Assignments Mathematics in PDF only on Docsity!

Math 453 Homework 10 Due Wed., Nov. 28, 2007 Note the due date. This will count as a double assignment, but is actually about 1. times the length of recent assignments.

  1. Strayer – Ch.5 – 13. (This is easier than #18 or #19.)
  2. Strayer – Ch.5 – 30e.
  3. Strayer – Ch.5 – 37.
  4. (E) Find all solutions to the equation 4x + 10y = 42 ... a. ... In integers (x, y). b. ... In positive integers (x, y).
  5. (E) Find a primitive solutions to the Pythagorean equation x^2 + y^2 = z^2 for which (a) x = 453, (b) x = 2008. (You do not have to multiply out your expressions, but make sure they are primitive.)
  6. (E) If integers (x, y, z) satisfy the equation x^2 + 5y^2 = z^2 , then at least one of {x, y, z} is divisible by 3. (Hint: Your proof (by contradiction) could begin: “Suppose neither x nor y is divisible by 3”
  7. (E) If integers (x, y, z) satisfy the equation x^2 + 5y^2 = z^2 , then it is not true that at least one of {x, y, z} is divisible by 7. (Hint: find a counterexample.)
  8. (E) Find one solution to the Diophantine equation 400x^2 + 53y^2 = 400z^2 in positive integers (x, y, z). Observe that (x, y, z) = (1, 0 , 1) is a solution to the equation but not to the problem, because 0 is not a positive integer. This problem can be done in several ways; you’re only asked for one.
  9. (E) Each of these statements is either true, with a short proof, or false, with a simple counterexample. a. If (x, y, z) is a primitive solution to the equation x^2 + y^2 = z^2 , then x + y + z | xy. b. ord 31 (2) = 30. c. There do not exist positive integers x and z so that x^2 + 141^2 = z^2. (No restriction is placed on gcd(x, z).)
  10. (E) If w^2 + x^2 + y^2 = z^2 for integers (w, x, y, z), prove that 6 | wxyz. (Example: 22 + 3^2 + 6^2 = 7^2 .)
  11. (E) Suppose that g is a primitive root for an odd prime p ≥ 7 and neither g^3 nor g^5 is a primitive root mod p. Prove that p ≡ 1 mod 30.
  12. Using any correct method, compute [2007] 2 , [2007] 3 , [2007] 5 , the base 2, base 3 and base 5 representations of the current year.
  13. Determine the largest integer r so that (6!)r^ divides 2007!. (Hint: 6! = 2^432 5.)
  14. (Free problem) Happy Thanksgiving!