When the positive integer n is divided by 3, the remainder is 2 and when n is divided

[k318wilcoxa]

When the positive integer n is divided by 3, the remainder is 2 and when n is divided by 5, the remainder is 1. What is the least possible value of n?

I tackled the problem by first setting up the problem:
n
----- = .2
3

n
----- = .1
5

I'm not sure if this is correct??

Any help would be appreciated, Abe

 

[Deleted member 4993]

When the positive integer n is divided by 3, the remainder is 2 and when n is divided by 5, the remainder is 1. What is the least possible value of n?

I tackled the problem by first setting up the problem:
n
----- = .2 → n = 0.6
3

n
----- = .1
5

I'm not sure if this is correct??

Any help would be appreciated, Abe

I am not sure how you are setting up the problem here. Why should n = 0.6, when we know that
n is an integer.

The best way I know to solve THIS problem is by trial and error.

Try multiples of 3 → 3, 6, 9, 12, 15....

Add 2 to those → 5, 8, 11, 14, 17...

Now divide those by 5 and find out which one leaves a remainder of 1.

 

[pka]

When the positive integer n is divided by 3, the remainder is 2 and when n is divided by 5, the remainder is 1. What is the least possible value of n?

Given \(\displaystyle n=3J+2=5K+1\) from which we get \(\displaystyle 5K-3J=1\).
One pair that works is \(\displaystyle K=5~\&~J=8\) making \(\displaystyle N=26\).
BUT that is not the smallest, what is?