Practice Exam 3

Problem (1) Using Mathematical Induction prove,

Problem (2) Using Mathematical Induction prove,

Problem (3) Show that if is an integer, then divides

Problem (4) Show that the fourth power of every odd integer is of the form

Problem (5) Show that if is a prime number, then is composite.

Problem (6) Show that if is a perfect square and is prime, then

Problem (7) Show that and are relatively prime for all integers .

Problem (8) Show that if and are relatively prime integers, then 1 or 3.

Problem (9) Apply the Euclidean Algorithm to find

Problem (10) Apply the Euclidean Algorithm to find

Problem (11) Find the unique factorization of

Problem (12) Find the unique factorization of

Problem (13) Determine how many solutions to

Problem (14) Find all solutions to

Problem (15) Show that every integer of the form with is composite.

Problem (16) Apply the Euclidean Algorithm to solve Then find all solutions.

Problem (17) Show that if is an even integer and is an odd integer, then

• print this page
• pages linking here
• related pages

Cite this as:
Number Theory Practice 3
Published by Library of Math -- Online math organized by subject into topics.
Written by Smith, David A.
http://www.libraryofmath.com/number-theory-practice-3.html