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/PerfectNumber.java at master · tmluwei/Java Expand file tree/ Copy pathPerfectNumber.javaMore file actions 32 lines (30 loc) · 997 Bytes / Copy pathPerfectNumber.javaFile metadata and controls32 lines (30 loc) · 997 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, a perfect number is a positive integer that is equal to the sum of its positive * divisors, excluding the number itself. For instance, 6 has divisors 1, 2 and 3 (excluding * itself), and 1 + 2 + 3 = 6, so 6 is a perfect number. * * <p>link:https://en.wikipedia.org/wiki/Perfect_number */ public class PerfectNumber { public static void main(String[] args) { assert isPerfectNumber(6); /* 1 + 2 + 3 == 6 */ assert !isPerfectNumber(8); /* 1 + 2 + 4 != 8 */ assert isPerfectNumber(28); /* 1 + 2 + 4 + 7 + 14 == 28 */ } /** * Check if {@code number} is perfect number or not * * @param number the number * @return {@code true} if {@code number} is perfect number, otherwise false */ public static boolean isPerfectNumber(int number) { int sum = 0; /* sum of its positive divisors */ for (int i = 1; i < number; ++i) { if (number % i == 0) { sum += i; } } return sum == number; } } |
| 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. |