Find the least counting number which when divided by 5 gives the remainder of 1 and when divided by 12 gives us the remainder of 3

51

Step-by-step explanation:

Let x be the number

When x divided by 5 then it gives remainder 1 and when divided by 12 gives remainder 3.

We have to  the value of x.

Using Euclid's algorithm

Where

...(1)

When q=10 and p=4

Then,

q=10 and p=4 satisfied the equation (1)

Substitute q=10

Hence,51 is  the least counting number  which when divided by 5 gives the remainder of 1 and when divided by 12 gives us the remainder of 3.

sine

step-by-step explanation: