GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Java-Programs/Basic-Programs/Perfect.java at master · divScorp/Java-Programs

Expand file tree

/

Perfect.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
34 lines (32 loc) · 834 Bytes
/

Perfect.java

Copy path

File metadata and controls

34 lines (32 loc) · 834 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
import java.util.Scanner;
/*
perfect Number between 1-N
*/
public class Perfect {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Enter the no. - ");
long n=in.nextInt();
int i;
for(i = 2; i < n; i++) {
if(isNumPerfect(i)) {
System.out.println(i + " is a perfect number");
}
}
in.close();
}
public static boolean isNumPerfect(int i) {
boolean isPerfect = false;
int sum = 1;
int x;
for(x = 2; x <= i / 2; x++) {
if(i % x == 0) {
sum += x;
}
}
if(sum == i) {
isPerfect = true;
}
return isPerfect;
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.