Jump to content
Urch Forums

g.c. divisor (29)


marianha

Recommended Posts

(1) is clearly not sufficient.

 

Using (2)

=======

n=k+6 ==> two numbers are k+7 and k+6 i.e these are two consecutive integers.

For any two consecutive integers the GCM can only be 1.

Alternative explanation

=================

Also you can write 2 consecutive integers as p, p+1

Any factor of p when divides p+1 and the resultant is an integer can only happen when that factor is 1.

 

p/(factor) = some integer

 

(p+1)/(factor) = p/factor + 1/factor = some integer + 1/factor

1/factor can be integer only when factor is 1

 

Hence sufficient, (B).

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Reply to this topic...

×   Pasted as rich text.   Restore formatting

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

×
×
  • Create New...