The factorial of a positive integer n is equal to 1*2*3*...n.

➣ Source Code

 
		   
class FibonacciExample1{  
public static void main(String args[])  
{    
 int n1=0,n2=1,n3,i,count=10;    
 System.out.print(n1+" "+n2);//printing 0 and 1    
    
 for(i=2;i<count starts from because and are already printed n3="n1+n2;" system.out.print n1="n2;" n2="n3;">
		 
		</count>

➣ Output

 
0 1 1 2 3 5 8 13 21 34