Art of Problem Solving

2016 UMO Problems/Problem 6: Difference between revisions

Timneh (talk | contribs)
Created page with "==Problem == == Solution == == See Also == {{UMO box|year=2016|num-b=5|after=Last Question}} [[Category:]]"
 
Timneh (talk | contribs)
No edit summary
 
Line 1: Line 1:
==Problem ==
==Problem ==


Find all positive integer pairs <math>(u,m)</math> such that <math>u + m^2</math> is divisible by <math>um-1</math>.




== Solution ==
== Solution ==
<math>(1,2),(1,3),(2,1),(2,2),(2,5),(3,1),(3,5),(5,2),(5,3)</math>


== See Also ==
== See Also ==
{{UMO box|year=2016|num-b=5|after=Last Question}}
{{UMO box|year=2016|num-b=5|after=Last Question}}


[[Category:]]
[[Category: Intermediate Number Theory Problems]]

Latest revision as of 03:21, 22 January 2019

Problem

Find all positive integer pairs $(u,m)$ such that $u + m^2$ is divisible by $um-1$.


Solution

$(1,2),(1,3),(2,1),(2,2),(2,5),(3,1),(3,5),(5,2),(5,3)$

See Also

2016 UMO (ProblemsAnswer KeyResources)
Preceded by
Problem 5
Followed by
Last Question
1 2 3 4 5 6
All UMO Problems and Solutions