Can you find the smallest non-fractional number such that:-
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The 4. condition is completely redundant. 1,2 already imply it.
n ≡ 1 ( m o d 3 ) ⇒ n = 3 k + 1 .
n ≡ 3 k + 1 ≡ 2 ( m o d 4 ) ⟺ − k ≡ 1 ( m o d 4 )
\stackrel{:(-1)}\iff k\equiv -1\equiv 3\pmod{\!4}\,\Rightarrow\, k=4h+3
n = 3 ( 4 h + 3 ) + 1 = 1 2 h + 1 0 .
n ≡ 1 2 h + 1 0 ≡ 2 h ≡ 3 ≡ − 2 ( m o d 5 )
\stackrel{:2}\iff h\equiv -1\equiv 4\pmod{\! 5}\,\Rightarrow\, h=5m+4
n = 1 2 ( 5 m + 4 ) + 1 0 = 6 0 m + 5 8 .
We never used 4. and we still have n ≡ 6 0 m + 5 8 ≡ 4 ( m o d 6 ) .
Please ask if I expressed something unclearly :)
get the LCM of 3,4,5, and 6 = 60,subtract the common difference of the remainder = 2 60 - 2 = 58
Problem Loading...
Note Loading...
Set Loading...
The LCM of 3,4,5 and 6 is 60.
we need remainder 1 when divided by 3. 3-1=2.
Similarly, 4-2 = 5-3 = 6-4 = 2.
So if we subtract 2 from 60, we get 58 which satisfies all 4 conditions.