severalgos/3np1 mod problem C++
June 21, 2020
|
#include <iostream>
#include <limits>
#include <set>
#include <unordered_set>
#include <vector>
#include "lib_3np1_mod.hpp"
Go to the source code of this file.
Namespaces | |
lib_3np1_mod | |
Functions | |
std::set< value_type > | lib_3np1_mod::search_mask_exceptions (value_type mask) |
Calculate and return all null and odd exceptions for the 3n + 1 problem with modulo (mask + 1). More... | |
std::set< value_type > | lib_3np1_mod::search_mask_exceptions_32 () |
Calculate and return all null and odd exceptions for the 3n + 1 problem with modulo \(2^32\). More... | |
std::set< value_type > | lib_3np1_mod::search_mask_exceptions_64 () |
Calculate and return all null and odd exceptions for the 3n + 1 problem with modulo \(2^32\). More... | |
std::vector< value_type > | lib_3np1_mod::start_path_mask (value_type n, operation_mask_type operation_mask, value_type mask) |
Given operation, return the start of path from n to the first value < n or to the first repeated value. More... | |
Piece of severalgos. https://bitbucket.org/OPiMedia/severalgos
GPLv3 — Copyright (C) 2015 Olivier Pirson http://www.opimedia.be/
Definition in file lib_3np1_mod.cpp.