Euclid’s division lemma states that for any positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy

What is the largest number that divides 245 and 1029, leaving remainder 5 in each case?

The simplest form of is

A number when divided by 143 leaves 31 as remainder. What will be the remainder when the same number is divided by 13?

Which of the following is an irrational number?