0
What number divided by 5 gives remainder 3 and divided by 7 gives remainder 2?
Wiki User
∙ 9y ago
23, 58, 93, 128, 163, 198, ...
Wiki User
∙ 9y ago
Add your answer:
Earn +20 pts
What is the lest number that gives a remainder of one when divided by 2 divided?
3
Is 121 divisible by 3?
No. Add the digits of the dividend and if that is divisible by 3 then the original number is divisible by 3; if not, its remainder when divided by 3 gives the remainder when the original number is divided by 3: 1 + 2 + 1 = 4 which gives a remainder of 1 when divided by 3, so 121 divided by 3 gives a remainder of 1. (121 = 40 x 3 + 1)
How you get 16 MOD 2 equals 0?
MOD (or modulus) gives the remainder when the first number is divided by the second. The remainder of 16 divided by 2 is 0, so 16 MOD 2 = 0.
What is the number that cannot be divided by 2 without a remainder?
It is an Odd number. Even numbers are those which have no remainder when divided by 2.
When 236 divided by 5 gives a remainder 2 of what is the quotient?
236 divided by 5 is 47 with remainder 1
What is the lest number that gives a remainder of one when divided by 2 divided?
3
What number between 10 and 30 is odd and gives a remainder of 2 when divided by 7?
23 is an odd number between 10 and 30 that gives a remainder of 2 when divided by 7.
Which number is that when divided by 34 and 5 gives 2 as remainder?
172
Which is the only prime number which when divided by another prime number gives the same qoutientas the remainder?
3 divided by 2 goes once, remainder one.
Is 121 divisible by 3?
No. Add the digits of the dividend and if that is divisible by 3 then the original number is divisible by 3; if not, its remainder when divided by 3 gives the remainder when the original number is divided by 3: 1 + 2 + 1 = 4 which gives a remainder of 1 when divided by 3, so 121 divided by 3 gives a remainder of 1. (121 = 40 x 3 + 1)
Have 2 digits divided by 7 remainder is 1 then halved the remainder is 1 one digit is 3 what number is it?
I think you're wanting a number of two digits, one of which is 3, that when divided by 7 gives a quotient and a remainder of 1 and when that quotient is divided by 2 it gives a remainder of 1: Answer: 36 36 ÷ 7 = 5 r 1 5 ÷ 2 = 2 r 1 If you want the number to be such that if it is divided by 7 the remainder is 1 and if it is divided by 2 the remainder is 1, then: Answer: 43 43 ÷ 7 = 6 r 1 43 ÷ 2 = 21 r 1
What is the only prime number which when divided by another prime number leaves the same remainder as quotient?
3 divided by 2 gives 1r1
What number as a remainder of 1 when divided by 2 as a remainder of 2 when divided by 3 as a remainder of 3 when divided by 4 and a remainder of 4 when divided by 5?
59
What number divided by 2 has a remainder 1 divided by 3 has a remainder 2 divided by four has a remainder 3 divided by 5 has a remainder 4?
29
How you get 16 MOD 2 equals 0?
MOD (or modulus) gives the remainder when the first number is divided by the second. The remainder of 16 divided by 2 is 0, so 16 MOD 2 = 0.
What is the number that cannot be divided by 2 without a remainder?
It is an Odd number. Even numbers are those which have no remainder when divided by 2.
What is the number which when divided by 4 gives a quotient of 15 with remainder of 2?
62 explanation is : 4X15+2=62
