oyms

void Main()
{
	var son = new Son();
	BaseClass sonAsBase = new Son();

	Console.WriteLine(son.A());
	Console.WriteLine(son.B());
	Console.WriteLine(son.C());
	Console.WriteLine(son.All());
	Console.WriteLine(sonAsBase.A());

oyms

Keybase proof

I hereby claim:

• I am oyms on github.
• I am skaar (https://keybase.io/skaar) on keybase.
• I have a public key whose fingerprint is 9F79 8AB8 168B 9D7B 3128 0759 3CBB 5DAD C3BB 81D3

To claim this, I am signing this object:

oyms

void Main()
{
	var result = FindNumber(9);
	Console.WriteLine (result);
}

public int FindNumber(int n){
	var seed = n * (int) Math.Pow(10,n-1);
	return FindNumber(seed, n-1, n, new Primes());
}

oyms

void Main()
{
	var result= ParallelEnumerable.Range(1,10000000).Count(t=>IsPalindrome(t,8) && IsPalindrome(t,10));
	Console.WriteLine (result);
}
public bool IsPalindrome(int number, int baseNumber){
	var value = Convert.ToString(number, baseNumber);
	return value == Reverse(value);
}
public string Reverse(string txt){

oyms

using System;
using System.Collections.Generic;
using System.Linq;

namespace ConsoleApplication1
{
    class Program
    {
        public static void Main()
        {

oyms

public static int Division(int divident, int divisor)
        {
            if (divisor == 0) throw new DivideByZeroException("Jeg tror aldri tidligere jeg har kunnet bruke denne");
            var enumerator = Enumerable.Range(1, divident).GetEnumerator();
            var lists = new List<int>[divisor];
            do
            {
                foreach (var element in Enumerable.Range(0, divisor))
                {
                    var list = lists[element] ?? (lists[element] = new List<int>());