answersLogoWhite

0

140 is the obvious upper bound for this question. It is not a solution, however, because it doesn't give zero remainder when divided into 570 or 828. If we work our way down from 140, though, the first number that yields equal remainders is of course the answer. I employed a vaguish and fairly inefficient algorithm to reach the answer, not having come across such a problem before. So I won't attempt to record my method. Suffice it to say that the correct answer was the fifteenth number I tested: 140 = (43x 3) + 11

570 = (43 x 13) + 11

828 = (43 x 19) + 11

User Avatar

Wiki User

17y ago

What else can I help you with?

Related Questions

What is the largest remainder when dividing by 2?

The largest remainder, when dividing by any integer, n is n-1. So, when dividing by 2, the largest remainder is 1.


What is an aliquant?

An aliquant is an integer which does not divide another into integral parts, and which therefore leaves a remainder.


What is the largest possible remainder when dividing by 8?

7 because if the remainder was 8, you could just divide it one more time


What is 8 divided by 35 with remainder?

0.2286


Is 4.5 an integer or is it non-integral?

4.5 is not an integer.


What is a quotient of integers?

A quotient of integers is the result of dividing one integer by another. When dividing two integers, the result may be a whole number if the division is exact, or a decimal/fraction if there is a remainder. For example, when dividing 10 by 2, the quotient is 5, which is also an integer.


What is the greatest possible remainder when a whole number is divided by 9?

If you divide an integer by 9, the remainder can be anything from 0 to 8.If you divide an integer by 9, the remainder can be anything from 0 to 8.If you divide an integer by 9, the remainder can be anything from 0 to 8.If you divide an integer by 9, the remainder can be anything from 0 to 8.


What is the 3 in 3.4?

The integer (or integral) part.


Integral multiples of 11why?

If k is any integer, then 11k is an integral multiple of 11.


What is the difference between modular arithmetic and ordinary arthmetic?

given any positive integer n and any integer a , if we divide a by n, we get an integer quotient q and an integer remainder r that obey the following relationship where [x] is the largest integer less than or equal to x


When dividing a negative and positive integer what is the ending integer?

It is negative


What the odd numbers has in common?

Odd numbers are the numbers that are not divisible by two. In other words, if you do an integer division, dividing any odd number by two, you get a remainder of one.