/**
* Write a Java program to display first N Lucas numbers. ( 3>N>100 )
The Lucas numbers or series are integer sequences named after the mathematician François Édouard Anatole Lucas,
who studied both that sequence and the closely related Fibonacci numbers.
Lucas numbers and Fibonacci numbers form complementary instances of Lucas sequences.
The sequence of Lucas numbers : 2, 1, 3, 4, 7, 11, 18, 29, ….
*/
import java.util.*;
public class Lucas
{
public static void lucas(int x, int a, int b) //recursive function to display lucas series
{
if(x==0)
System.out.println();
else
{
int c=a+b;
a=b;
b=c;
System.out.print(", "+c);
lucas(x-1,a,b);
}
} // end of lucas()
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.print("\nEnter number of terms : ");
int N=sc.nextInt();
if(N>3 && N<100)
{
System.out.println("\nThe sequence of "+N+" Lucas numbers are : ");
System.out.print(" 2, 1");
lucas(N-2,2,1);
}
else
{
System.out.println("OUT OF RANGE.");
}
} // end of main
} // end of class
Q.10 WAP in C/ C++/ java to check whether a number is a Harshad Number or not. In recreational mathematics, a Harshad number in a given number base is an integer that is divisible by the sum of its digits when written in that base. Example: Number 200 is a Harshad Number because the sum of digits 2 and 0 and 0 is 2(2+0+0) and 200 is divisible by 2. Number 171 is a Harshad Number because the sum of digits 1 and 7 and 1 is 9(1+7+1) and 171 is divisible by 9. Solution : #include <stdio.h> int sumofdigits ( int x) // function to compute sum of digits { int sum = 0 ; while (x > 0 ) { sum += x % 10 ; x = x / 10 ; } return sum ; } void main () { int n , sod ; printf ( " \n Enter any positive number : " ); scanf ( " %d " , & n ); if ( n < 0 ) { printf ( " \n Invalid input! Enter the value again -->" ); main (); // calls the m
Comments
Post a Comment