When $1200$ is divided by $N$ and $N+x$, the remainder in both cases is $35$.

What is the maximum value of x?

-
Since you are new to this site, please consider reading this: How to ask a homework question? I wrote this comment because the question sounds homework-like. –  Martin Sleziak Sep 22 '12 at 7:19
martin, Yes I am new to this site. This question sounds homework like but it is not. I am preparing for a competitive exam, and so, I asked this because I didn't know , what is the correct way to do this problem. I accept your code-of-conduct and conditions very truthfully and I promise, I will try to show my work, so that it does not sound like a homework question. Thanks. –  Kushashwa Ravi Shrimali Sep 22 '12 at 7:56

What can we say about $1200-35=1165$ in relation to $N$ and $N+x$? Particularly with regards to divisibility.

Hint 2: Look at all factors of $1165$, see what you can say.

-
Michael, I've rejected your suggested edit, since it is recommended that homework tag should be added only by OP or if OP explicitly says it is homework. See meta. –  Martin Sleziak Sep 22 '12 at 7:22
Thank you for the clarification. I'll be sure to keep that in mind in the future. –  Michael Dyrud Sep 22 '12 at 7:28

When 1200 is divided by any number greater than 1200 remainder is 1200. When 1200 is divided by (1200-35)=1165 remainder is 35. Again when 1200 is divided by 233 remainder is 35.So greatest value of x is 1165-233=932

-
Thanks @argha chakraborty. :) –  Kushashwa Ravi Shrimali Sep 22 '12 at 7:53
Depending on the competition, that is not sufficient. You've shown that x=932 is a possible value of x, but how can you show that it's the maximum? –  Michael Dyrud Sep 22 '12 at 15:41

I will use Haskell to brute-force this problem. Here's an extremely brief GHCi session:

Prelude> [ n | n <- [1..1200], 1200 mod n == 35]
[233,1165]


Because $1200 = (233 \times 5) + 35 = 1165 + 35$. Since $1165-233 = 932$, we have $x = 932$. Alternatively, we could have used a sexier list comprehension, as follows:

Prelude> [ x | n <- [1..1200], x <- [1..(1200-n)], 1200 mod n == 35, 1200 mod (n+x) == 35]
[932]


The interpretation of these "experimental" results is left to the reader.

-