0
What algorithm makes sense for dividing any whole number by any fractions?
Wiki User
∙ 13y ago
let x = whole number
let y = a/b
|------------|
| z = x/y |
|------------|
a, b can have any real value.
OR:
You multiply the whole number by the dinamanator (botton number of the fraction), then you divid the answer by the numanator (top number of the fraction) You get your answer but it you might be able to put it in smallest terms.......THEN ALL DONE!! I hope it was helpful
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
Why would you need to find the GCF and LCM of a set of numbers?
They GCF and LCM are useful in working with fractions: In simplifying a fraction dividing the numerator (top) and denominator (bottom) by the same number reduces the fraction. By dividing through by the GCF of the numerator and denominator the fraction cannot be simplified any further (except converting improper (top heavy) fractions to mixed numbers). For large numbers, it may not be obvious what are the common factors of the numerator and denominator so using a general algorithm to find their GCF makes this easier. When adding or subtracting fractions a common denominator is needed. One number which is guaranteed to work is to multiply all the denominators together. However, this can lead to extremely large numbers which can be difficult with which to work and lead to a fraction that will require simplifying. By using the LCM as the new denominator (hence its alternative name of LCD - Lowest Common Denominator) it ensures the numbers shouldn't get too big and should be easier with which to work.
How would you add two mixed numbers that contain unlike fractions?
you would convert the mixed numbers into fractions where the top number is greater than the bottom number, then multiply both the numerator and the denominator by a number that makes the denominators the same.
Can consecutive integers be fractions?
No. The concept of consecutive makes sense for integers but not for fractions. Fractions are infinitely dense. This means that there are infinitely many fractions between any two numbers - including between any two fractions. So, given one fraction, f1, there cannot be a "next" or "consecutive" fraction, f2, because there are an infinite number of fractions between f1 and f2.
When five times a number is decreased by 4 the result is 11. What is the number?
Three Working backwards from 11 then add 4 to make 15 then dividing 15 by 5 makes 3
Is 41 prime or composite and explain?
41 is prime because you can only multiply 41 and itself to get 41, wich makes a number prime. You can check if a number is prime by dividing it by the numbers 2 to 9 and if you don't get a whole number from any of the numbers you divided them with, then the number is prime. It's easier if you use a calculator for dividing all the numbers unless you are good at math.
What algorithm makes sense for dividing any fraction by any whole number?
multiply by the reciprocal of the whole number
What algorithm makes sense for dividing any fraction by any fraction?
Hey Guys! I'm Not Sure That's Why I Am Asking You!.
What makes an integer an integer?
An integer is a whole number without decimals or fractions
Type the missing number that makes these fractions equal:12=56?
672
Multiplying and dividing two rlated quantities by the same number is called?
There is no particular name for it. For example, the frequency and wavelength of electromagnetic rays are related, but multiplying them by the same number, or dividing, makes no sense.
Why would you need to find the GCF and LCM of a set of numbers?
They GCF and LCM are useful in working with fractions: In simplifying a fraction dividing the numerator (top) and denominator (bottom) by the same number reduces the fraction. By dividing through by the GCF of the numerator and denominator the fraction cannot be simplified any further (except converting improper (top heavy) fractions to mixed numbers). For large numbers, it may not be obvious what are the common factors of the numerator and denominator so using a general algorithm to find their GCF makes this easier. When adding or subtracting fractions a common denominator is needed. One number which is guaranteed to work is to multiply all the denominators together. However, this can lead to extremely large numbers which can be difficult with which to work and lead to a fraction that will require simplifying. By using the LCM as the new denominator (hence its alternative name of LCD - Lowest Common Denominator) it ensures the numbers shouldn't get too big and should be easier with which to work.
What makes fasta faster than needleman wunsch algorithm?
Hash loookup table in FASTA makes it faster than Needleman Wunsch algorithm.
When adding fractions do you change a mixed number to an improper fraction?
It is possible no to. But doing so makes it easier
How would you add two mixed numbers that contain unlike fractions?
you would convert the mixed numbers into fractions where the top number is greater than the bottom number, then multiply both the numerator and the denominator by a number that makes the denominators the same.
What is 10 number after pi?
It only makes sense to count, and talk about "next" and "previous" numbers, with integers - not with fractions, or irrational numbers.It only makes sense to count, and talk about "next" and "previous" numbers, with integers - not with fractions, or irrational numbers.It only makes sense to count, and talk about "next" and "previous" numbers, with integers - not with fractions, or irrational numbers.It only makes sense to count, and talk about "next" and "previous" numbers, with integers - not with fractions, or irrational numbers.
Do you change a mixed number into an improper number while adding and subtracting?
you do what makes sense given the numbers, if the fractions work out beautifully, you can just leave them as mixed numbers, otherwise it's best to keep them as improper fractions
How are the expanded algorithm and the standard algorithm alike?
The expanded algorithm makes use of the partial products to fully explain place value in multiplication. The standard algorithm which is most commonly used is considered superior and less confusing.
