What function should it be on to get a whole number answer for division problems EX: 15 divided by 2

810 divided 9= 90

1.71/4.56 ratio simplified.

First, let's clean it up by multiplying top (numerator) and bottom (denominated) by 100. Now we have 171/456.

Next, I use an old trick. If you add up the digits in a number and the answer is divisible by 3, the number is divisible by 3.

1+7+1 = 9 and 9 is evenly divisible by 3, so 171 is divisible by 3.

Similarly, with 456, 4+5+6 = 15 and 3 goes evenly into 15, so 3 goes in evenly to 15. Alternatively, we can take the answer 15, and go 1+5 = 6 and 3 goes evenly into 6 so 3 goes evenly into 456.

171 ÷ 3 = 57
----- ----
456 ÷ 3 = 152

Since is 57, 5+7 = 12 and 1+2 =3, 3 goes into 57 19 times.
Since 152 is even, factors are 2 and 76. Factoring 76, 2 and 38. Factoring 38, 2 and 19. So 152 is 2 x 2 x 2 x 19.

Since 19 is common, we can divide top (numerator) and bottom (denominated) by 19.

57 ÷ 19 = 3
--- ----
152 ÷ 19 = 8

Thus, the final answer is 3/8.

Alternatively, you can factor 171 and 456 and divide by the highest common factor, which are the factors that are common to both.

First, find out how many whole times 24 will go into 67
67/24 = 2 with a remainder that we don't care about. Write down 2
Next, multiply that answer (2) by 24 2 X 24=48
Subtract that 48 from 67 67-48=19
bring down next digit (8) append to the19 198
divide 24 into 198 198/24=8 Write down 8
multiply that answer by 24 8 X 24 =192
Subtract that 192 from 198 198 - 192 = 6
bring down next digit (7) append to the 6 67
divide 24 into 67 67/24 =2 Write down 2
multiply that answer by 24 2 X 24 = 48
subtract 48 from 67 27-24=19
bring down next digit (2)append to the 19 192
divide 24 into 192 192/24 = 8 Write down 8
multiply that answer by 24 24 X 8=192
subtract 192 from 192 192-192=0 You're done!
Your answer is the numbers you wrote down after the divisions = 2848

2 8 4 8
----------------------
24 ) 67872
- 48
198
-192
67
- 48
192
- 192
0

This calculator does not have a key that you can use to find the prime factor of an integer.
You can however use the calculator to find the factors
1. If number is even divide it by 2
Keep dividing by 2, while keeping track of how many times you divided by 2.
If you divided 5 times by 2 before getting an odd number, then your first factor is 2^5
2. Now try dividing by 3, keep track of the number of times you divided by 3 before you could not divide by 3 any more. If you divided 0 times by 3, your second factor is 3^0, or 1 and 3 is not a factor.
If you divided 4 times by 3, your second factor is 3^4
3. Divide by 5, until you can't any more. Keep track of the number of times you divided by 5.
4. Divide by all other prime numbers 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, etc. For each prime number, keep track of how many times you divided by it, until you could not any more.

Example: 23100
Division by 2
23100/2=11550 ---------> 1 division by 2
11550/2=5775 ----------> 2 divisions by 2
Note that 5775 is not divisible by 2. No more divisions by 2.
First factor is 2^2

Division by 3:
5775/3=1925 ----------> 1 division by 3
1925/3=641. 66667 Not an integer. No more divisions by 3.
2nd factor is 3^1

Division by 5 (number ends in 5)
1925/5 =385 -------> 1 division by 5
385/5=77 ----------> 2 divisions by 5 and no more (quotient does not end in 0 or 5)
3rd factor is 5^2

Division by 7
77/7=11 --------> 1 division by 7, and no more
4th factor is 7^1=7

Division by 11
11/11=1
5th factor is 11^1=11

Assembling the factors 2^2, 3^1, 5^2, 7, 11
Prime factorization of 23100 is
23100=(2^2)(3)(5^2)(7)11

A prime number is a positive whole number (natural number) which cannot be divided into smaller whole numbers. In short, it can only be divided (integer division) by itself and 1.
First prime number is 2, then 3, 5, 7, 11, 13, 17, 19,
To generate a list of prime numbers the Greek Eratoshenes used a method called now the sieve Eratosthenes.

1. Write all the natural numbers up to some chosen limit (100, 259, any limit )
2. Remove 1 by crossing it ( 1 is no longer considered prime).
3. The first prime number is 2. Circle the number 2.
4. Go through the whole list crossing out all the numbers that are multiple of 2, that is 4, 6, 8,10,12, ...
5. Repeat.
6. The next prime number is 3 since it was not crossed out as a multiple of 2. Circle 3.
7. Go through the whole list crossing all the numbers that are multiples of 3, and which have not already been crossed out as multiples of 2 .
8. Number 4 has been crossed out already.
9. Next prime number is 5. Circle 5
10. Go through the whole list crossing all the numbers that are multiple of 5 and which have not been crossed out already as multiples of 2, or 3
11. Repeat:
12. Next prime number is 7. Circle 7
13. Go through the whole list again, crossing out the multiples of 7, and so on.

If you want to test the primality of a positive integer (odd number) starting by dividing it by 3 (use divisibility rules or otherwise), then divide by 5, by seven, and all subsequent prime numbers. If it is not divisible by any prime number, keep going but do not exceed the prime number that is closest yet smaller than square root of your number.

Enjoy.

1600 divided by 24 is 66 2/3 or in decimal, 66.6666 with the 6s repeating forever. Rounded to the nearest whole number it's 67 since it's closer to 67 than to 66.

Finding the remainder from a division calculation is often referred to as using the MOD function, though this isn't available directly on the fx-991ES.
To obtain the remainder, for example when dividing 10 by 7, you can only divide 7 into 10 once, leaving a remainder of 3.
For larger numbers, eg when dividing 389487 by 31 (equivalent to 389487MOD31) the division gives an answer of 12564.09677 (on the display), however you only want the fractional part so subtract 12564 to give 0.0967741935 . This includes the lower value digits that were previously hidden. Then multiply this result by 31 which gives 2.999999999 on the display. Since the result of a MOD or remainder calculation involving integers has to be a whole number, the answer needs to be rounded to 3. If the answer doesn't easily round to a whole number, it is likely that you have gone beyond the calculator's working capacity.
An alternative method which avoids the rounding of the fractional part is to take the integer part of the first result (12564) and multiply it by 31 to get 389484, then subtract this from 389487, giving the answer of 3.

It seemed there is no Modulo function in fx-100MS. But Mod is just the remainder of a division operator.

So if you have A mod B = C, divide A by B, subract the remaining whole number, and multiply it by B to get C.

Example:

7 mod 4 = 3

In the Calculator:

7 / 4 = 1.75, then 1.75 - 1 = 0.75. Then 0.75 x 4 = 3

Hi,
You are not dividing problems, you are dividing number. This said, there is a simple way to ensure that the results of divisions are displayed in decimal form: It consists in putting a decimal mark (decimal point) at the end one integer (whole number)
ex:
3/2. gives 1.5
3./2 gives 1.5
3./2. gives 1.5

You can also configure your calculator to display all numerical results in decimal format. To do that press [MODE][F2]. Use the down arrow to select the ligne Exact/Approx, then use the right arrow to unfold the menu options 1:Auto
2:Exact
3:Approximate
Select 3:Approximate and press [ENTER]


Hope it helps.