answersLogoWhite

0

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

Still curious? Ask our experts.

Chat with our AI personalities

SteveSteve
Knowledge is a journey, you know? We'll get there.
Chat with Steve
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
MaxineMaxine
I respect you enough to keep it real.
Chat with Maxine

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.


When a number divides into another number with no remainder?

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


What is 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".