you know that and .

also you know that .

So as the smallest possible value. Just guessed and checked.

Results 1 to 5 of 5

- June 16th 2007, 09:05 PM #1

- Joined
- Oct 2006
- Posts
- 187
- Thanks
- 1

## HCF and LCM

n is an integer.

(n-2) is divisible by 3 and 5,

(n-3) is divisible by 8,

What is the smallest possible value of n??

My solution is the following:

(n-2)=15k, where k is an integer, since it is divisible by 3 and 5

So (n-3)=15k-1 is divisible by 8, k=1, 2, 3, ...

The smallest number k such that (n-3) is divisible by 8 is k=7 (*)

i.e. n=107

Is there any other ways to solve this without listing all the possible values of (n-3) in step (*) and determine

whether (n-3) is divisible by 8.

Because if the smallest k is very big, then I will have a long list of numbers b4 I can get the answer.

Anyone can help?

- June 16th 2007, 09:16 PM #2

- June 16th 2007, 10:14 PM #3

- Joined
- Oct 2006
- Posts
- 187
- Thanks
- 1

- June 17th 2007, 03:56 AM #4
Call it an "educated guess." There may well be ways to refine this so that you can guess fewer numbers before you get to the correct answer, but you will still have to guess at a few. You aren't going to find a "plug'n'chug" answer to this kind of question.

-Dan

- June 17th 2007, 06:14 AM #5

- Joined
- May 2006
- From
- Lexington, MA (USA)
- Posts
- 12,026
- Thanks
- 842

Hello, acc100jt!

It can be solved without guessing

. . and without invoking Modular Arithmetic,

but it takes some Olympic-level gymnastics.

is an integer.

is divisible by 3 and 5,

is divisible by 8,

What is the smallest possible value of n??

Equate [1] and [2]: .

Since is an integer, is a multiple of 5: .

Equate [1] and [3]: .

Since , we have: .

. . A small detour: .

Hence: .

Since is an integer, is a multiple of 8.

. . The least value is:

. . Hence: .

Substitute into [1]: .