Best Answer

There are different divisibility rules for different [potential] divisors.

Study guides

☆☆

Q: Can you explain a quick method for finding out whether a large number is divisible?

Write your answer...

Submit

Still have questions?

Related questions

Yes. 39105 is divisible by 9.One easy method to find out whether a number is divisible by 9 is adding each number.For example to find out whether 39105 is divisible by 9,add each number in 39105.3+9+1+0+5=18=1+8=9Therefore if a number gives 9 as total it will be divisible by 9.

Experiments are a method for finding solutions to problems.

explain how the method works

The lowest common multiple of 5 and 9 is 45 and 11 times 45 is 495 which is the greatest 3 digit number divisible by 5 and 9

listing method , factor tree

Not really, Everyone is looking for one though. It is still uncertain whether an infinite number of them exist and a method of finding them would help to prove that. Similarly, no odd perfect number has ever been discovered. I guess you just have to brute force each number and work it out.

Eratosthenes' method of finding prime and composite number is called 'The Sieve of Eratosthene'.

"Explain the method of translation of historical institutional term?" Institutional term and National institutional term? "Explain the method of translation of historical institutional term?"

Eating it

A root-finding algorithm is a numerical method, or algorithm, for finding a value. Finding a root of f(x) − g(x) = 0 is the same as solving the equation f(x) = g(x).

public class Check5Divisbility { public String checkDiv(int x){ if(x%5 == 0){ return "Yes" } else { return "No" } } } the above method checkDiv can be used to check if the input number 'x' is divisible by 5 or not. The method will return Yes if the number is divisible and No if it is not divisible

Why would you want to? I think you need to explain what you are trying to achieve. Incidentally, it's Kirchhoff, not Kirchoff.

People also asked

Featured Questions