Collatz conjecture is an arithmetic problem in which there are 2 rules, If a inputted number is even: divide by 2. if the inputted number is odd: multiply by 3 and add 1, whats interesting about this conjecture is that it will always result in a loop resulting in 1

CollatzConjecture.cpp

/* 
plasmarad - 2024

CollatzConjecture:
if a number is even: divide by  2
if a number is odd : Mult 3 add 1
Eventually, with all numbers, it will loop into 1 [ex: 1 -> 4 -> 2 -> 1]
*/

#include <stdint.h>
#include <iostream>

uint64_t _3xP1(uint64_t Number){
    if (Number % 2 == 0)    return  Number  /   2 ;
    else                    return  3 * Number + 1;
}
int main (){
    uint64_t seed = 18446744073709551615;
    std::cin >> seed;
    while (seed != 1) {
        seed = _3xP1 (seed);
        std::cout << seed << std::endl;
    }
}
// plasmarad - 2024

Refactor, condensed, and simplified code.
not to forget the better comment explanation.