Fibonacci Prime | Write a program in Java to print the Fibonacci Primes | ICSE Computer Application | ISC Computer Science

Posted by on



Algorithm

  1.   Start
  2. x:=0
  3. y:=0
  4. z:=0
  5. If x<=1, go to step 6 or else go to step 11
  6. Print "Enter the end point of the Fibbonacci Series"
  7. Read x
  8. If x<=1, go to step 9 or else go to step 10
  9. Print "Invalid Value. Try Again."
  10. Go to step 5
  11. y:=0
  12. z:=1
  13. If y<=x, go to step 14 or else go to step 28
  14. a=y
  15. count:=0
  16. If a>1, go to step 17 or else go to step 24
  17. i=2
  18. If i<a, go to step 19 or else go to step 22
  19. If a%i==0, go to step 20 or else go to step 21
  20. count++
  21. i++. Go to step 18
  22. If count==0, go to step 23 or else go to step 24
  23. Print y+", "
  24. sum=y+z
  25. y=z
  26. z=sum
  27. Go to step 13
  28. Stop

Program

Buffered Reader

import java.io.*;
class FibonacciPrimes
{

    int x, y, z;

    void accept() throws IOException
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        while (x<=1)
        {
            System.out.println("Enter the end point of the Fibonacci Series");
            x=Integer.parseInt(br.readLine());
            if(x<=1)
            {
                System.out.println("Invalid Value. Try Again");
            }
        }
        y=0;
        z=1;
    }

    boolean isPrime(int a)
    {
        int count = 0;
        if(a>1)
        {
            for(int i=2;i<a;i++)
            {
                if(a%i==0)
                {
                    count++;
                }
            }
            if(count==0)
            {
                return true;
            }
            else
            {
                return false;
            }
        }
        else
        {
            return false;
        }
    }

    void display()
    {
        while(y<=x)
        {
            if(isPrime(y)==true)
            {
                System.out.print(y+", ");
            }
            int sum=y+z;
            y=z;
            z=sum;
        }
    }

    void main() throws IOException
    {
        accept();
        display();
    }
}

Scanner

import java.util.*;
class FibonacciPrimes
{

    int x, y, z;

    void accept() 
    {
        Scanner sc=new Scanner(System.in);
        while (x<=1)
        {
            System.out.println("Enter the end point of the Fibonacci Series");
            x=sc.nextInt();
            if(x<=1)
            {
                System.out.println("Invalid Value. Try Again");
            }
        }
        y=0;
        z=1;
    }

    boolean isPrime(int a)
    {
        int count = 0;
        if(a>1)
        {
            for(int i=2;i<a;i++)
            {
                if(a%i==0)
                {
                    count++;
                }
            }
            if(count==0)
            {
                return true;
            }
            else
            {
                return false;
            }
        }
        else
        {
            return false;
        }
    }

    void display()
    {
        while(y<=x)
        {
            if(isPrime(y)==true)
            {
                System.out.print(y+", ");
            }
            int sum=y+z;
            y=z;
            z=sum;
        }
    }

    void main() 
    {
        accept();
        display();
    }
}

Documentation

Variable Description

 Data Type Variable NameDescription
 intx To store the end value of series 
 inty To store the value to be displayed 
 intz To store the previous value of the fibonacci series 
 int sum To store the sum of previous terms of series 
 intcount To count the number of factors except one and itself 
 inta To parse a value to a method 
 inti To act as a counter variable 

Method Description

 Return TypeMethod NameDescription
 voidaccept() To accept data from the user 
 voiddisplay() To display the fibonacci primes 
 booleanisPrime(int) To check whether the argument is a prime number or not 
 voidmain() To call all the functions in the correct order 

Output


Image is Unavailable

Image is Unavailable




Share with all ISC Computer Science Students you know.

Comment below with all your program requests and blog suggestions.

Follow us on social media by clicking on these links. 
Instagram : @IscJavaCode
Twitter: @IscCode
Quora: ISC Java Code
Pinterest: @ISCJavaCode
Facebook: @ISCJavaCode


Stay Healthy
Stay Happy
Stay Helpful


Comments

Post a Comment

You might also like:

Conversion of Complex Sentences to Simple Sentences

In this blog, we shall look at the various methods applied for the conversion of a Complex Sentences to Simple Sentences . The following examples have been taken from the english language textbook prescribed for ISC students studying in class 11. Use these as practice and climb your stepping stones to better grammar! A complex sentences can be converted to a simple sentence by changing a noun clause, an adjective clause or an adverb clause, as shown below: Noun Clause Complex:Tell me where you live. Simple:Tell me your address. Complex:That you should be present is essential. Simple:Your presence is essential. Adjective Clause Complex:Time which is once lost is lost forever. Simple:Time once lost is lost forever. Complex:I have no advice that I can offer you. Simple: I have no advice to offer you. Adverb Clause Complex:When he had finished his work, he went out to play. Simple:Having finished his work, he went out to play. Complex:If I make a promise, I will ke

Conversion of Compound Sentences to Complex Sentences.

In this blog, we shall see the rules and guidelines that govern the conversion of compound sentences to complex sentences. The examples given below are taken from the assignment given in section B of Unit 2 in the English Language textbook prescribed for ISC class 11.  It is possible to change a Compound Sentence to a Complex sentence by changing one of the Coordinate Clauses to a Subordinate Clause. Coordinate Clause-  one of two or more clauses in a sentence that are of equal importance and usually joined by  and, or , or  but. Subordinate clause -  a clause, typically introduced by a conjunction, that forms part of and is dependent on a main clause. Compound: He is industrious but he is dull. Complex:He is industrious though he is dull. Compound:Act on my advice or you will come to grief. Complex:If you do not act on my advice, you will come to grief. Assignment Compound:Ask no questions and you will hear no lies. Complex: If you ask no questions, you will hear no

Conversion of Complex Sentences to Compound Sentences

In this blogpost, we shall see the rules and guidelines that determine the conversion of Complex Sentences to Compound Sentences. The given examples have been taken from part B of Unit 2 in the English Language textbook prescribed for ISC class 11. We can change a Complex Sentence to a Compound Sentence by changing a Subordinate Clause into a Coordinate Clause. Coordinate Clause-  one of two or more clauses in a sentence that are of equal importance and usually joined by  and, or , or  but. Subordinate clause -  a clause, typically introduced by a conjunction, that forms part of and is dependent on a main clause. Complex: I have now found the pen that I had lost. Compound:I had lost the pen, but I have found it now. Complex: As soon as he saw the monkey, he ran away. Compound:He saw the monkey, and at once he ran away. Assignment Complex: If you do not run, you will not be in time. Compound: Run, or you will not be in time. Complex: She went away beca