c sharp program for primenumbers

Try googlin dear,
Prime Number[^]
Recursive Factorial[^]
Fibonacci Series[^]

just take the logic:
for prime number:

use modulos(%) operator to find the remainder. If the remainder is 0 for more than one number then the number is not a prime number otherwise number is prime.

for Recursive factorial:

multiply the numbers less than that number (upto1)

for fibonacci series:

add 0&1 to get the 3rd number in the series,then add the result & previous number to get the 4th number, like this continue...


I think u will do best with this much......all the best

Fibonacci Series

using System;
class Program
{
    static void Main()
    {
        int boyut;
        Console.Write("The number of serial:");
        int.TryParse(Console.ReadLine(), out boyut);


        int[] dizi = new int[boyut];

        dizi[0] = 1;
        dizi[1] = 1;

        for (int i = 2; i < boyut; i++)
            dizi[i] = dizi[i - 1] + dizi[i - 2];

        for (int i = 0; i < boyut; i++)
            Console.Write(dizi[i] + " - ");

        Console.ReadLine();
    }
}