GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Maths/AliquotSum.java at master · tmluwei/Java Expand file tree/ Copy pathAliquotSum.javaMore file actions 32 lines (30 loc) · 963 Bytes / Copy pathAliquotSum.javaFile metadata and controls32 lines (30 loc) · 963 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 package Maths; /** * In number theory, the aliquot sum s(n) of a positive integer n is the sum of all proper divisors * of n, that is, all divisors of n other than n itself. For example, the proper divisors of 15 * (that is, the positive divisors of 15 that are not equal to 15) are 1, 3 and 5, so the aliquot * sum of 15 is 9 i.e. (1 + 3 + 5). Wikipedia: https://en.wikipedia.org/wiki/Aliquot_sum */ public class AliquotSum { public static void main(String[] args) { assert aliquotSum(1) == 0; assert aliquotSum(6) == 6; assert aliquotSum(15) == 9; assert aliquotSum(19) == 1; } /** * Finds the aliquot sum of an integer number * * @param number a positive integer * @return aliquot sum of given {@code number} */ public static int aliquotSum(int number) { int sum = 0; for (int i = 1, limit = number / 2; i <= limit; ++i) { if (number % i == 0) { sum += i; } } return sum; } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |