Artemis: Optimize Prime-Related Functions for Better Performance

[mike-turintech]

This pull request introduces several optimizations to functions related to prime number calculations. Key changes include:

1. IsPrime Function: Optimized by adding direct checks for the number 2 and all even numbers greater than 2, reducing unnecessary iterations. The loop now starts from 3 and increments by 2 to focus solely on odd numbers.
2. SumPrimes Function: Improved by initializing the sum with 2 and modifying the loop to start from 3, incrementing by 2 to sum only odd primes, enhancing performance.
3. PrimeFactors Function: Adjusted to handle the factor of 2 separately with a dedicated while loop, and modified the main loop to start from 3, incrementing by 2. This focuses the factorization process on odd numbers and ensures that only prime factors are considered.
   These changes collectively reduce computational overhead, particularly for even numbers, and enhance the efficiency of prime number operations, especially for larger inputs.