Program to Check Number is a Prime, Armstrong, or Perfect Square using While loop
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using While loop in C
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using While loop in C++
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using While loop in Python
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using While loop in PHP
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using While loop in Java
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using While loop in Java Script
- Write a program to Check Number is a Prime, Armstrong, or Perfect Square using While 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 While loop
-
C
-
C++
-
Python
-
PHP
-
JAVA
-
Java Script
-
C#
#include <stdio.h> #include <math.h> // Function to check if a number is Prime int isPrime(int num) { if (num < 2) return 0; int i = 2; while (i <= sqrt(num)) { if (num % i == 0) return 0; i++; } return 1; } // Function to check if a number is Armstrong int isArmstrong(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 if a number is Perfect Square int isPerfectSquare(int num) { int i = 1; while (i * i <= num) { if (i * i == num) return 1; i++; } return 0; } int main() { int num; printf("Enter a number: "); scanf("%d", &num); if (isPrime(num)) { printf("%d is a Prime number.\n", num); } else { printf("%d is not a Prime number.\n", num); } if (isArmstrong(num)) { printf("%d is an Armstrong number.\n", num); } else { printf("%d is not an Armstrong number.\n", num); } if (isPerfectSquare(num)) { printf("%d is a Perfect Square.\n", num); } else { printf("%d is not a Perfect Square.\n", num); } return 0; }
#include <iostream> #include <cmath> using namespace std; bool isPrime(int num) { if (num < 2) return false; int i = 2; while (i <= sqrt(num)) { if (num % i == 0) return false; i++; } return true; } bool isArmstrong(int num) { int sum = 0, temp = num, digit; while (temp > 0) { digit = temp % 10; sum += digit * digit * digit; temp /= 10; } return (sum == num); } bool isPerfectSquare(int num) { int i = 1; while (i * i <= num) { if (i * i == num) return true; i++; } return false; } int main() { int num; cout << "Enter a number: "; cin >> num; if (isPrime(num)) { cout << num << " is a Prime number.\n"; } else { cout << num << " is not a Prime number.\n"; } if (isArmstrong(num)) { cout << num << " is an Armstrong number.\n"; } else { cout << num << " is not an Armstrong number.\n"; } if (isPerfectSquare(num)) { cout << num << " is a Perfect Square.\n"; } else { cout << num << " is not a Perfect Square.\n"; } return 0; }
import math def is_prime(num): if num < 2: return False i = 2 while i <= math.sqrt(num): if num % i == 0: return False i += 1 return True def is_armstrong(num): sum_digits = 0 temp = num while temp > 0: digit = temp % 10 sum_digits += digit ** 3 temp //= 10 return sum_digits == num def is_perfect_square(num): i = 1 while i * i <= num: if i * i == num: return True i += 1 return False num = int(input("Enter a number: ")) if is_prime(num): print(f"{num} is a Prime number.") else: print(f"{num} is not a Prime number.") if is_armstrong(num): print(f"{num} is an Armstrong number.") else: print(f"{num} is not an Armstrong number.") if is_perfect_square(num): print(f"{num} is a Perfect Square.") else: print(f"{num} is not a Perfect Square.")
<?php function isPrime($num) { if ($num < 2) return false; $i = 2; while ($i <= sqrt($num)) { if ($num % $i == 0) return false; $i++; } return true; } function isArmstrong($num) { $sum = 0; $temp = $num; while ($temp > 0) { $digit = $temp % 10; $sum += pow($digit, 3); $temp = (int)($temp / 10); } return ($sum == $num); } function isPerfectSquare($num) { $i = 1; while ($i * $i <= $num) { if ($i * $i == $num) return true; $i++; } return false; } $num = intval(readline("Enter a number: ")); if (isPrime($num)) { echo "$num is a Prime number.\n"; } else { echo "$num is not a Prime number.\n"; } if (isArmstrong($num)) { echo "$num is an Armstrong number.\n"; } else { echo "$num is not an Armstrong number.\n"; } if (isPerfectSquare($num)) { echo "$num is a Perfect Square.\n"; } else { echo "$num is not a Perfect Square.\n"; } ?>
<div class="contain-inline-size rounded-md border-[0.5px] border-token-border-medium relative bg-token-sidebar-surface-primary dark:bg-gray-950"><div class="overflow-y-auto p-4" dir="ltr"><code class="!whitespace-pre hljs language-java">import java.util.Scanner; public class Main { static boolean isPrime(int num) { if (num < 2) return false; int i = 2; while (i <= Math.sqrt(num)) { if (num % i == 0) return false; i++; } return true; } static boolean isArmstrong(int num) { int temp = num, sum = 0, digit; while (temp > 0) { digit = temp % 10; sum += digit * digit * digit; temp /= 10; } return sum == num; } static boolean isPerfectSquare(int num) { int i = 1; while (i * i <= num) { if (i * i == num) return true; i++; } return false; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter a number: "); int num = sc.nextInt(); if (isPrime(num)) System.out.println(num + " is a Prime number."); else System.out.println(num + " is not a Prime number."); if (isArmstrong(num)) System.out.println(num + " is an Armstrong number."); else System.out.println(num + " is not an Armstrong number."); if (isPerfectSquare(num)) System.out.println(num + " is a Perfect Square."); else System.out.println(num + " is not a Perfect Square."); } }
function isPrime(num) { if (num < 2) return false; let i = 2; while (i <= Math.sqrt(num)) { if (num % i === 0) return false; i++; } return true; } function isArmstrong(num) { let temp = num, sum = 0; while (temp > 0) { let digit = temp % 10; sum += digit ** 3; temp = Math.floor(temp / 10); } return sum === num; } function isPerfectSquare(num) { let i = 1; while (i * i <= num) { if (i * i === num) return true; i++; } return false; } const num = parseInt(prompt("Enter a number:")); if (isPrime(num)) console.log(`${num} is a Prime number.`); else console.log(`${num} is not a Prime number.`); if (isArmstrong(num)) console.log(`${num} is an Armstrong number.`); else console.log(`${num} is not an Armstrong number.`); if (isPerfectSquare(num)) console.log(`${num} is a Perfect Square.`); else console.log(`${num} is not a Perfect Square.`);
using System; class Program { static bool IsPrime(int num) { if (num < 2) return false; int i = 2; while (i <= Math.Sqrt(num)) { if (num % i == 0) return false; i++; } return true; } static bool IsArmstrong(int num) { int temp = num, sum = 0; while (temp > 0) { int digit = temp % 10; sum += digit * digit * digit; temp /= 10; } return sum == num; } static bool IsPerfectSquare(int num) { int i = 1; while (i * i <= num) { if (i * i == num) return true; i++; } return false; } static void Main(string[] args) { Console.Write("Enter a number: "); int num = int.Parse(Console.ReadLine()); if (IsPrime(num)) Console.WriteLine($"{num} is a Prime number."); else Console.WriteLine($"{num} is not a Prime number."); if (IsArmstrong(num)) Console.WriteLine($"{num} is an Armstrong number."); else Console.WriteLine($"{num} is not an Armstrong number."); if (IsPerfectSquare(num)) Console.WriteLine($"{num} is a Perfect Square."); else Console.WriteLine($"{num} is not a Perfect Square."); } }