How many positive integers
a
,
b
are there such that
2
a
+
1
is divisible by
2
b
−
1
Provided
b
≥
3
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
How did you get 2 a + 2 b = 2 b t ( 2 x + 1 ) ?
Isn't 2 a + 2 b = 2 b t + x + 2 b = 2 b t × 2 x + 2 b t ?
Log in to reply
I thought ahead of myself on that one, thanks for correcting it's now fixed!
@Xuming Liang Correct and nice solution
Problem Loading...
Note Loading...
Set Loading...
Since b = 1 always works, let b ≥ 2 .
Consider the sum of the two numbers: 2 a + 1 + 2 b − 1 = 2 a + 2 b = 2 b ( 2 a − b + 1 Since 2 b − 1 divides the LHS and not 2 b , therefore 2 b − 1 ∣ 2 a − b + 1 . We can continue this process until we get 2 b − 1 ∣ 2 a − b t + 1 = 2 x + 1 where a − b t = x and 0 < x < b (Note that if x = 0 then 2 b − 1 ∣ 2 which only works when b = 1 . This means 2 x + 1 ≥ 2 b − 1 ⇒ 2 b − 1 + 2 ≥ 2 b ⇒ 2 b − 2 + 1 = 2 b − 1 , so b = 2 is the only positive solution and since b ≥ 3 therefore 0 is the answer.