Cracking L.C.M Remainder Problems | LCM Remainder Concepts | CAT/XAT/GMAT/SNAP/CMAT | BANK/IAS - Videos

0
149

This class discusses LCM Remainder Models and questions related to the concepts.
LCM Model 1: The least/greatest no of n digits which is exactly divisible by A,B,C is of the form K*LCM(A,B,C)
LCM Model 2: The least/greatest no of n digits when divided by A,B,C leaves the same Remainder R (Given) in each case is of the form K* LCM(A,B,C) +R
LCM Model 3: The least/greatest No of n digits when divided by A,B,C leaves Remainder X,Y,Z respectively such that A-X = B-Y = C-Z = Common Difference D is of the form K*LCM(A,B,C) -D

Reach out to me at –
Mail – [email protected]
FB – https://www.facebook.com/solvewithshubham/
Instagram – solvewithshubham
Blog: https://fireinthewings.wordpress.com/

Remember SolveWithShubham

source

LEAVE A REPLY

Please enter your comment!
Please enter your name here