Scribd
Upload
2 views2 pages

Icse Class 10

The document outlines a series of Java programming tasks for ICSE Class 10, focusing on various mathematical concepts. It includes programs to check for perfect squares, composite numbers, HCF & LCM, divisibility rules, and more, with definitions and examples provided for each concept. The tasks also cover advanced number types such as Armstrong, Kaprekar, and Vampire numbers.

Uploaded by

rudranshsinghraizada
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
2 views2 pages

Icse Class 10

The document outlines a series of Java programming tasks for ICSE Class 10, focusing on various mathematical concepts. It includes programs to check for perfect squares, composite numbers, HCF & LCM, divisibility rules, and more, with definitions and examples provided for each concept. The tasks also cover advanced number types such as Armstrong, Kaprekar, and Vampire numbers.

Uploaded by

rudranshsinghraizada
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/ 2

ICSE CLASS 10 ( JAVA PROGRAM ) Write a Java program to check if a number is a perfect square or

cube.
Definition:
1. Composite Number
• Square: Integer square root exists (e.g., 16=4²).
Write a Java program to check whether a number is a Composite
Number. • Cube: Integer cube root exists (e.g., 27=3³).
Definition: A positive integer with at least one divisor other than 1 and
6. Co-prime Numbers
itself.
Example: 4, 6, 8, 9. Write a Java program to check if two numbers are co-prime.
Definition: Numbers with HCF = 1.
2. HCF & LCM
Example: 8 and 15.
Write a Java program to find HCF and LCM of two numbers.
7. Triangular Number
Definition:
Write a Java program to check if a number is triangular.
• HCF: Largest number dividing two or more numbers.
Definition: Sum of natural numbers up to n (e.g., 6=1+2+3).
• LCM: Smallest number divisible by two or more numbers.
8. Armstrong Number
Example: HCF of 12 and 18 is 6; LCM is 36.
Write a Java program to check if a number is Armstrong.
3. Divisibility Rules
Definition: Sum of digits^digit count equals the number.
Write a Java program to check divisibility by 2, 3, 5, etc. Example: 153 (1³ + 5³ + 3³ = 153).
Definition: Rules to test divisibility without full division.
9. Palindrome Number
Example: 27 is divisible by 3 (2+7=9, 9÷3=3).
Write a Java program to check if a number is a palindrome.
4. Even/Odd Number
Definition: Reads the same backward (e.g., 121).
Write a Java program to check if a number is even or odd.
10. Lychrel Number
Definition: Even if divisible by 2; otherwise, odd.
Example: 2 (even), 3 (odd). Write a Java program to check if a number is Lychrel.
Definition: Does not form a palindrome after reversal-addition
5. Perfect Square/Cube
iterations.
Example: 196 (suspected).
11. Automorphic Number Write a Java program to check if a number is Vampire.
Definition: Even-digit composite number with factors of half its digits.
Write a Java program to check if a number is automorphic.
Example: 1260 (21 × 60).
Definition: Square ends with the number itself.
Example: 25 (25² = 625). 18. Harshad Number

12. Kaprekar Number Write a Java program to check if a number is Harshad.


Definition: Divisible by the sum of its digits.
Write a Java program to check if a number is Kaprekar.
Example: 18 (1+8=9; 18÷9=2).
Definition: Square splits into two parts that sum to the original number.
Example: 45 (45²=2025 → 20+25=45). 19. Strobogrammatic Number

13. Spy Number Write a Java program to check if a number is strobogrammatic.


Definition: Looks the same when rotated 180° (e.g., 69 ↔ 96).
Write a Java program to check if a number is a Spy Number.
Definition: Sum of digits = Product of digits. 20. Nonary Number
Example: 123 (1+2+3 = 1×2×3 = 6).
Write a Java program to convert a decimal number to Nonary (base-
14. Adam Number 9).
Example: 9 (decimal) → 10 (nonary).
Write a Java program to check if a number is Adam.
Definition: Square of reversed number = Reverse of square. 21. Bernoulli Number
Example: 12 (12²=144 ↔ 21²=441).
Write a Java program to generate Bernoulli numbers.
15. Sunny Number Definition: Rational sequence in number theory.
Example: B₁ = -½, B₂ = ⅙.
Write a Java program to check if a number is Sunny.
Definition: n+1 is a perfect square. 22. Padovan Number
Example: 8 (8+1=9=3²).
Write a Java program to generate Padovan sequence numbers.
16. Keith Number Definition: P(n) = P(n−2) + P(n−3).
Example: 1, 1, 1, 2, 2, 3, 4, 5.
Write a Java program to check if a number is Keith.
Definition: Appears in a Fibonacci-like recurrence sequence.
Example: 197.

17. Vampire Number

You might also like