Thread: Please Help Me on how to make a program which reads a positive non-zero integer as input and checks i it is perfect, deficient or abundant.

/*A positive, non-zero integer, N, is said to be perfect if the sum of its positive proper divisors is equal to the number itself. If this sum is less than N, the numbers is said to be deficient. If the sum is greater than N, the number is said to be abundant.*/

//I tried to make one which is the one below but it didn't work.
//Please help me, I'm still new to programming, tysm


import java.util.Scanner;
public class *{
public static void main(String[] args){
Scanner kbd = new Scanner(System.in);

System.out.print("Input N: ");
int n = kbd.nextInt();
int i = 1;
int sum = 1;

for(i=1; i<=n; i++){
if (n % i == 0){
sum = sum + i;

if (sum < n)
System.out.print(n + " is abundant.");
else if (sum == n)
System.out.print(n + " is perfect.");
else if (sum > n)
System.out.print(n + " is deficient.");
}
}
}
}

I need to make a java program that will read an input positive integer and then checks if it is a perfect, deficient or abundant number using the for-loop.
for example: 6 is a perfect number since 6=1+2+3; 8 is deficient since 8>1+2+4; 12 is abundant since 12<1+2+3+4+6.

The output expected should be:
Input N: 6
6 is perfect.

But my code's output is:
Input N: 6
6 is abundant.6 is abundant.6 is deficient.6 is deficient.

I want to know where I got it wrong.

This is the code I did

import java.util.Scanner;
public class Perfect{
   public static void main(String[] args){
      Scanner kbd = new Scanner(System.in);
 
      System.out.print("Input N: ");
        int n = kbd.nextInt();
        int i = 1;
        int sum = 1;
 
        for(i=1; i<=n; i++){
            if (n % i == 0){
              sum = sum + i;         
 
               if (sum < n)
                      System.out.print(n + " is abundant.");
                  else if (sum == n)
                      System.out.print(n + " is perfect.");
                     else if (sum > n)
                         System.out.print(n + " is deficient.");           
           } 
        }
   }
}

the number can only be one of them

The integer is perfect if the sum of its positive proper divisors is equal to the number itself.
If this sum is less than the integer, the numbers is deficient.
If the sum is greater than the integer, the number is abundant.

Proper divisors of a number is its factors other than itself.
The program should compute the sum first in order to identify whether the number is perfect, deficient or abundant.

Can you point out, what's wrong with my code? I don't really know what to do