answersLogoWhite

0


Best Answer

the max remainder you can have when dividing by a number is that number minus 1 So 4 can only have 1, 2 and 3 as remainders. 9 can only have 1-8 and so on.

User Avatar

Wiki User

โˆ™ 2009-03-19 19:05:31
This answer is:
๐Ÿฆƒ
0
๐Ÿคจ
0
๐Ÿ˜ฎ
0
User Avatar
Study guides

Algebra

20 cards

A polynomial of degree zero is a constant term

The grouping method of factoring can still be used when only some of the terms share a common factor A True B False

The sum or difference of p and q is the of the x-term in the trinomial

A number a power of a variable or a product of the two is a monomial while a polynomial is the of monomials

โžก๏ธ
See all cards

J's study guide

1 card

What is the name of Steve on minecraft's name

โžก๏ธ
See all cards

Steel Tip Darts Out Chart

96 cards

170

169

168

167

โžก๏ธ
See all cards

Add your answer:

Earn +20 pts
Q: When you divide by 4 are the only remainders you can get are 1 2 or 3?
Write your answer...
Submit
Related questions

When you divide by 3 are the only remainders you can get are 1 or 2?

1 & 2 are the only non-zero remainders you can get from dividing a whole number by 3.


What remainders can you get when you divide by 3?

2, 1 or 0.


How can you get remainders of one or minus one when you divide an uneven integer by two?

Any uneven integer can be represented in the form 2n+1. When you divide this number by 2, you will get n with 1 remaining (either +1 or -1)


How many possible remainder are there if you divide a number by 5?

In division by 5, you can have remainders of 0, 1, 2, 3, and 4. If you count zero, then you can have five possible remainders. If you are not counting zero, then 4 possible remainders.


When you divide a 2 digit number by 9 and 8 you get 3 remainders?

It is 75.


What causes a repeating decimal in the long division algorithm?

When you divide by a divisor q, the remainders can only be integers that are smaller than q. If the remainder is 0 then the decimal is terminating. Otherwise, it can only take the values 1, 2, 3, ... ,(q-1). So, after at most q-1 different remainders you must have a remainder which has appeared before. That is where the long division algorithm loops back into an earlier pattern = repeating sequence.


35 into 300 simplified?

300/35 use 5 to divide both numerator and denominator =60/7=8.571 or 8.6 or 8 remainders 20.


How many are possible nonzero remainders by 3?

In division by three, possible nonzero remainders are 1 and 2.


What is the process of converting a decimal number into its binary equivalent?

Divide by the number repeatedly by two (until it is zero) and collect the remainders. For example: 13 / 2 = 6 Remainder 1 6 / 2 = 3 Remainder 0 3 / 2 = 1 Remainder 1 1 / 2 = 0 Remainder 1 Reading remainders from bottom yields: 1101


What are the even numbers from 1 to 200?

They are the numbers that when divided by 2 have no remainders


How many remainders are possible when 8 is made as divisor?

The possible remainders are {0, 1, 2, 3, 4, 5, 6, 7} making eight of them.


How many remainders are possible when 9 is made are the divisor?

There are 9 possible remainders: 0, 1, 2, 3, 4, 5, 6, 7, 8.


What is 31 divided by 2 with remainders?

15.5


How many possible remainders are there if 4 is the divisor?

Only 3 non-zero remainders.1, 2, and 3 are the only possible non-zero remainders since any number greater than or equal to the divisor could also be divided, to result in a new quotient. A remainder of zero, means that the dividend is divisible by the divisor (the divisor is a factor of the number)


How do you know if a number is prime or not?

if it can only divide by 2 numbers itself and 1 it is prime if it can divide by any other number it is not or in the case of 1 it can only be divided by 1 number so it is still not


Is there is possible alogrithm for converting a decimal to binary representation in terms of speed?

Repeatedly divide by 2. The remainders - in reverse order - form the binary number. You must continue dividing until the result of the division is zero. Example: Convert 11(decimal) to binary. 11 / 2 = 5 r 1 5 / 2 = 2 r 1 2 / 2 = 1 r 0 1 / 2 = 0 r 1. Now list the remainders from bottom to top: 1011. This is the binary representation of eleven.


Is a set of remainders when a positive integer is divided by four?

{0, 1, 2, 3}


How do you find the answer to question what is the GCF of 36 and 514?

The GCF of both numbers is 2 because it is the biggest number that will divide evenly into both numbers leaving no remainders.


What is the greatest remainder you can have when you divide by 2?

the biggest remainder you can have when dividing by 2 is 1. Reason is ......if you divide an even number by 2 you will always get a round answer. However if you divide an odd number by 2 you will always get a full number with 1 reamining...i.e divide 3 by 2.........2 remainder 1......................divide 19 by 2 this will give you 9 remainder 1. Hope this helps


What is the difference between a quarter of 16p and a half of 16p?

to get 1/4 of something, divide by 4. to get 1/2, divide by 2. 1/4 of 16 is 4, 1/2 is 8, difference is 4p


How many can 25 go into 62?

2.48 times or 2 with remainder 12.


What goes into 8 20 22?

1 and 2 will go into the given three numbers evenly with no remainders


What number goes into 14 and 32 easily?

1 and 2 goes into both numbers exactly with no remainders


How many possible remainders will you have if your divisor is 9?

With the divisor (the number you are dividing by) as 9, there are 9 possible remainders: 0, 1, 2, 3, 4, 5, 6, 7, and 8.


When you divide by 4 what remainders are possible?

20 / 4 = 5 (no remainder) 21 / 4 = 5 remainder 1 22 / 4 = 5 remainder 2 23 / 4 = 5 remainder 3 24 / 4 = 6 (no remainder) Therefore the numbers that can remain after you've divided a number by four are 0, 1, 2, and 3.