Fibonacci in Java

Published on 03 October 2018 (Updated: 03 October 2018)

Welcome to the Fibonacci in Java page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

public class Fibonacci {

    public static void main(String[] args) {
        try {
            int n = Integer.parseInt(args[0]);
            int first = 0;
            int second = 1;
            int result = 0;
            for (int i = 1; i <= n; i++) {
                result = first + second;
                first = second;
                second = result;
                System.out.println(i + ": " + first);
        } catch (Exception e) {
            System.out.println("Usage: please input the count of fibonacci numbers to output");


Fibonacci in Java was written by:

If you see anything you'd like to change or update, please consider contributing.

Note: The solution shown above is the current solution in the Sample Programs repository as of Oct 10 2022 15:04:56. The solution was first committed on Oct 03 2018 13:08:02. As a result, documentation below may be outdated.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.