O-Level Additional Math

[Guan Hui]

fully agreed=) not much secondary questions here though

[emerald]

Hi Guan Hui, pls help with the foll:


Find the smallest no. x, such that when it is divided by the nos. from 2 to 10, the remainder is always one less than the divisor.

TIA.

[Guan Hui]

emerald:

Hi Guan Hui, pls help with the foll:


Find the smallest no. x, such that when it is divided by the nos. from 2 to 10, the remainder is always one less than the divisor.

TIA.

haha thanks for asking=) out of business for quite long hehheh.
from the question, the way to solve this is to find LCM from 2-10 and minus it by 1.

the LCM is 2520( if you do not know the lcm method pls reply to this post i will do a video response for you emerald)

so the answer is 2520-1=2519

[emerald]

Thanks once again.

[Guan Hui]

you are welcome

[OK Lor]

Hi Guan Hui,


Please help:
y in term of x for: 3^y = 4[3^(x-2)] - 1.

Thanks.

[Guan Hui]

HI oklor=D

Heres Your solution=)
http://www.postimage.org/image.php?v=gxHyAlJ

[OK Lor]

Guan Hui:

HI oklor=D

Heres Your solution=)
http://www.postimage.org/image.php?v=gxHyAlJ

Hi Guan Hui,
Thanks. The original question was:
Solve the simultaneous equation 64(4^y) = 16^x and 3^y = 4[3^(x-2)] - 1.

[Guan Hui]

Bonjour Oklor,

Heres the solution=)
http://www.postimage.org/image.php?v=TsFjbFS

http://www.postimage.org/image.php?v=PqhA1ci

http://www.postimage.org/image.php?v=gxJs6K0

http://www.postimage.org/image.php?v=TsFm7fr

http://www.postimage.org/image.php?v=gxJsyaA

[OK Lor]

Hi Sir,


Thanks.