How to solve please show steps i am not getting how to solve when mod m is large as in this case i.e.27

it has unique solution, which is 24 mod27

using this theorem, it follows that it has a unique solution

sir can u pls solve using euclidean algorithm

and then arrive at same ans.

okkk... let me solve it by that method

see the attachments

Hey Aaditya! both solutions are correct by their respective methods.... I hope it will clarify u

Plz consider both solutions and in case of doubt, u can ask me

sir pls explain how after x=51(mod27) ......x=24(mod27) came...pls explain

it's a full explanation of how congruence works....u should need to work on congruence modulo ...in case of any doubt, ask me

sir which book will be best where these are explained easily with examples

where are you from?

If you are a beginner, then I will suggest you to study a book in which u can get a number of solved examples. A book on number theory published by Krishna publication (if you know this publication and u can get it easily) can be preferred. Apart from this, u can study "Burton" .This is a standard book which is usually suggested by professors of IITs.

sir,i am from ranchi..

Then, I think Krishna publication book may be getable. Actually, I don't know whether it is a known book for all or not but I find it good to begin

sir its known for upsc exams ..what i know

okkk....then u can refer that Book

in case of any need, I will be there

okk sir..