sigmaodd.cpp File Reference

#include "../helper/helper.hpp"
#include "pentagonal.hpp"
#include "primes.hpp"
#include "sigmaodd.hpp"

Include dependency graph for sigmaodd.cpp:

Go to the source code of this file.

Namespaces
	sigmaodd
	A lot of functions and stuffs to deal the sigma_odd problem and related stuffs.

Functions
void	sigmaodd::exit_if_found_exception_ (nat_type start_n, unsigned int length, nat_type n)
void	sigmaodd::exit_if_impossible_to_check_ (nat_type start_n, unsigned int length, nat_type n)
double	sigmaodd::percent_ (nat_type n, nat_type d)
void	sigmaodd::print_data_ (nat_type n, nat_type result, unsigned int length, bool print_only_longer, bool print_path)
void	sigmaodd::print_lengths_ (nat_type lengths[])
void	sigmaodd::print_path_ (nat_type n)
void	sigmaodd::check_varsigma_odd (nat_type first_n, nat_type last_n)
	Iterate from first to last (included) and for each odd n such that is_little_mersenne_prime_unitary_divide(n) is false, iterate var_sum() until the result is <= n. More...
std::string	sigmaodd::path_to_string (const std::vector< nat_type > &path)
void	sigmaodd::print_long (nat_type first, nat_type last, bool print_path)
	Iterate from first to last (included) and for each odd n not square such that is_little_mersenne_prime_unitary_divide(n) is false, if varsum_odd(n) > n then print n and varsum_odd(n). More...
void	sigmaodd::print_path (const std::vector< nat_type > &path, std::ostream &out=std::cout)
	Send to the stream a string representation of the path. All numbers are separated by the corresponding <, = or > symbol. More...
void	sigmaodd::print_path (const std::vector< nat_type >::const_iterator &path_begin, const std::vector< nat_type >::const_iterator &path_end, std::ostream &out=std::cout)
	Send to the stream a string representation of the path, from path_begin to path_end (included). All numbers are separated by the corresponding <, = or > symbol. More...
void	sigmaodd::print_path_infos (const std::vector< nat_type > &path, bool print_bad=true, bool print_all=false, bool print_category=true, bool print_lower=true, bool print_length=true, bool print_path=true, std::ostream &out=std::cout)
	Send (if the below condition is true) to the stream a string representation of the path with some information depending of the boolean parameters. More...
void	sigmaodd::print_sigmaodd__factorize (nat_type first, nat_type last, bool print_only_longer, bool print_path)
	Iterate from first to last (included) and print result of the sum_odd_divisors_divided_until_odd_iterate_until_lower__factorize(n) with some informations. More...
void	sigmaodd::print_sigmaodd__factorize_bound (nat_type first, nat_type last, bool print_only_longer, bool print_path)
	Iterate from first to last (included) and print result of the sum_odd_divisors_divided_until_odd_iterate_until_lower__factorize_bound(n) with some informations. More...
void	sigmaodd::print_sigmaodd__naive (nat_type first, nat_type last, bool print_only_longer, bool print_path)
	Iterate from first to last (included) and print result of the sum_odd_divisors_divided_until_odd_iterate_until_lower__naive(n) with some informations. More...
void	sigmaodd::print_square (nat_type first, nat_type last, bool print_path)
nat_type	sigmaodd::sum_odd_divisors_divided_until_odd__euler (nat_type n)
	Calculates the sum of all odd divisors of n by the Euler formula method, divides the results by 2 until becomes odd, and returns it. More...
nat_type	sigmaodd::sum_odd_divisors_divided_until_odd__factorize (nat_type n, bool skip_primes_table=false)
	Calculates the sum of all odd divisors of n by the factorization method, divides the results by 2 until becomes odd, and returns it. More...
nat_type	sigmaodd::sum_odd_divisors_divided_until_odd__factorize_bound (nat_type n, nat_type start_n)
	Calculates the sum of all odd divisors of n by the factorization method, divides the results by 2 until becomes odd, and returns it. ??? with bound. More...
nat_type	sigmaodd::sum_odd_divisors_divided_until_odd__naive (nat_type n)
	Calculates the sum of all odd divisors of n by the naive method, divides the results by 2 until becomes odd, and returns it. More...
std::pair< nat_type, unsigned int >	sigmaodd::sum_odd_divisors_divided_until_odd_iterate_until_lower__euler (nat_type n)
	Iterates the sum_odd_divisors_divided_until_odd__euler() function from n until have a result lower than n. More...
std::pair< nat_type, unsigned int >	sigmaodd::sum_odd_divisors_divided_until_odd_iterate_until_lower__factorize (nat_type n)
	Iterates the sum_odd_divisors_divided_until_odd__factorize() function from n until have a result lower than n. More...
std::pair< nat_type, unsigned int >	sigmaodd::sum_odd_divisors_divided_until_odd_iterate_until_lower__factorize_bound (nat_type n)
	Iterates the sum_odd_divisors_divided_until_odd__factorize() function from n until have a result lower than n. ??? with bound. More...
std::pair< nat_type, unsigned int >	sigmaodd::sum_odd_divisors_divided_until_odd_iterate_until_lower__naive (nat_type n)
	Iterates the sum_odd_divisors_divided_until_odd__naive() function from n until have a result lower than n. More...
nat_type	sigmaodd::varsum_odd (nat_type n)
	Calculates the sum of all odd divisors of n by the factorization method, divides the results by 2 until becomes odd, and returns it. ??? More...
nat_type	sigmaodd::varsum_odd_big (nat_type n, nat_type sqrt_n)
	Calculates the sum of all odd divisors of n by the factorization method, divides the results by 2 until becomes odd, and returns it. ??? More...

Detailed Description

(January 17, 2018)

GPLv3 — Copyright (C) 2017, 2018 Olivier Pirson http://www.opimedia.be/

Definition in file sigmaodd.cpp.