Special Numbers Loops Posted May 09, 2020

Any number which cannot be divisible by any other number except one and itself is called a prime number. In other words, any number which doesn't have more than 2 factors (1 and itself) is called a prime number. Examples: 2, 3, 11, 13, 19 and such For a given number n, we shall find out the total factors for the number and decide whether the number is a prime or not.

```
public static bool DoIsPrimeNumber(int n)
{
// fetch the factors for n
List<int> factors = DoGetFactors(n);
return factors.Count > 2 ? false : true;
}
```

**How it works:**

For a given number n, we'll find out all the factors and then see if the Count of the factors is more than 2 or not. If it is two we'll return it is a prime, since by definition a prime number can't have more than 2 factors.

Compute and generate a compressed string for a given string containing repetitions

Find all possible natural numbers below a given limit such that a3+b3 = c3+d3

Find all the pairs in a given ordered set of numbers whose sum is equal to a given input sum

Find all the pairs in a given unordered set of numbers whose sum is equal to a given input sum

Sort the given unordered set of Binary digits

Implementing stream based communication with gRPC and ASP.NET Core

Building a simple Client-Server Interaction with gRPC in ASP.NET Core

Role-based and Claims-based Authorization in ASP.NET Core using Policies - Hands on

Understanding How Antiforgerytoken works in ASP.NET Core MVC

Implementing Cognito User Login and Signup in ASP.NET Core using AWS SDK