Prime, Fibonacci and Factorial number with example in java
Prime number, Fibonacci series and Factorial number programs are most commonly asked questions in interview. Read this article to know what is and how to write programs for prime number, fibonacci series and factorial number.
Prime Number: prime number is natural number greater than 1 that has no positive divisor other than 1 and itself. A natural number greater than 1 is not a prime number, is called Composite number. For example, 7 is a prime number. Because it can divide with 1 and 7 only. Where as 8 is composite number. Since it has the divisor 2 and 4 in addition to the 1 and 8.
The below example represents the finding the passing number is prime number or not. If the passing number is prime number it will print true otherwise it will print false.
package com.javatbrains.practice;publicclassPrimeNumber{publicbooleanisPrimeNumber(int number){if(number <=1)returnfalse;// There's only one even prime: that is twoif((number %2)==0)return(number ==2);int from =(int)(Math.sqrt(numb…
Prime Number: prime number is natural number greater than 1 that has no positive divisor other than 1 and itself. A natural number greater than 1 is not a prime number, is called Composite number. For example, 7 is a prime number. Because it can divide with 1 and 7 only. Where as 8 is composite number. Since it has the divisor 2 and 4 in addition to the 1 and 8.
The below example represents the finding the passing number is prime number or not. If the passing number is prime number it will print true otherwise it will print false.
package com.javatbrains.practice;publicclassPrimeNumber{publicbooleanisPrimeNumber(int number){if(number <=1)returnfalse;// There's only one even prime: that is twoif((number %2)==0)return(number ==2);int from =(int)(Math.sqrt(numb…
Comments
Post a Comment