
HCF and LCM
n is an integer.
(n2) is divisible by 3 and 5,
(n3) is divisible by 8,
What is the smallest possible value of n??
My solution is the following:
(n2)=15k, where k is an integer, since it is divisible by 3 and 5
So (n3)=15k1 is divisible by 8, k=1, 2, 3, ...
The smallest number k such that (n3) 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 (n3) in step (*) and determine
whether (n3) 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?

you know that and .
also you know that .
So as the smallest possible value. Just guessed and checked.

Is there any other way to solve this without guessing the answer??

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

Hello, acc100jt!
It can be solved without guessing
. . and without invoking Modular Arithmetic,
but it takes some Olympiclevel gymnastics.
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]: .