A number when divided by a divisor leaves a remainder of , when twice of the original number is divided by the same divisor the remainder is , then find the divisor.
Let and be the number and divisor respectively.
According to the Division Algorithm, we get
According to the given condition, We get
Since is a prime number, then or
Therefore, the Divisor, or