CS50 中的主要练习不会排除 1 [关闭]

Question

素数算法不会排除1.

bool prime(整数) {

for (int factor = 2; factor < number; factor++)
{
    if (number % factor == 0)
    {
        return false;
    }
    else if (number == 1)
    {
        return false;
    }
}
return true;

}

我尝试了几种方法，但出于某种原因，代码从不考虑我将 1 排除为质数。我试图在第一个 if 语句中包含 (...|| number == 1) 甚至尝试 (...|| number < 2) but neither of those options worked either. I am not even getting an error. Any idea what's going on?