Bunker

Question :

An integer is defined to be a Bunker number if it is an element in the infinite sequence 1, 2, 4, 7, 11, 16, 22, … Note that 2-1=1, 4-2=2, 7-4=3, 11-7=4, 16-11=5 so for k>1, the kth element of the sequence is equal to the k-1th element + k-1. E.G., for k=6, 16 is the kth element and is equal to 11 (the k-1th element) + 5 (k-1).

Write function named isBunker that returns 1 if its argument is a Bunker number, otherwise it returns 0. So isBunker(11) returns 1, isBunker(22) returns 1 and isBunker(8) returns 0 .

The function signature is

   int isBunker (int n)

Solution :

public static int isBunker(int n)

        {

            int a = 0, b = 1, c = 0,j=0;

            while(c<n)

            {

                c = a + b;

                a = j;

                b = c;

                j++;

       

            }

            if (c == n)

                return 1;

            else

                return 0;

        }