Program to Check Number is a Prime, Armstrong, or Perfect Square using For loop
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using For loop in C
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using For loop in C++
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using For loop in Python
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using For loop in PHP
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using For loop in Java
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using For loop in Java Script
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using For loop in C#
Explanation:
- Prime Check:
- A number less than 2 is not prime.
- Iterate from 2 to the square root of the number. If the number is divisible by any of these, it’s not prime.
- Armstrong Check:
- Convert the number to a string to iterate through its digits.
- Calculate the sum of each digit raised to the power of the total number of digits.
- If the sum equals the original number, it’s an Armstrong number.
- Perfect Square Check:
- Iterate from 0 to the number.
- Check if the square of the current number equals the input number.
- Exit early if the square exceeds the input number.
This approach is straightforward and uses for loops for all checks.
Program to Check Number is a Prime, Armstrong, or Perfect Square using For loop
-
C
-
C++
-
Python
-
PHP
-
JAVA
-
Java Script
-
C#
#include <stdio.h> #include <math.h> // Function to check Prime int is_prime(int num) { if (num <= 1) return 0; for (int i = 2; i <= sqrt(num); i++) { if (num % i == 0) return 0; } return 1; } // Function to check Armstrong int is_armstrong(int num) { int sum = 0, temp = num, digit; while (temp > 0) { digit = temp % 10; sum += digit * digit * digit; temp /= 10; } return sum == num; } // Function to check Perfect Square int is_perfect_square(int num) { for (int i = 1; i * i <= num; i++) { if (i * i == num) return 1; } return 0; } int main() { int n; printf("Enter a number: "); scanf("%d", &n); if (is_prime(n)) printf("%d is a Prime Number.\n", n); else printf("%d is not a Prime Number.\n", n); if (is_armstrong(n)) printf("%d is an Armstrong Number.\n", n); else printf("%d is not an Armstrong Number.\n", n); if (is_perfect_square(n)) printf("%d is a Perfect Square.\n", n); else printf("%d is not a Perfect Square.\n", n); return 0; }
#include <iostream> #include <cmath> using namespace std; // Function to check Prime bool is_prime(int num) { if (num <= 1) return false; for (int i = 2; i <= sqrt(num); i++) { if (num % i == 0) return false; } return true; } // Function to check Armstrong bool is_armstrong(int num) { int sum = 0, temp = num, digit; while (temp > 0) { digit = temp % 10; sum += pow(digit, 3); temp /= 10; } return sum == num; } // Function to check Perfect Square bool is_perfect_square(int num) { for (int i = 1; i * i <= num; i++) { if (i * i == num) return true; } return false; } int main() { int n; cout << "Enter a number: "; cin >> n; if (is_prime(n)) cout << n << " is a Prime Number." << endl; else cout << n << " is not a Prime Number." << endl; if (is_armstrong(n)) cout << n << " is an Armstrong Number." << endl; else cout << n << " is not an Armstrong Number." << endl; if (is_perfect_square(n)) cout << n << " is a Perfect Square." << endl; else cout << n << " is not a Perfect Square." << endl; return 0; }
def is_prime(num): if num <= 1: return False for i in range(2, int(num**0.5) + 1): if num % i == 0: return False return True def is_armstrong(num): sum_of_cubes = 0 temp = num while temp > 0: digit = temp % 10 sum_of_cubes += digit**3 temp //= 10 return sum_of_cubes == num def is_perfect_square(num): for i in range(1, num + 1): if i * i == num: return True if i * i > num: break return False n = int(input("Enter a number: ")) if is_prime(n): print(f"{n} is a Prime Number.") else: print(f"{n} is not a Prime Number.") if is_armstrong(n): print(f"{n} is an Armstrong Number.") else: print(f"{n} is not an Armstrong Number.") if is_perfect_square(n): print(f"{n} is a Perfect Square.") else: print(f"{n} is not a Perfect Square.")
<?php function is_prime($num) { if ($num <= 1) return false; for ($i = 2; $i <= sqrt($num); $i++) { if ($num % $i == 0) return false; } return true; } function is_armstrong($num) { $sum = 0; $temp = $num; while ($temp > 0) { $digit = $temp % 10; $sum += $digit ** 3; $temp = (int)($temp / 10); } return $sum == $num; } function is_perfect_square($num) { for ($i = 1; $i * $i <= $num; $i++) { if ($i * $i == $num) return true; } return false; } $n = (int)readline("Enter a number: "); if (is_prime($n)) echo "$n is a Prime Number.\n"; else echo "$n is not a Prime Number.\n"; if (is_armstrong($n)) echo "$n is an Armstrong Number.\n"; else echo "$n is not an Armstrong Number.\n"; if (is_perfect_square($n)) echo "$n is a Perfect Square.\n"; else echo "$n is not a Perfect Square.\n"; ?>
import java.util.Scanner; public class CheckNumber { public static boolean isPrime(int num) { if (num <= 1) return false; for (int i = 2; i <= Math.sqrt(num); i++) { if (num % i == 0) return false; } return true; } public static boolean isArmstrong(int num) { int sum = 0, temp = num, digit; while (temp > 0) { digit = temp % 10; sum += Math.pow(digit, 3); temp /= 10; } return sum == num; } public static boolean isPerfectSquare(int num) { for (int i = 1; i * i <= num; i++) { if (i * i == num) return true; } return false; } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print("Enter a number: "); int n = scanner.nextInt(); if (isPrime(n)) System.out.println(n + " is a Prime Number."); else System.out.println(n + " is not a Prime Number."); if (isArmstrong(n)) System.out.println(n + " is an Armstrong Number."); else System.out.println(n + " is not an Armstrong Number."); if (isPerfectSquare(n)) System.out.println(n + " is a Perfect Square."); else System.out.println(n + " is not a Perfect Square."); scanner.close(); } }
function isPrime(num) { if (num <= 1) return false; for (let i = 2; i <= Math.sqrt(num); i++) { if (num % i === 0) return false; } return true; } function isArmstrong(num) { let sum = 0, temp = num; while (temp > 0) { let digit = temp % 10; sum += Math.pow(digit, 3); temp = Math.floor(temp / 10); } return sum === num; } function isPerfectSquare(num) { for (let i = 1; i * i <= num; i++) { if (i * i === num) return true; } return false; } let n = parseInt(prompt("Enter a number: ")); if (isPrime(n)) console.log(`${n} is a Prime Number.`); else console.log(`${n} is not a Prime Number.`); if (isArmstrong(n)) console.log(`${n} is an Armstrong Number.`); else console.log(`${n} is not an Armstrong Number.`); if (isPerfectSquare(n)) console.log(`${n} is a Perfect Square.`); else console.log(`${n} is not a Perfect Square.`);
using System; class Program { static bool IsPrime(int num) { if (num <= 1) return false; for (int i = 2; i <= Math.Sqrt(num); i++) { if (num % i == 0) return false; } return true; } static bool IsArmstrong(int num) { int sum = 0, temp = num, digit; while (temp > 0) { digit = temp % 10; sum += (int)Math.Pow(digit, 3); temp /= 10; } return sum == num; } static bool IsPerfectSquare(int num) { for (int i = 1; i * i <= num; i++) { if (i * i == num) return true; } return false; } static void Main() { Console.Write("Enter a number: "); int n = int.Parse(Console