Scribd Logo
Upload

Welcome to Scribd!

  • 67 views

    Kpit Solutions 1. Recursion of No.: @placement - Fellas On Telegram

    Uploaded by

    Ajay YA
    This document contains code snippets for two Java programs. The first program uses recursion to calculate the sum of all numbers from 1 to a given number. The second program checks if a number is a "perfect number" by calculating the sum of its proper divisors and comparing it to the original number. Both programs print the results.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Kpit Solutions 1. Recursion of No.: @placement - Fellas On Telegram

    Uploaded by

    Ajay YA
    67 views2 pages
    This document contains code snippets for two Java programs. The first program uses recursion to calculate the sum of all numbers from 1 to a given number. The second program checks if a number is a "perfect number" by calculating the sum of its proper divisors and comparing it to the original number. Both programs print the results.

    Original Title

    Kpit Codes

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains code snippets for two Java programs. The first program uses recursion to calculate the sum of all numbers from 1 to a given number. The second program checks if a number is a "perfect number" by calculating the sum of its proper divisors and comparing it to the original number. Both programs print the results.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    67 views2 pages

    Kpit Solutions 1. Recursion of No.: @placement - Fellas On Telegram

    Uploaded by

    Ajay YA
    This document contains code snippets for two Java programs. The first program uses recursion to calculate the sum of all numbers from 1 to a given number. The second program checks if a number is a "perfect number" by calculating the sum of its proper divisors and comparing it to the original number. Both programs print the results.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    FOR MORE MATERIALS AND OFF CAMPUS DATES

    JOIN PLACEMENT FELLAS ON TELEGRAM (CLICK HERE)


    Kpit solutions

    1. Recursion of no.

    public class AddNumbers {

    public static void main(String[] args) {


    int number = 20;
    int sum = addNumbers(number);
    System.out.println("Sum = " + sum);
    }

    public static int addNumbers(int num) {


    if (num != 0)
    return num + addNumbers(num - 1);
    else
    return num;
    }
    }

    2.PERFECT NUMBER
    Class number{
    {
    @PLACEMENT_FELLAS ON TELEGRAM
    FOR MORE MATERIALS AND OFF CAMPUS DATES
    JOIN PLACEMENT FELLAS ON TELEGRAM (CLICK HERE)

    static boolean isPerfect(int n)


    {
    int sum = 1;
    for (int i = 2; i * i <= n; i++)
    {
    if (n % i==0)
    {
    if(i * i != n)
    sum = sum + i + n / i;
    else
    sum = sum + i;
    }
    }
    if (sum == n && n != 1)
    return true;
    return false;
    }
    public static void main (String[] args)
    {
    System.out.println("Below are all perfect" +
    "numbers till 10000");
    for (int n = 2; n < 10000; n++)
    if (isPerfect(n))
    System.out.println( n +
    " is a perfect number");
    }
    }

    @PLACEMENT_FELLAS ON TELEGRAM

    You might also like