Loading [MathJax]/extensions/tex2jax.js
Parallel numerical verification of the σ_odd problem  October 6, 2018
All Classes Namespaces Files Functions Variables Typedefs Macros
Namespaces | Functions | Variables
pentagonal.cpp File Reference
#include "pentagonal.hpp"
#include "../helper/helper.hpp"
#include "divisors.hpp"
#include "primes.hpp"
Include dependency graph for pentagonal.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

std::vector< nat_typesigmaodd::sum_divisors__euler__table_ (sum_divisors__euler__table_nb_)
 
nat_type sigmaodd::sum_divisors_diff_ (nat_type n, nat_type pi)
 
nat_type sigmaodd::sum_divisors__euler (nat_type n)
 Calculates the sum of all divisors of n with the Euler formula about pentagonal numbers and returns it. More...
 
bool sigmaodd::sum_divisors__euler_cache_is_full ()
 Return true iff the cache used by sum_divisors__euler() is full. The function can clean space, but it is less efficient. More...
 
std::size_t sigmaodd::sum_divisors__euler_cache_nb ()
 Return the current number of items in the cache used by sum_divisors__euler() More...
 
std::size_t sigmaodd::sum_divisors__euler_table_nb ()
 Return the (constant) number of items in the table used by sum_divisors__euler() More...
 

Variables

size_t sigmaodd::sum_divisors__euler__cache_max_nb_ = 20000
 
size_t sigmaodd::sum_divisors__euler__table_nb_ = 1024*64
 
std::map< nat_type, nat_typesigmaodd::sum_divisors__euler__cache_
 

Detailed Description

(December 20, 2017)

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

Definition in file pentagonal.cpp.