17 replaced http://stackoverflow.com/ with https://stackoverflow.com/

# C#: 836968665853 51

I used a nasty trinary and recursive lambda expression to achieve this one.

Func<ulong,ulong> f=null;f=x=>x<2?x:f(x-2)+f(x-1);


Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}


# C#: 836968665853 51

I used a nasty trinary and recursive lambda expression to achieve this one.

Func<ulong,ulong> f=null;f=x=>x<2?x:f(x-2)+f(x-1);


Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}


# C#: 836968665853 51

I used a nasty trinary and recursive lambda expression to achieve this one.

Func<ulong,ulong> f=null;f=x=>x<2?x:f(x-2)+f(x-1);


Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}

16 removed unnecessary ()

# C#: 83696866585353 51

I used a nasty trinary and recursive lambda expression to achieve this one.

Func<ulong,ulong> f=null;f=x=>(x<2)f=null;f=x=>x<2?x:f(x-2)+f(x-1);


Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}


# C#: 836968665853

I used a nasty trinary and recursive lambda expression to achieve this one.

Func<ulong,ulong> f=null;f=x=>(x<2)?x:f(x-2)+f(x-1);


Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}


# C#: 836968665853 51

I used a nasty trinary and recursive lambda expression to achieve this one.

Func<ulong,ulong> f=null;f=x=>x<2?x:f(x-2)+f(x-1);


Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}

15 added 34 characters in body

# C#: 8369686658 53

I used a nasty trinary and recursive lambda expression to achieve this one.

Func<ulong,ulong> f=null;f=x=>(x<2)?x:f(x-2)+f(x-1);

Func<ulong,ulong> f=null;f=x=>(x<2)?x:f(x-2)+f(x-1);


Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}


# C#: 8369686658 53

I used a nasty trinary and recursive lambda expression to achieve this one.

Source: StackOverflow

Func<ulong,ulong> f=null;f=x=>(x<2)?x:f(x-2)+f(x-1);

Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}


# C#: 8369686658 53

I used a nasty trinary and recursive lambda expression to achieve this one.

Func<ulong,ulong> f=null;f=x=>(x<2)?x:f(x-2)+f(x-1);


Usage:

    public static void Main()
{
// Recursive lambda expression...
Func<ulong, ulong> f = null;
f = x => (x < 2) ? x : f(x - 2) + f(x - 1);

Console.WriteLine("Please enter a whole number to obtain the Fibonacci sequence number for:");

long numValue;
if(UInt64.TryParse(value, out numValue))
Console.WriteLine(f(numValue));

Console.WriteLine("Press any key to end the program.");
}

Mod Removes Wiki by Chris Jester-Young
14 added 5 characters in body
13 added 2 characters in body
12 Added longer sample usage, because using int.MaxValue against f() caused a StackOverflow exception
11 added 171 characters in body
10 Removed breadcrumbs, they're not necessary.
9 I can count. Honest.
8 Ensured using the largest possible word size per question
7 Realized my fib implementation was wrong. Revised all, which increased character counts slightly.
6 Showed my disdain for readable code.
5 Edited based on feedback.
4 Edited based on feedback.
3 Removed unnecessary text.
2 Removed extra whitespace.
1