Quadratic
Source: Indian RMO 2004 Problem 3
February 28, 2006
quadraticsnumber theorygreatest common divisorrelatively primeinductionnumber theory with sequences
Problem Statement
Let and be the roots of the equation where is an odd integer. Let
Prove that
(A) is an integer
(B) gcd ( ) = 1 .