KEMBAR78
KNA-10 Number Property Checker Using JFrame | PDF
Scribd
Upload
29 views10 pages

KNA-10 Number Property Checker Using JFrame

The document outlines a programming assignment focused on number properties using JFrame. It includes definitions and examples for Armstrong numbers, Strong numbers, Friendly pairs, and Abundant numbers, along with a simple addition operation. The assignment is submitted by a student named Praveen Biradar with ID KODD8KS8I.

Uploaded by

shravanmb163
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views10 pages

KNA-10 Number Property Checker Using JFrame

The document outlines a programming assignment focused on number properties using JFrame. It includes definitions and examples for Armstrong numbers, Strong numbers, Friendly pairs, and Abundant numbers, along with a simple addition operation. The assignment is submitted by a student named Praveen Biradar with ID KODD8KS8I.

Uploaded by

shravanmb163
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Number Property Checker Using JFrame

10.Assignment Submission
Student Name: Praveen Biradar
ID: KODD8KS8I

1.Take a number as input and check whether it is an Armstrong number or not.

An Armstrong Number (also called a Narcissistic Number) is a number where the sum of its digits, each
raised to the power of the total number of digits, equals the original number.

Example:

1. 153 (3-digit number)


13+53+33=1+125+27=1531^3 + 5^3 + 3^3 = 1 + 125 + 27 = 15313+53+33=1+125+27=153

Since the sum is equal to the original number, 153 is an Armstrong number.
2. Take a number as input and check whether it is an Strong number or not.

A Strong Number is a number where the sum of the factorials of its digits is equal to the original number.

Example:

1. 145

1!+4!+5!=1+24+120=1451! + 4! + 5! = 1 + 24 + 120 = 1451!+4!+5!=1+24+120=145


3. Take 2 input and check whether it is an Friendly Pair number or not.

A friendly pair, also known as amicable numbers, is a pair of positive integers where the sum of the proper divisors
of one number equals the other number, and vice versa. Proper divisors are all the divisors of a number excluding
the number itself.

Example

For input numbers 220 and 284:

• Sum of proper divisors of 220 = 1 + 2 + 4 + 5 + 10 + 11 + 20 + 22 + 44 + 55 + 110 = 284


• Sum of proper divisors of 284 = 1 + 2 + 4 + 71 + 142 = 220
4. Take a number as input and check whether it is an Abundant number or not.
An abundant number is a positive integer for which the sum of its proper divisors (all divisors excluding the
number itself) is greater than the number.

For example, consider the number 12.

Its proper divisors are 1, 2, 3, 4, and 6, and their sum is 16, which is greater than 12. Hence,

12 is an abundant number.
5. Addition of two numbers

You might also like