Maths Olympiad Prep

Library / /23 of 30

, 2015

Number theory Difficulty 4.1 AIME Prove it Canada

If n+5n+5 is an even integer, state whether the integer nn is even or odd.
If cc and dd are integers, explain why cd(c+d)cd(c+d) is always an even integer.
Determine the number of ordered pairs (e,f)(e,f) of positive integers where

e<fe<f,
e+fe+f is odd, and
ef=300ef=300.

Determine the number of ordered pairs (m,n)(m,n) of positive integers such that (m+1)(2n+m)=9000(m+1)(2n+m)=9000.

Solution

Since 55 is an odd integer, then nn must be an odd integer for the sum n+5n+5 to be an even integer.

(If nn was an even integer, then n+5n+5 would be the sum of an even integer and an odd integer, which is an odd integer.)
We first note that the product of an even integer and any other integers, even or odd, is always an even integer.

Let N=cd(c+d)N=cd(c+d).

If cc or dd is an even integer (or both cc and dd are even integers), then NN is the product of an even integer and some other integers and thus is even.

The only remaining possibility is that both cc and dd are odd integers.

If cc and dd are odd integers, then the sum c+dc+d is an even integer.

In this case, NN is again the product of an even integer and some other integers and so it is an even integer.

Therefore, for any integers cc and dd, cd(c+d)cd(c+d) is always an even integer.
Since ee and ff are positive integers so that ef=300ef=300, then we may begin by determining the factor pairs of positive integers whose product is 300.

Written as ordered pairs (x,y)(x,y) with x<yx<y, these are: (1,300),(2,150),(3,100),(4,75),(5,60),(6,50),(10,30),(12,25),(15,20).(1,300), (2,150), (3,100), (4,75), (5,60), (6,50), (10,30), (12,25), (15,20). It is also required that the sum e+fe+f be odd and so exactly one of ee or ff must be odd.

Therefore, the factor pairs whose sum is odd are: (1,300),(3,100),(4,75),(5,60),(12,25),(15,20).(1,300), (3,100), (4,75), (5,60), (12,25), (15,20). There are 6 ordered pairs (e,f)(e,f) satisfying the given conditions.
Since both mm and nn are positive integers, then 2n>12n>1 and so 2n+m>m+12n+m>m+1.

Let a=m+1a=m+1 and b=2n+mb=2n+m or a=2n+ma=2n+m and b=m+1b=m+1 so that ab=9000ab=9000.

We must first determine all factor pairs (a,b)(a,b) of positive integers whose product is 9000.

We begin by considering the parity (whether each is even or odd) of the factors aa and bb.

Since 2 is even, then 2n2n is even for all positive integers nn.

If mm is even then 2n+m2n+m is even since the sum of two even integers is even.

However if mm is even, then m+1m+1 is odd since the sum of an even integer and an odd integer is odd.

That is, if mm is even, then aa is odd and bb is even or aa is even and bb is odd.

We say that the factors aa and bb have different parity since one is even and one is odd.

If mm is odd then 2n+m2n+m is odd. If mm is odd then m+1m+1 is even.

That is, if mm is odd, then aa is even and bb is odd or aa is odd and bb is even and so the factors aa and bb have different parity for all possible values of mm.

Now we are searching for all factor pairs (a,b)(a,b) of positive integers whose product is 9000 with aa and bb having different parity.

Written as a product of its prime factors, 9000=23×32×539000=2^3\times3^2\times5^3 and so ab=23×32×53ab=2^3\times3^2\times5^3.

Since exactly one of aa or bb is odd, then one of them does not have a factor of 2 and so the other must have all factors of 2.

That is, either a=23r=8ra=2^3r=8r and b=sb=s, or a=ra=r and b=8sb=8s for positive integers rr and ss.

In both cases, ab=8rs=9000ab=8rs=9000 and so rs=90008=1125=3253rs=\frac{9000}{8}=1125=3^25^3.

We now determine all factor pairs (r,s)(r,s) of positive integers whose product is 1125.

These are (r,s)=(1,1125),(3,375),(5,225),(9,125),(15,75),(25,45)(r,s)=(1,1125),(3,375),(5,225),(9,125),(15,75),(25,45).

Therefore (a,b)=(8r,s)=(8,1125),(24,375),(40,225),(72,125),(120,75),(200,45)(a,b)=(8r,s)=(8,1125),(24,375),(40,225),(72,125),(120,75),(200,45), or (a,b)=(r,8s)=(1,9000),(3,3000),(5,1800),(9,1000),(15,600),(25,360)(a,b)=(r,8s)=(1,9000),(3,3000),(5,1800),(9,1000),(15,600),(25,360).

Since 2n+m>m+1>12n+m>m+1>1, then the pair (1,9000)(1,9000) is not possible.

This leaves 11 factor pairs (a,b)(a,b) such that ab=9000ab=9000 with aa and bb having different parity.

Each of these 11 factor pairs (a,b)(a,b) gives an ordered pair (m,n)(m,n).

To see this, let m+1m+1 equal the smaller of aa and bb, and let 2n+m2n+m equal the larger (since 2n+m>m+12n+m>m+1).

For example when (a,b)=(8,1125)(a,b)=(8,1125), then m+1=8m+1=8 or m=7m=7 and so 2n+m=2n+7=11252n+m=2n+7=1125 or 2n=11182n=1118 or n=559n=559.

That is, the factor pair (a,b)=(8,1125)(a,b)=(8,1125) corresponds to the ordered pair (m,n)=(7,559)(m,n)=(7,559) so that (m+1)(2n+m)=9000(m+1)(2n+m)=9000.

Each of the 11 pairs (a,b)(a,b) gives an ordered pair (m,n)(m,n) such that (m+1)(2n+m)=9000(m+1)(2n+m)=9000.

We determine the corresponding ordered pair (m,n)(m,n) for each (a,b)(a,b) in the table below (although this work is not necessary since we were only asked for the number of ordered pairs).

(a,b)\boldsymbol{(a,b)}
m+1\boldsymbol{m+1}
2n+m\boldsymbol{2n+m}
(m,n)\boldsymbol{(m,n)}

(8,1125)(8,1125)
8
1125
(7,559)(7,559)

(24,375)(24,375)
24
375
(23,176)(23,176)

(40,225)(40,225)
40
225
(39,93)(39,93)

(72,125)(72,125)
72
125
(71,27)(71,27)

(120,75)(120,75)
75
120
(74,23)(74,23)

(200,45)(200,45)
45
200
(44,78)(44,78)

(3,3000)(3,3000)
3
3000
(2,1499)(2,1499)

(5,1800)(5,1800)
5
1800
(4,898)(4,898)

(9,1000)(9,1000)
9
1000
(8,496)(8,496)

(15,600)(15,600)
15
600
(14,293)(14,293)

(25,360)(25,360)
25
360
(24,168)(24,168)

There are 11 ordered pairs (m,n)(m,n) of positive integers satisfying (m+1)(2n+m)=9000(m+1)(2n+m)=9000.

Want a route through all this instead of an archive? The track puts 2,444 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.