1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:
39:

using System;
using System.Collections.Generic;

class Lotto{
 	 	
       public static void Main(string[] args){
 		int[] numbers = new int[49];
 		Stack<int> neighbours = new Stack<int>(); //holding all "neighbours" of drawn numbers
 		bool valid; //this means for a draw that there are no neighbouring numbers at all
 		Random rnd=new Random();
 		int n,nn=0,r,ri,t,tt=0;
 		ConsoleKey ckey =ConsoleKey.Enter; // The very first prompt is answered by the program as it were

 		Console.WriteLine("Emulation of Germany's lottery gambling game '6 out of 49'");
 		Console.WriteLine("counting the draws where there are no neighbouring numbers."); 
		Console.WriteLine("The rel. frequencies are supposed to be near 0.5048015505...\n");
 		Console.Write("Choose number n of draws, which will be fixed in the following: ");
 		n= int.Parse(Console.ReadLine());
 		Console.Write("(Press Enter to try again or Esc to quit)\n\n");
 		while (ckey!=ConsoleKey.Escape) {
 			t=0;
 			for(int i=0;i<n;i++){
 				for(int j=0;j<numbers.Length;j++) numbers[j]=j;
 				valid=true; neighbours.Clear();
 				for(int k=0;k<6;k++){
 					ri=rnd.Next(49-k); r=numbers[ri]; numbers[ri]=numbers[48-k];
 					if (neighbours.Contains(r)) {valid=false; break;}
 					neighbours.Push(r-1);neighbours.Push(r+1);
 				}
 				if (valid) t++;
                        }
 		    	tt+=t; nn+=n;
 			Console.WriteLine("Relative frequency {0} (total {1} after {2} tries)",(t+0f)/n,(tt+0f)/nn,nn);
			ckey=Console.ReadKey(true).Key;
 		}
 	}
 }

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:

procedure GuenstigZuMoeglich(var k,n: Integer);
var
  i1,i2,i3,i4,i5,i6: Integer;
begin
  k:=0; n:=0;
  for i1:=1 to 44 do
    for i2:=i1+1 to 45 do
      for i3:=i2+1 to 46 do
        for i4:=i3+1 to 47 do
          for i5:=i4+1 to 48 do
            for i6:=i5+1 to 49 do
            begin
              if (i2-i1=1) or (i3-i2=1) or (i4-i3=1) or (i5-i4=1) or (i6-i5=1) then inc(k);
              inc(n);
            end;
end;

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:

lotto:=proc()
local i1,i2,i3,i4,i5,i6,k:=0,n:=binomial(49,6);
   for i1 to 39 do
     for i2 from i1+2 to 41 do
       for i3 from i2+2 to 43 do
         for i4 from i3+2 to 45 do
           for i5 from i4+2 to 47 do
             for i6 from i5+2 to 49 do
               k:=k+1
             end do
           end do
         end do
       end do
     end do
   end do;
   return k,n,evalf(k/n)
 end: 

lotto();
                 7059052, 13983816, 0.5048015506

1:

if not ((i2-i1=1) or (i3-i2=1) or (i4-i3=1) or (i5-i4=1) or (i6-i5=1)) then inc(k);