answersLogoWhite

0


Best Answer

I've never heard of a "friendly number strategy" per se; but there are specific rules for "divisibility" that you can use to help break up large numbers. For example, if the number is even, it is divisible by 2; if the sum of the numbers

User Avatar

Wiki User

16y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Friendly number strategy for divisibility
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Basic Math

What are the divisibility rules of all prime numbers?

The divisibility rules for a prime number is if it is ONLY divisible by 1, and itself.


What is when a number divides into another number with no remainder?

Divisibility is when a number divides into another number with no remainder.


When a number divides into another number with no remainder?

Divisibility is when a number divides into another number with no remainder.


What number goes into all the numbers in the divisibility chart?

1


What is the algorithm for prime numbers in c?

Here is a very simple algorithm: Call your number "n". You might test divisibility by every number, starting at 2. If the first number by which a number is divisible is equal to "n", then it is a prime number. - Faster algorithms are possible; for example, you really only need to test divisibility by all numbers, up to the square root of your number "n".Here is a very simple algorithm: Call your number "n". You might test divisibility by every number, starting at 2. If the first number by which a number is divisible is equal to "n", then it is a prime number. - Faster algorithms are possible; for example, you really only need to test divisibility by all numbers, up to the square root of your number "n".Here is a very simple algorithm: Call your number "n". You might test divisibility by every number, starting at 2. If the first number by which a number is divisible is equal to "n", then it is a prime number. - Faster algorithms are possible; for example, you really only need to test divisibility by all numbers, up to the square root of your number "n".Here is a very simple algorithm: Call your number "n". You might test divisibility by every number, starting at 2. If the first number by which a number is divisible is equal to "n", then it is a prime number. - Faster algorithms are possible; for example, you really only need to test divisibility by all numbers, up to the square root of your number "n".

Related questions

What is the friendly number strategy?

The friendly number strategy is a way to complete difficult operations by dividing them into operations using friendly numbers, or numbers that are easy to work with. For example, you could use the friendly numbers strategy to solve 169 + 37 by breaking it down into 160 + 30 + 9 + 7.


What is the relation of divisibility to multiplication and division?

Divisibility is what a number can be divided by.


What is the divisibility rule of 64?

There are two ways of answering this.Check the number for divisibility by 2.Check the quotient for divisibility by 2.Check the quotient for divisibility by 2.Check the quotient for divisibility by 2.Check the quotient for divisibility by 2.Check the quotient for divisibility by 2.For large numbers, the check can be restricted to the number formed by the last six digits.


What is 42 divided by 3 equals ......using friendly number strategy?

The quotient is: 42/3 = 14


What are the 20 divisibility test?

To test divisibility for 20, you need to use the tests for divisibility by 4 and 5.The test for divisibility by 4 is that the last 2 digits of the number, given as a 2-digit number, are divisible by 4.Example for 4:We are testing the number 11042.42/4 = 10.5 which is not a whole number. Therefore 11042 is not divisible by 4.The test for divisibility by 5 is that the last digit of the number is either 5 or 0.


What number goes into all of the divisibility rules?

The number 0.


What is divisibility rule for two?

the number is even.


What are reasons of using the disivility rules?

You can always check on the divisibility of a number by dividing it into another number. But if you know the divisibility rules, you can get that information easier and faster.


What are the divisibility rules of all prime numbers?

The divisibility rules for a prime number is if it is ONLY divisible by 1, and itself.


Why does divisibility rule for 2?

The divisibility rule for 2 works because the base of our number system, 10, is divisible by 2.


How do you use the friendly numbers strategy?

61 = 89


What is when a number divides into another number with no remainder?

Divisibility is when a number divides into another number with no remainder.