Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2004 OIM Problems/Problem 3

Revision as of 16:27, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == Let <math>n</math> and <math>k</math> be positive integers such that either <math>n</math> is odd or <math>n</math> and <math>k</math> are even. Prove that there...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $n$ and $k$ be positive integers such that either $n$ is odd or $n$ and $k$ are even. Prove that there are integers $a$ and $b$ such that

\[gcd(a, n) = gcd(b, n) = 1, k = a + b\]

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2004_OIM_Problems/Problem_3&oldid=207481"