66.6667
I added A & B to your question for clarity. If a number (A) is divided by number (B) with no remainder, then A isdivisible by B. Also, it can be stated that B is a factor of A.
A number that can be divided without having a remainder is called a "divisible" number. More specifically, if a number ( a ) can be divided by another number ( b ) without leaving a remainder, we say that ( a ) is divisible by ( b ). For example, 10 is divisible by 2 because 10 divided by 2 equals 5, with no remainder.
2.5
9.1429
To find the remainder when the polynomial ( x^3 + x^2 + 5x + 6 ) is divided by ( x^2 ), we can use polynomial long division or simply evaluate the polynomial at the roots of ( x^2 = 0 ), which are ( x = 0 ) and ( x = 0 ). The remainder will be a polynomial of degree less than 2, in the form ( ax + b ). Substituting ( x = 0 ) into the original polynomial gives ( 6 ) for the constant term, and substituting gives the linear term ( 5 \cdot 0 = 0 ). Thus, the remainder is ( 5x + 6 ).
The remainder is 0.If A has a remainder of 1 when divided by 3, then A = 3m + 1 for some integer mIf B has a remainder of 2 when divided by 3, then B = 3n + 1 for some integer n→ A + B = (3m + 1) + (3n + 2)= 3m + 3n + 1 + 2= 3m + 3n + 3= 3(m + n + 1)= 3k where k = m + n + 1 and is an integer→ A + B = 3k + 0→ remainder when A + B divided by 3 is 0-------------------------------------------------------------------------From this, you may be able to see that:if A when divided by C has remainder Ra; andif B when divided by C has remainder Rb; then(A + B) divided by C will have remainder equal to the remainder of (Ra + Rb) divided by C
I added A & B to your question for clarity. If a number (A) is divided by number (B) with no remainder, then A isdivisible by B. Also, it can be stated that B is a factor of A.
A number that can be divided without having a remainder is called a "divisible" number. More specifically, if a number ( a ) can be divided by another number ( b ) without leaving a remainder, we say that ( a ) is divisible by ( b ). For example, 10 is divisible by 2 because 10 divided by 2 equals 5, with no remainder.
11.625
6.9677
Suppose you want to find the gcf of 5040 and 1274. Make a list or a "ladder" starting with 5040 and 1274. Each item after that is the remainder of dividing the two numbers above. 5040 1274 1218 (5040 divided by 1274 leaves a remainder of 1218) 56 (1274 divided by 1218 leaves a remainder of 56) 42 (1218 divided by 56 leaves a remainder of 42) 14 (56 divided by 42 leaves a remainder of 14) 0 (42 divided by 14 leaves a remainder of 0). When you reach zero, the number before it (in this case 14) is the gcf. The gcf of 5040 and 1274 is 14. In general: Let a and b be the two numbers. repeat while (b >0) Let c = the remainder of a divided by b Let a=b Let b=c The gcf is a.
2.5
2.5
9.1429
To find the remainder when the polynomial ( x^3 + x^2 + 5x + 6 ) is divided by ( x^2 ), we can use polynomial long division or simply evaluate the polynomial at the roots of ( x^2 = 0 ), which are ( x = 0 ) and ( x = 0 ). The remainder will be a polynomial of degree less than 2, in the form ( ax + b ). Substituting ( x = 0 ) into the original polynomial gives ( 6 ) for the constant term, and substituting gives the linear term ( 5 \cdot 0 = 0 ). Thus, the remainder is ( 5x + 6 ).
B/5 = 6 means that 6 x 5 = B 6 x 5 = 30 Therefore, B = 30
5