using System.Collections.Generic;
namespace _6.SumCalculation
public class SumCalculation
private static BigInteger FindFactorial(int N)
for (int i = 1; i < N+1; i++)
factorial = factorial * i;
private static BigInteger FindPower(int X,int N)
for (int i = 1; i < N + 1; i++)
public static void Main()
Console.Write("Enter the first number N:");
bool isNInt = int.TryParse(Console.ReadLine(), out N);
Console.Write("Enter the second number X:");
bool isXInt = int.TryParse(Console.ReadLine(), out X);
for (int i = 1; i < N+1; i++)
sum = sum + ((double)FindFactorial(i) / (double)FindPower(X, i));
Console.WriteLine("sum={0}", sum);
Console.WriteLine("Not a valid entry!");