{"id":18536737,"url":"https://github.com/aneeshlalwani/number-programs-in-java","last_synced_at":"2025-05-15T01:13:29.936Z","repository":{"id":216601089,"uuid":"741755689","full_name":"aneeshlalwani/number-programs-in-java","owner":"aneeshlalwani","description":"This Repository contains a \"Number Program\". These programs are solved in \"Java\"","archived":false,"fork":false,"pushed_at":"2024-02-17T17:45:21.000Z","size":43,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-17T07:41:54.825Z","etag":null,"topics":["builtin-functions","do-while-loop","for-loop","if-else-statements","if-elseif-else","java","logic","methods","while-loop"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/aneeshlalwani.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-01-11T03:28:14.000Z","updated_at":"2024-02-01T06:40:31.000Z","dependencies_parsed_at":"2024-11-06T19:37:55.121Z","dependency_job_id":"35fc2db2-7d3c-446f-984c-f8a63e4af7ba","html_url":"https://github.com/aneeshlalwani/number-programs-in-java","commit_stats":null,"previous_names":["aneeshlalwani/java-number-programs","aneeshlalwani/jnumber-programs-java"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aneeshlalwani%2Fnumber-programs-in-java","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aneeshlalwani%2Fnumber-programs-in-java/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aneeshlalwani%2Fnumber-programs-in-java/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aneeshlalwani%2Fnumber-programs-in-java/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aneeshlalwani","download_url":"https://codeload.github.com/aneeshlalwani/number-programs-in-java/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254254024,"owners_count":22039792,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["builtin-functions","do-while-loop","for-loop","if-else-statements","if-elseif-else","java","logic","methods","while-loop"],"created_at":"2024-11-06T19:35:41.547Z","updated_at":"2025-05-15T01:13:29.895Z","avatar_url":"https://github.com/aneeshlalwani.png","language":"Java","readme":"# Number Programs in Java\n\n## 1. Factorial of Number\nA factorial is a mathematical function, which is applied to a non-negative integer. \nFor a given positive integer \"n,\" the factorial is the product of all positive integers less than or equal to \"n.\"\n\n## 2. Larget Among N Digits\nAn array of integer is provided, from that program would find a largest number among the elements of an array. \n\n## 3. Prime Number\nA prime number is a number that is divisible only by 1 and itself. For example: 5 is a prime number as it is divisible by 1 and 5, \nand 6 is not a prime number as it is divisible by 1,2,3, and 6.\n  ### There are two progams of prime numbers with different logic in this repository\n      PrimeNumberLogicOne.java and PrimeNumberLogicTwo.java \n\n## 4. Palindrome String\nA palindrome is a sequence of characters that reads the same forward as backward, disregarding spaces, punctuation, and capitalization.\n In other words, a palindrome remains unchanged when its characters are reversed. For example \"level\", \"civic\", \"radar\" \n\n## 5. Fibonacci Series\nThe Fibonacci series is a sequence of numbers in which each number (Fibonacci number) is the sum of the two preceding ones, \nusually starting with 0 and 1. The sequence goes: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on.\n\n## 6. Pascal Triangle\nPascal's Triangle is a mathematical arrangement of numbers named after the French mathematician Blaise Pascal. \nIt starts with a single number 1 at the top, and each subsequent row is constructed by summing up the two numbers directly above a particular number in the row.\n\n## 7. Leap Year\nA leap year is a year with an extra day, February 29, occurring every four years to synchronize the calendar with the Earth's orbit around the sun.\nExample: 2024 is a leap year, because It contains a february 29, and 2023 is NOT a leap year, because It does not contain a February 29.\n\n## 8. Perfect Number\nA perfect number is a positive integer equal to the sum of its divisors, excluding itself. For instance, 28 is a perfect number because 1 + 2 + 4 + 7 + 14 = 28.\n\n## 9. ArmStrong Number\nAn Armstrong number, also known as a narcissistic number, is a special type of integer. It is equal to the sum of its own digits, each raised to the power of the number of digits.\nFor example, let's consider the number 153: 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153. \n153 is an Armstrong number because the sum of the cubes of its digits equals the number itself.\n\n## 10. Strong Number\nA strong number, also known as a digital factorial, is a number whose sum of factorial digits equals the number itself. In general, if a number 'n' is a strong number, \nthe sum of the factorials of its digits will be equal to 'n'.\nFor example, let's consider the number 145: 1! + 4! + 5! = 1 + 24 + 120 = 145. Hence 145 is a Strong Number.\n\n## 11. Neon Number\nA neon number is a number where the sum of digits of square of the number is equal to the number itself. For Example: 9 is a neon number. It's square is 9 * 9 = 81, and sum of the digits 8 + 1 = 9\n1 is also a neon number\nNOTE: Except 1 and 9 there are no more neon numbers between 1 and n.\n\n## 12. Automorphic Number\nAn automorphic number is a number whose square ends in the same digits as the number itself. for example: 5, 6, 25 are automorphic numbers.\n5 * 5 = 25 --\u003e last digit is 5, 6 * 6 = 36 --\u003e last digit is 6, 25 * 25 = 625 --\u003e last digit is 25\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faneeshlalwani%2Fnumber-programs-in-java","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faneeshlalwani%2Fnumber-programs-in-java","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faneeshlalwani%2Fnumber-programs-in-java/lists"}