GCD generator

Number Theory Level pending

Let R R be a subset of N × N \mathbb N \times \mathbb N defined as follows:

R = { ( a , b ) N × N : b R= \{ (a,b) \in \mathbb N \times \mathbb N: b is the lowest natural number with gcd ( b + 1 , 2 b + 1 ) = a } \gcd(b+1, 2b+1)=a\} .

For each ( a , b ) (a,b) , let A A denote ( a + b ) (a+b) . What is sum of all possible values of A A ?

Notations:


The answer is 2.

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.

1 solution

g c d ( b + 1 , 2 b + 1 ) = g c d ( b , b + 1 ) = 1 gcd(b+1,2b+1)=gcd(b,b+1)=1 as they are consecutive numbers.

So a=1 and b is the smallest natural number i.e 1.

So answer is 2.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...