void get_GoldBachDivision(const std::vector<int>& primes, int number,bool verbose)
{
    int count = 0;
    for (size_t i = 0; i < primes.size(); i++)
    {
        for (size_t j = i; j < primes.size(); j++)
        {
            int firstNumber = primes.at(i);
            int secondNumber = primes.at(j);
            if((firstNumber + secondNumber) == number)
            {
                count++;
                if(verbose)
                    std::cout<<number<<" = "<<firstNumber<< " + "<<secondNumber<<std::endl;
            }
        }
    }
    std::cout<<std::endl;
    std::cout<<"Es gibt "<<count<<" Darstellungen von "<<number<<" als Summe zweier Primzahlen."<<std::endl;
}