00:01
So here, if we know what our rns is, which is a non -weighted number system, this is going to be given to us as a mod 8, 7, 5, and 3.
00:14
A number n has a rns representation if we have n mod 8, n mod 7, n mod 5, or n mod 3.
00:31
We want to find all of these that are palindromic.
00:35
That means that our n mod of that number is equal to the n mod of the number.
00:41
This implies that n mod 8 is going to have to equal n mod 3, which is going...oh, and then n mod 7 has to equal n mod 5.
01:03
To solve these, we are going to get that n can be written as a multiple of the least common multiple of 8 and 3, which is 24.
01:15
So we know that n is equal to 24k.
01:19
And then for 7 and 5, this is going to apply that n has the same remainder when divided as 7 and 5.
01:29
So we know that n has to equal...or for our lcm, we are going to get 35.
01:43
So n is equal to 35m for some integer m.
01:50
Since n is a multiple of both 24 and 35, it must have an lcm, which is 840.
01:59
So n is equal to 840n for some integer n...