[Home]  [Edit this page]  [Recent Changes]  [Special Pages]  [Help
divisible

divisibility

One quantity is said to be '''divisible''' by another quantity if there is an integer factor which, when multiplied by the second quantity, gives exactly the first quantity.

For example, the number 54 is divisible by 7 because there exists an integer factor (in this case, 8) which, when multiplied by 7, gives us exactly 54.

Following this rule, we can say that the number 12 is divisible by the numbers 1, 2, 3, 4, 6 and 12.

Note that all integers are divisible by one. All even integers are divisible by 2. And all integers are divisible by themselves.

In computer calculations, x is divisible by y if the following expression is True:

x mod y = 0


last edited (December 9, 2002) by towercpu, Number of views: 1440, Current Rev: 1

[Edit this page]  [Page history]  [What links here]  [Discuss this topic]  [Printer Friendly]  

Members

Username:

Password:


Register
Forgot Password?




Programmers Heaven - for .NET, Java, C/C++ and WEB Developers!
© 1996-2008 Community Networks Ltd. All rights reserved. Reproduction in whole or in part, in any form or medium without express written permission is prohibited. Violators of this policy may be subject to legal action. Please read Terms Of Use and Privacy Statement for more information. Development by Tore Nestenius at .NET Consultant - Synchron Data.