Exemplo n.º 1
0
        public void NaturalNumber_minus3false_Return_3()
        {
            // arrange
            int  number = -3;
            bool flag   = false;

            // assert
            Assert.AreEqual(3, DifferentTasks.NaturalNumber(ref number, ref flag));
        }
Exemplo n.º 2
0
        public void NaturalNumber_3true_Return_3()
        {
            // arrange
            int  number = 3;
            bool flag   = true;

            //assert
            Assert.AreEqual(3, DifferentTasks.NaturalNumber(ref number, ref flag));
        }
Exemplo n.º 3
0
        public void NaturalNumber_0false_Return_0()
        {
            // arrange
            int  number = 0;
            bool flag   = false;

            //assert
            Assert.AreEqual(0, DifferentTasks.NaturalNumber(ref number, ref flag));
        }
Exemplo n.º 4
0
 public void FactorialNumbersAsTheProductOfThreeConsecutivePrimes_minus3_Return_true()
 {
     Assert.AreNotEqual("1 * 2 * 3", DifferentTasks.FactorialNumbersAsTheProductOfThreeConsecutivePrimes(-2));
 }
Exemplo n.º 5
0
 public void FactorialNumbersAsTheProductOfThreeConsecutivePrimes_0_Return_true()
 {
     Assert.AreEqual("can not imagine 0! = 1 as a product of three consecutive prime numbers",
                     DifferentTasks.FactorialNumbersAsTheProductOfThreeConsecutivePrimes(0));
 }
Exemplo n.º 6
0
 public void PrimeNumberCheck_0_Return_true()
 {
     Assert.AreEqual(false, DifferentTasks.PrimeNumberCheck(0));
 }
Exemplo n.º 7
0
 public void PerfectNumberToFind_100_1_Return_6_28()
 {
     Assert.AreEqual("Perfect number:  " + 6 + " " + 28, DifferentTasks.PerfectNumberToFind(100, 1));
 }
Exemplo n.º 8
0
 public void GreatestCommonDivisorEvclidAlgorithm_2and15_Return1()
 {
     Assert.AreEqual(1, DifferentTasks.GreatestCommonDivisorEvclidAlgorithm(2, 15));
 }
Exemplo n.º 9
0
 public void Factorial_7_Return_5040()
 {
     Assert.AreEqual(5040, DifferentTasks.Factorial(7));
 }
Exemplo n.º 10
0
 public void Factorial_2_Return_2()
 {
     Assert.AreEqual(2, DifferentTasks.Factorial(2));
 }
Exemplo n.º 11
0
 public void Factorial_0_Return_1()
 {
     Assert.AreEqual(1, DifferentTasks.Factorial(0));
 }
Exemplo n.º 12
0
 public void TranslationFromDecimalSystemToBinary_1_Return_1()
 {
     Assert.AreEqual("1", DifferentTasks.TranslationFromDecimalSystemToBinary(1));
 }
Exemplo n.º 13
0
 public void TranslationFromDecimalSystemToBinary_0_Return_0()
 {
     Assert.AreEqual("0", DifferentTasks.TranslationFromDecimalSystemToBinary(0));
 }
Exemplo n.º 14
0
 public void TranslationFromDecimalSystemToBinary_minus5_Return_minus101()
 {
     Assert.AreEqual("-101", DifferentTasks.TranslationFromDecimalSystemToBinary(-5));
 }
Exemplo n.º 15
0
 public void TranslationFromDecimalSystemToBinary_6_Return_110()
 {
     Assert.AreEqual("110", DifferentTasks.TranslationFromDecimalSystemToBinary(6));
 }
Exemplo n.º 16
0
 public void GreatestCommonDivisorEvclidAlgorithm_minus3andminus4_Return1()
 {
     Assert.AreEqual(1, DifferentTasks.GreatestCommonDivisorEvclidAlgorithm(-3, -4));
 }
Exemplo n.º 17
0
 public void Factorial_minus3_Return_2()
 {
     Assert.AreEqual(0, DifferentTasks.Factorial(-3));
 }
Exemplo n.º 18
0
 public void PrimeNumberCheck_11_Return_true()
 {
     Assert.AreEqual(true, DifferentTasks.PrimeNumberCheck(11));
 }
Exemplo n.º 19
0
 public void GreatestCommonDivisorEvclidAlgorithm_0and0_Return0()
 {
     Assert.AreEqual(0, DifferentTasks.GreatestCommonDivisorEvclidAlgorithm(0, 0));
 }
Exemplo n.º 20
0
 public void PerfectNumberToFind_minus1_minus10_Return()
 {
     Assert.AreEqual("No perfect numbers", DifferentTasks.PerfectNumberToFind(-1, -10));
 }