diff --git a/d1/d52/lcm__sum_8cpp__incl.map b/d1/d52/lcm__sum_8cpp__incl.map
new file mode 100644
index 000000000..d07be0e96
--- /dev/null
+++ b/d1/d52/lcm__sum_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d1/d52/lcm__sum_8cpp__incl.md5 b/d1/d52/lcm__sum_8cpp__incl.md5
new file mode 100644
index 000000000..cede45ddc
--- /dev/null
+++ b/d1/d52/lcm__sum_8cpp__incl.md5
@@ -0,0 +1 @@
+acc4337c653d091bda98ad7d1e66fdae
\ No newline at end of file
diff --git a/d1/d52/lcm__sum_8cpp__incl.svg b/d1/d52/lcm__sum_8cpp__incl.svg
new file mode 100644
index 000000000..40b03c0d1
--- /dev/null
+++ b/d1/d52/lcm__sum_8cpp__incl.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+math/lcm_sum.cpp
+
+Node1
+
+math/lcm_sum.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cassert
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+vector
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html
index f4eaa7cc3..2a3e7117f 100644
--- a/d1/dbe/lu__decomposition_8h_source.html
+++ b/d1/dbe/lu__decomposition_8h_source.html
@@ -204,6 +204,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
void tests()
Definition: number_of_positive_divisors.cpp:70
unsigned int lcm(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:43
void tests()
Definition: least_common_multiple.cpp:50
uint64_t lcmSum(const uint16_t &num)
Definition: lcm_sum.cpp:28
std::vector< int > prime_numbers
Definition: prime_factorization.cpp:16
int main()
Definition: primes_up_to_billion.cpp:26
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: false_position.cpp:24
std::vector< int > primes(int max)
Definition: prime_numbers.cpp:12
bool miller_rabin_primality_test(T num, T repeats)
Definition: miller_rabin.cpp:125
static void test_3()
Definition: heavy_light_decomposition.cpp:592
int main()
Definition: brent_method_extrema.cpp:204
void test2()
Definition: lu_decompose.cpp:66
int multiply(int x, int res[], int res_size)
Definition: power_for_huge_numbers.cpp:25
static void test_2()
Definition: heavy_light_decomposition.cpp:549
ll ans(ll n)
Definition: matrix_exponentiation.cpp:91
int main()
Definition: sieve_of_eratosthenes.cpp:65
static void test()
Definition: lcm_sum.cpp:65
std::vector< bool > sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:26
const char * complex_str(const std::complex< double > &x)
Definition: durand_kerner_roots.cpp:76
void test3()
Test function to find maxima for the function in the interval Expected result: .
Definition: golden_search_extrema.cpp:123
int main()
Definition: false_position.cpp:39
int main()
Main function.
Definition: lcm_sum.cpp:96
double variance() const
Definition: realtime_stats.cpp:89
unsigned int gcd(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:16
int main()
Definition: sqrt_double.cpp:42
bool miller_test(T d, T num)
Definition: miller_rabin.cpp:73
int main()
Definition: least_common_multiple.cpp:78
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition: lu_decomposition.h:29
static void test_1()
Definition: heavy_light_decomposition.cpp:505
int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
void new_val(T x)
Definition: realtime_stats.cpp:32
int main()
Definition: miller_rabin.cpp:183
int main()
Definition: power_for_huge_numbers.cpp:82
void prime_factorization(int num)
Definition: prime_factorization.cpp:40
int main()
Definition: sum_of_digits.cpp:68
Algorithms_in_C++: math/lcm_sum.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\).
+More...
+
#include <iostream>#include <cassert>#include <vector>
+
+
An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\).
+
An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) where \(\mathrm{LCM}(i,n)\) denotes the Least Common Multiple of the integers i and n. For n greater than or equal to 1. The value of the sum is calculated by formula:
+\[ \sum\mathrm{LCM}(i, n) = \frac{1}{2} \left[\left(\sum (d * \mathrm{ETF}(d)) + 1\right) * n\right] \]
+
+
where \mathrm{ETF}(i) represents Euler totient function of i.
Author Chesta Mittal
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static void test
+ (
+ )
+
+
+
+
+static
+
+
+
+
Function for testing lcmSum function. test cases and assert statement.
Returns void
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
83 assert(test_4 == 616);
+
+
+
+
+
88 assert(test_5 == 1110);
+
+
+
+
+
+
+
+
+
uint64_t lcmSum(const uint16_t &num)
Definition: lcm_sum.cpp:28
static void test_3()
Definition: heavy_light_decomposition.cpp:592
static void test_2()
Definition: heavy_light_decomposition.cpp:549
static void test()
Definition: lcm_sum.cpp:65
static void test_1()
Definition: heavy_light_decomposition.cpp:505
+
diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..2c5a2fcc1
--- /dev/null
+++ b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+667bca0f8cecb1055658de31467871af
\ No newline at end of file
diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..ba181ed31
--- /dev/null
+++ b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,583 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+math::lcmSum
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+test_1
+
+
+
+
+Node1->Node4
+
+
+
+Node23
+
+test_2
+
+
+
+
+Node1->Node23
+
+
+
+Node24
+
+test_3
+
+
+
+
+Node1->Node24
+
+
+
+Node5
+
+range_queries::heavy
+_light_decomposition
+::Tree::add_edge
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::vector::push_back
+
+
+
+
+Node4->Node6
+
+
+
+Node7
+
+range_queries::heavy
+_light_decomposition
+::HLD::init
+
+
+
+
+Node4->Node7
+
+
+
+Node15
+
+range_queries::heavy
+_light_decomposition
+::HLD::query
+
+
+
+
+Node4->Node15
+
+
+
+Node19
+
+range_queries::heavy
+_light_decomposition
+::Tree::set_node_val
+
+
+
+
+Node4->Node19
+
+
+
+Node20
+
+std::vector::size
+
+
+
+
+Node4->Node20
+
+
+
+Node21
+
+range_queries::heavy
+_light_decomposition
+::HLD::update
+
+
+
+
+Node4->Node21
+
+
+
+Node5->Node6
+
+
+
+Node8
+
+range_queries::heavy
+_light_decomposition
+::SG::combine
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_hc
+
+
+
+
+Node7->Node9
+
+
+
+Node10
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_labels
+
+
+
+
+Node7->Node10
+
+
+
+Node11
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_par
+
+
+
+
+Node7->Node11
+
+
+
+Node12
+
+range_queries::heavy
+_light_decomposition
+::Tree::init
+
+
+
+
+Node7->Node12
+
+
+
+Node13
+
+range_queries::heavy
+_light_decomposition
+::Tree::dfs_lca
+
+
+
+
+Node12->Node13
+
+
+
+Node14
+
+range_queries::heavy
+_light_decomposition
+::Tree::dfs_size
+
+
+
+
+Node12->Node14
+
+
+
+Node16
+
+range_queries::heavy
+_light_decomposition
+::HLD::chain_query
+
+
+
+
+Node15->Node16
+
+
+
+Node17
+
+range_queries::heavy
+_light_decomposition
+::Tree::lca
+
+
+
+
+Node15->Node17
+
+
+
+Node18
+
+range_queries::heavy
+_light_decomposition
+::Tree::lift
+
+
+
+
+Node17->Node18
+
+
+
+Node19->Node20
+
+
+
+Node22
+
+range_queries::heavy
+_light_decomposition
+::SG::update
+
+
+
+
+Node21->Node22
+
+
+
+Node23->Node5
+
+
+
+Node23->Node6
+
+
+
+Node23->Node7
+
+
+
+Node23->Node15
+
+
+
+Node23->Node19
+
+
+
+Node23->Node20
+
+
+
+Node23->Node21
+
+
+
+Node24->Node5
+
+
+
+Node24->Node6
+
+
+
+Node24->Node7
+
+
+
+Node24->Node15
+
+
+
+Node24->Node19
+
+
+
+Node24->Node20
+
+
+
+Node24->Node21
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
new file mode 100644
index 000000000..73011da14
--- /dev/null
+++ b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
@@ -0,0 +1,495 @@
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+std::endl
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+math::lcmSum
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+test_1
+
+
+
+
+Node1->Node4
+
+
+
+Node23
+
+test_2
+
+
+
+
+Node1->Node23
+
+
+
+Node24
+
+test_3
+
+
+
+
+Node1->Node24
+
+
+
+Node5
+
+range_queries::heavy
+_light_decomposition
+::Tree::add_edge
+
+
+
+
+Node4->Node5
+
+
+
+Node6
+
+std::vector::push_back
+
+
+
+
+Node4->Node6
+
+
+
+Node7
+
+range_queries::heavy
+_light_decomposition
+::HLD::init
+
+
+
+
+Node4->Node7
+
+
+
+Node15
+
+range_queries::heavy
+_light_decomposition
+::HLD::query
+
+
+
+
+Node4->Node15
+
+
+
+Node19
+
+range_queries::heavy
+_light_decomposition
+::Tree::set_node_val
+
+
+
+
+Node4->Node19
+
+
+
+Node20
+
+std::vector::size
+
+
+
+
+Node4->Node20
+
+
+
+Node21
+
+range_queries::heavy
+_light_decomposition
+::HLD::update
+
+
+
+
+Node4->Node21
+
+
+
+Node5->Node6
+
+
+
+Node8
+
+range_queries::heavy
+_light_decomposition
+::SG::combine
+
+
+
+
+Node7->Node8
+
+
+
+Node9
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_hc
+
+
+
+
+Node7->Node9
+
+
+
+Node10
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_labels
+
+
+
+
+Node7->Node10
+
+
+
+Node11
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_par
+
+
+
+
+Node7->Node11
+
+
+
+Node12
+
+range_queries::heavy
+_light_decomposition
+::Tree::init
+
+
+
+
+Node7->Node12
+
+
+
+Node13
+
+range_queries::heavy
+_light_decomposition
+::Tree::dfs_lca
+
+
+
+
+Node12->Node13
+
+
+
+Node14
+
+range_queries::heavy
+_light_decomposition
+::Tree::dfs_size
+
+
+
+
+Node12->Node14
+
+
+
+Node16
+
+range_queries::heavy
+_light_decomposition
+::HLD::chain_query
+
+
+
+
+Node15->Node16
+
+
+
+Node17
+
+range_queries::heavy
+_light_decomposition
+::Tree::lca
+
+
+
+
+Node15->Node17
+
+
+
+Node18
+
+range_queries::heavy
+_light_decomposition
+::Tree::lift
+
+
+
+
+Node17->Node18
+
+
+
+Node19->Node20
+
+
+
+Node22
+
+range_queries::heavy
+_light_decomposition
+::SG::update
+
+
+
+
+Node21->Node22
+
+
+
+Node23->Node5
+
+
+
+Node23->Node6
+
+
+
+Node23->Node7
+
+
+
+Node23->Node15
+
+
+
+Node23->Node19
+
+
+
+Node23->Node20
+
+
+
+Node23->Node21
+
+
+
+Node24->Node5
+
+
+
+Node24->Node6
+
+
+
+Node24->Node7
+
+
+
+Node24->Node15
+
+
+
+Node24->Node19
+
+
+
+Node24->Node20
+
+
+
+Node24->Node21
+
+
+
diff --git a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..46f68c5b9
--- /dev/null
+++ b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,27 @@
+
+
diff --git a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..bf5c99c94
--- /dev/null
+++ b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+8adfd5d392552933ca40651c6b8233e2
\ No newline at end of file
diff --git a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..f7855bdda
--- /dev/null
+++ b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,598 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+math::lcmSum
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+test_1
+
+
+
+
+Node2->Node5
+
+
+
+Node24
+
+test_2
+
+
+
+
+Node2->Node24
+
+
+
+Node25
+
+test_3
+
+
+
+
+Node2->Node25
+
+
+
+Node6
+
+range_queries::heavy
+_light_decomposition
+::Tree::add_edge
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+std::vector::push_back
+
+
+
+
+Node5->Node7
+
+
+
+Node8
+
+range_queries::heavy
+_light_decomposition
+::HLD::init
+
+
+
+
+Node5->Node8
+
+
+
+Node16
+
+range_queries::heavy
+_light_decomposition
+::HLD::query
+
+
+
+
+Node5->Node16
+
+
+
+Node20
+
+range_queries::heavy
+_light_decomposition
+::Tree::set_node_val
+
+
+
+
+Node5->Node20
+
+
+
+Node21
+
+std::vector::size
+
+
+
+
+Node5->Node21
+
+
+
+Node22
+
+range_queries::heavy
+_light_decomposition
+::HLD::update
+
+
+
+
+Node5->Node22
+
+
+
+Node6->Node7
+
+
+
+Node9
+
+range_queries::heavy
+_light_decomposition
+::SG::combine
+
+
+
+
+Node8->Node9
+
+
+
+Node10
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_hc
+
+
+
+
+Node8->Node10
+
+
+
+Node11
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_labels
+
+
+
+
+Node8->Node11
+
+
+
+Node12
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_par
+
+
+
+
+Node8->Node12
+
+
+
+Node13
+
+range_queries::heavy
+_light_decomposition
+::Tree::init
+
+
+
+
+Node8->Node13
+
+
+
+Node14
+
+range_queries::heavy
+_light_decomposition
+::Tree::dfs_lca
+
+
+
+
+Node13->Node14
+
+
+
+Node15
+
+range_queries::heavy
+_light_decomposition
+::Tree::dfs_size
+
+
+
+
+Node13->Node15
+
+
+
+Node17
+
+range_queries::heavy
+_light_decomposition
+::HLD::chain_query
+
+
+
+
+Node16->Node17
+
+
+
+Node18
+
+range_queries::heavy
+_light_decomposition
+::Tree::lca
+
+
+
+
+Node16->Node18
+
+
+
+Node19
+
+range_queries::heavy
+_light_decomposition
+::Tree::lift
+
+
+
+
+Node18->Node19
+
+
+
+Node20->Node21
+
+
+
+Node23
+
+range_queries::heavy
+_light_decomposition
+::SG::update
+
+
+
+
+Node22->Node23
+
+
+
+Node24->Node6
+
+
+
+Node24->Node7
+
+
+
+Node24->Node8
+
+
+
+Node24->Node16
+
+
+
+Node24->Node20
+
+
+
+Node24->Node21
+
+
+
+Node24->Node22
+
+
+
+Node25->Node6
+
+
+
+Node25->Node7
+
+
+
+Node25->Node8
+
+
+
+Node25->Node16
+
+
+
+Node25->Node20
+
+
+
+Node25->Node21
+
+
+
+Node25->Node22
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
new file mode 100644
index 000000000..43d52be3f
--- /dev/null
+++ b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
@@ -0,0 +1,510 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+math::lcmSum
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+test_1
+
+
+
+
+Node2->Node5
+
+
+
+Node24
+
+test_2
+
+
+
+
+Node2->Node24
+
+
+
+Node25
+
+test_3
+
+
+
+
+Node2->Node25
+
+
+
+Node6
+
+range_queries::heavy
+_light_decomposition
+::Tree::add_edge
+
+
+
+
+Node5->Node6
+
+
+
+Node7
+
+std::vector::push_back
+
+
+
+
+Node5->Node7
+
+
+
+Node8
+
+range_queries::heavy
+_light_decomposition
+::HLD::init
+
+
+
+
+Node5->Node8
+
+
+
+Node16
+
+range_queries::heavy
+_light_decomposition
+::HLD::query
+
+
+
+
+Node5->Node16
+
+
+
+Node20
+
+range_queries::heavy
+_light_decomposition
+::Tree::set_node_val
+
+
+
+
+Node5->Node20
+
+
+
+Node21
+
+std::vector::size
+
+
+
+
+Node5->Node21
+
+
+
+Node22
+
+range_queries::heavy
+_light_decomposition
+::HLD::update
+
+
+
+
+Node5->Node22
+
+
+
+Node6->Node7
+
+
+
+Node9
+
+range_queries::heavy
+_light_decomposition
+::SG::combine
+
+
+
+
+Node8->Node9
+
+
+
+Node10
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_hc
+
+
+
+
+Node8->Node10
+
+
+
+Node11
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_labels
+
+
+
+
+Node8->Node11
+
+
+
+Node12
+
+range_queries::heavy
+_light_decomposition
+::HLD::dfs_par
+
+
+
+
+Node8->Node12
+
+
+
+Node13
+
+range_queries::heavy
+_light_decomposition
+::Tree::init
+
+
+
+
+Node8->Node13
+
+
+
+Node14
+
+range_queries::heavy
+_light_decomposition
+::Tree::dfs_lca
+
+
+
+
+Node13->Node14
+
+
+
+Node15
+
+range_queries::heavy
+_light_decomposition
+::Tree::dfs_size
+
+
+
+
+Node13->Node15
+
+
+
+Node17
+
+range_queries::heavy
+_light_decomposition
+::HLD::chain_query
+
+
+
+
+Node16->Node17
+
+
+
+Node18
+
+range_queries::heavy
+_light_decomposition
+::Tree::lca
+
+
+
+
+Node16->Node18
+
+
+
+Node19
+
+range_queries::heavy
+_light_decomposition
+::Tree::lift
+
+
+
+
+Node18->Node19
+
+
+
+Node20->Node21
+
+
+
+Node23
+
+range_queries::heavy
+_light_decomposition
+::SG::update
+
+
+
+
+Node22->Node23
+
+
+
+Node24->Node6
+
+
+
+Node24->Node7
+
+
+
+Node24->Node8
+
+
+
+Node24->Node16
+
+
+
+Node24->Node20
+
+
+
+Node24->Node21
+
+
+
+Node24->Node22
+
+
+
+Node25->Node6
+
+
+
+Node25->Node7
+
+
+
+Node25->Node8
+
+
+
+Node25->Node16
+
+
+
+Node25->Node20
+
+
+
+Node25->Node21
+
+
+
+Node25->Node22
+
+
+
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index a9bef9b0e..5cd207b73 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -260,6 +260,7 @@ Math
Gcd Recursive Euclidean Large Factorial Large Number Lcm Sum Least Common Multiple Miller Rabin Modular Inverse Fermat Little Theorem Algorithms_in_C++: math Namespace Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
for std::vector
+More...
+
+uint64_t lcmSum (const uint16_t &num)
+
+
for std::vector
+
for std::cin and std::cout for assert
+
Mathematical algorithms
+
+
+
◆
+
+
+
+
+
+ uint64_t math::lcmSum
+ (
+ const uint16_t &
+ num )
+
+
+
+
Function to compute sum of euler totients in sumOfEulerTotient vector
Parameters
+
+
+
+
Returns int Sum of LCMs, i.e. ∑LCM(i, num) from i = 1 to num
+
+
+
+
+
+
+
+
35 for (i=1; i<=num; i++) {
+
+
+
+
+
40 for (i=2; i<=num; i++) {
+
41 if (eulerTotient[i] == i) {
+
42 for (j=i; j<=num; j+=i) {
+
43 eulerTotient[j] = eulerTotient[j]/i;
+
44 eulerTotient[j] = eulerTotient[j]*(i-1);
+
+
+
+
+
+
50 for (i=1; i<=num; i++) {
+
51 for (j=i; j <=num; j+=i) {
+
52 sumOfEulerTotient[j] += eulerTotient[i]*i;
+
+
+
+
56 return ((sumOfEulerTotient[num] + 1 ) * num) / 2;
+
+
+
+
+
+
file large_number.h [code] Library to perform arithmatic operations on arbitrarily large numbers. file lcm_sum.cpp An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\). file least_common_multiple.cpp file miller_rabin.cpp gcd_recursive_euclidean.cpp Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm large_factorial.cpp Compute factorial of any arbitratily large number/ large_number.h Library to perform arithmatic operations on arbitrarily large numbers least_common_multiple.cpp miller_rabin.cpp modular_inverse_fermat_little_theorem.cpp C++ Program to find the modular inverse using Fermat's Little Theorem number_of_positive_divisors.cpp C++ Program to calculate the number of positive divisors power_for_huge_numbers.cpp Compute powers of large numbers prime_factorization.cpp Prime factorization of positive integers prime_numbers.cpp Get list of prime numbers primes_up_to_billion.cpp Compute prime numbers upto 1 billion realtime_stats.cpp Compute statistics for data entered in rreal-time sieve_of_eratosthenes.cpp Get list of prime numbers using Sieve of Eratosthenes sqrt_double.cpp Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding string_fibonacci.cpp This Programme returns the Nth fibonacci as a string sum_of_digits.cpp A C++ Program to find the Sum of Digits of input integer lcm_sum.cpp An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) least_common_multiple.cpp miller_rabin.cpp modular_inverse_fermat_little_theorem.cpp C++ Program to find the modular inverse using Fermat's Little Theorem number_of_positive_divisors.cpp C++ Program to calculate the number of positive divisors power_for_huge_numbers.cpp Compute powers of large numbers prime_factorization.cpp Prime factorization of positive integers prime_numbers.cpp Get list of prime numbers primes_up_to_billion.cpp Compute prime numbers upto 1 billion realtime_stats.cpp Compute statistics for data entered in rreal-time sieve_of_eratosthenes.cpp Get list of prime numbers using Sieve of Eratosthenes sqrt_double.cpp Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding string_fibonacci.cpp This Programme returns the Nth fibonacci as a string sum_of_digits.cpp A C++ Program to find the Sum of Digits of input integer ► numerical_methods bisection_method.cpp Solve the equation \(f(x)=0\) using bisection method brent_method_extrema.cpp Find real extrema of a univariate real function in a given interval using Brent's method linked_list.cpp
, depth_first_search.cpp
, gcd_recursive_euclidean.cpp
+, cycle_sort.cpp
, gnome_sort.cpp
-, heap_sort.cpp
, large_factorial.cpp
+, heap_sort.cpp
, insertion_sort.cpp
-, merge_insertion_sort.cpp
, dijkstra.cpp
-, least_common_multiple.cpp
-, merge_sort.cpp
+, lcm_sum.cpp
+, merge_insertion_sort.cpp
, rabin_karp.cpp
, knuth_morris_pratt.cpp
, horspool.cpp
@@ -116,15 +116,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, strand_sort.cpp
, shell_sort2.cpp
, quick_sort_3.cpp
-, pancake_sort.cpp
-, miller_rabin.cpp
-, pigeonhole_sort.cpp
, quick_sort.cpp
+, merge_sort.cpp
+, least_common_multiple.cpp
+, pancake_sort.cpp
+, pigeonhole_sort.cpp
, linkedlist_implentation_usingarray.cpp
, hamiltons_cycle.cpp
+, miller_rabin.cpp
, modular_inverse_fermat_little_theorem.cpp
-, number_of_positive_divisors.cpp
-, cycle_sort.cpp
, comb_sort.cpp
, bogo_sort.cpp
, text_search.cpp
@@ -180,9 +180,10 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, realtime_stats.cpp
, primes_up_to_billion.cpp
, prime_numbers.cpp
-, hopcroft_karp.cpp
-, power_for_huge_numbers.cpp
, prime_factorization.cpp
+, hopcroft_karp.cpp
+, number_of_positive_divisors.cpp
+, power_for_huge_numbers.cpp
, caesar_cipher.cpp
, queue_using_two_stacks.cpp
, is_graph_bipartite.cpp
diff --git a/globals_func_s.html b/globals_func_s.html
index bfe3b0d00..866088b6a 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
show_pascal()
: pascal_triangle.cpp
-Sieve()
-: primes_up_to_billion.cpp
-
sieve()
: sieve_of_eratosthenes.cpp
+Sieve()
+: primes_up_to_billion.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 767c220dc..c7b6d53f9 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, morse_code.cpp
, 0_1_knapsack.cpp
, neural_network.cpp
+, horspool.cpp
, armstrong_number.cpp
, cut_rod.cpp
, check_amicable_pair.cpp
@@ -108,25 +109,25 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, vigenere_cipher.cpp
, palindrome_partitioning.cpp
, fibonacci.cpp
-, sum_of_digits.cpp
+, lcm_sum.cpp
, shortest_common_supersequence.cpp
+, sum_of_digits.cpp
, smallest_circle.cpp
-, median_search.cpp
, caesar_cipher.cpp
, xor_cipher.cpp
, word_break.cpp
+, median_search.cpp
, bogo_sort.cpp
-, cycle_sort.cpp
, jarvis_algorithm.cpp
+, cycle_sort.cpp
, gnome_sort.cpp
-, heap_sort.cpp
, trie_tree.cpp
, is_graph_bipartite.cpp
+, heap_sort.cpp
, merge_insertion_sort.cpp
-, pancake_sort.cpp
, jumpgame.cpp
+, pancake_sort.cpp
, strand_sort.cpp
-, horspool.cpp
test1()
: hill_cipher.cpp
@@ -146,7 +147,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: hill_cipher.cpp
, hamiltons_cycle.cpp
, adaline_learning.cpp
-, qr_eigen_values.cpp
+, lu_decompose.cpp
, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
@@ -154,25 +155,25 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, brent_method_extrema.cpp
, durand_kerner_roots.cpp
, golden_search_extrema.cpp
-, lu_decompose.cpp
+, qr_eigen_values.cpp
, smallest_circle.cpp
test3()
: smallest_circle.cpp
-, kohonen_som_topology.cpp
-, hamiltons_cycle.cpp
+, golden_search_extrema.cpp
, adaline_learning.cpp
+, hamiltons_cycle.cpp
+, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, brent_method_extrema.cpp
-, golden_search_extrema.cpp
test_1()
: heavy_light_decomposition.cpp
, pigeonhole_sort.cpp
test_2()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_2d_classes()
: kohonen_som_topology.cpp
@@ -216,20 +217,20 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: kohonen_som_trace.cpp
tests()
-: miller_rabin.cpp
-, connected_components.cpp
+: lowest_common_ancestor.cpp
+, insertion_sort.cpp
+, number_of_positive_divisors.cpp
+, dijkstra.cpp
, double_factorial.cpp
+, check_factorial.cpp
+, breadth_first_search.cpp
+, miller_rabin.cpp
+, least_common_multiple.cpp
+, complex_numbers.cpp
, hopcroft_karp.cpp
+, connected_components.cpp
, comb_sort.cpp
, sieve_of_eratosthenes.cpp
-, breadth_first_search.cpp
-, insertion_sort.cpp
-, complex_numbers.cpp
-, lowest_common_ancestor.cpp
-, least_common_multiple.cpp
-, number_of_positive_divisors.cpp
-, check_factorial.cpp
-, dijkstra.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/globals_i.html b/globals_i.html
index 3c01de3b0..42dc8f695 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -123,14 +123,14 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
is_square()
: ordinary_least_squares_regressor.cpp
-IsPrime()
-: primality_test.cpp
+ isprime
+: prime_factorization.cpp
isPrime()
: modular_inverse_fermat_little_theorem.cpp
-isprime
-: prime_factorization.cpp
+ IsPrime()
+: primality_test.cpp
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index 0ba7fd16f..8875056e1 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -101,41 +101,41 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, linked_list.cpp
, depth_first_search.cpp
, gcd_recursive_euclidean.cpp
+, cycle_sort.cpp
, gnome_sort.cpp
-, heap_sort.cpp
, large_factorial.cpp
+, heap_sort.cpp
, insertion_sort.cpp
-, merge_insertion_sort.cpp
, dijkstra.cpp
-, least_common_multiple.cpp
+, lcm_sum.cpp
+, merge_insertion_sort.cpp
, merge_sort.cpp
+, least_common_multiple.cpp
, pancake_sort.cpp
-, miller_rabin.cpp
, pigeonhole_sort.cpp
-, quick_sort.cpp
, linkedlist_implentation_usingarray.cpp
, hamiltons_cycle.cpp
-, modular_inverse_fermat_little_theorem.cpp
+, miller_rabin.cpp
+, quick_sort.cpp
, quick_sort_3.cpp
+, modular_inverse_fermat_little_theorem.cpp
, shell_sort2.cpp
-, number_of_positive_divisors.cpp
-, strand_sort.cpp
, rabin_karp.cpp
-, brute_force_string_searching.cpp
-, hopcroft_karp.cpp
-, power_for_huge_numbers.cpp
-, horspool.cpp
, knuth_morris_pratt.cpp
-, prime_factorization.cpp
+, strand_sort.cpp
+, hopcroft_karp.cpp
+, number_of_positive_divisors.cpp
+, brute_force_string_searching.cpp
+, horspool.cpp
+, power_for_huge_numbers.cpp
, caesar_cipher.cpp
, queue_using_two_stacks.cpp
, is_graph_bipartite.cpp
+, prime_factorization.cpp
, prime_numbers.cpp
-, primes_up_to_billion.cpp
, lowest_common_ancestor.cpp
+, primes_up_to_billion.cpp
, realtime_stats.cpp
-, sieve_of_eratosthenes.cpp
-, cycle_sort.cpp
, comb_sort.cpp
, bogo_sort.cpp
, text_search.cpp
@@ -185,10 +185,11 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, brent_method_extrema.cpp
, bisection_method.cpp
, sum_of_digits.cpp
+, string_fibonacci.cpp
, skip_list.cpp
, spirograph.cpp
+, sieve_of_eratosthenes.cpp
, sqrt_double.cpp
-, string_fibonacci.cpp
, jumpgame.cpp
, n_queens_all_solution_optimised.cpp
, hill_cipher.cpp
diff --git a/globals_p.html b/globals_p.html
index e0bfe83cf..0fbc24bc2 100644
--- a/globals_p.html
+++ b/globals_p.html
@@ -130,12 +130,12 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
predict_OLS_regressor()
: ordinary_least_squares_regressor.cpp
-PRIME
-: rabin_karp.cpp
-
prime
: primes_up_to_billion.cpp
+PRIME
+: rabin_karp.cpp
+
prime_factorization()
: prime_factorization.cpp
diff --git a/globals_s.html b/globals_s.html
index 8ec275802..60322bc2d 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
show_pascal()
: pascal_triangle.cpp
-sieve()
-: sieve_of_eratosthenes.cpp
-
Sieve()
: primes_up_to_billion.cpp
+sieve()
+: sieve_of_eratosthenes.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_t.html b/globals_t.html
index e7934ed0f..f8611c979 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, morse_code.cpp
, 0_1_knapsack.cpp
, neural_network.cpp
+, horspool.cpp
, armstrong_number.cpp
, cut_rod.cpp
, check_amicable_pair.cpp
@@ -108,25 +109,25 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, vigenere_cipher.cpp
, palindrome_partitioning.cpp
, fibonacci.cpp
-, sum_of_digits.cpp
+, lcm_sum.cpp
, shortest_common_supersequence.cpp
+, sum_of_digits.cpp
, smallest_circle.cpp
-, median_search.cpp
, caesar_cipher.cpp
, xor_cipher.cpp
, word_break.cpp
+, median_search.cpp
, bogo_sort.cpp
-, cycle_sort.cpp
, jarvis_algorithm.cpp
+, cycle_sort.cpp
, gnome_sort.cpp
-, heap_sort.cpp
, trie_tree.cpp
, is_graph_bipartite.cpp
+, heap_sort.cpp
, merge_insertion_sort.cpp
-, pancake_sort.cpp
, jumpgame.cpp
+, pancake_sort.cpp
, strand_sort.cpp
-, horspool.cpp
test1()
: hill_cipher.cpp
@@ -147,39 +148,39 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, hamiltons_cycle.cpp
, adaline_learning.cpp
, kohonen_som_topology.cpp
-, qr_eigen_values.cpp
+, lu_decompose.cpp
, kohonen_som_trace.cpp
, large_factorial.cpp
, sum_of_digits.cpp
, brent_method_extrema.cpp
, durand_kerner_roots.cpp
, golden_search_extrema.cpp
-, lu_decompose.cpp
+, qr_eigen_values.cpp
, smallest_circle.cpp
test3()
: smallest_circle.cpp
-, kohonen_som_topology.cpp
-, hamiltons_cycle.cpp
+, golden_search_extrema.cpp
, adaline_learning.cpp
+, hamiltons_cycle.cpp
+, kohonen_som_topology.cpp
, kohonen_som_trace.cpp
, brent_method_extrema.cpp
-, golden_search_extrema.cpp
test_1()
: heavy_light_decomposition.cpp
, pigeonhole_sort.cpp
test_2()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_2d_classes()
: kohonen_som_topology.cpp
test_3()
-: heavy_light_decomposition.cpp
-, pigeonhole_sort.cpp
+: pigeonhole_sort.cpp
+, heavy_light_decomposition.cpp
test_3d_classes()
: kohonen_som_trace.cpp
@@ -219,20 +220,20 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: brute_force_string_searching.cpp
tests()
-: insertion_sort.cpp
-, hopcroft_karp.cpp
-, check_factorial.cpp
-, sieve_of_eratosthenes.cpp
-, miller_rabin.cpp
-, double_factorial.cpp
-, breadth_first_search.cpp
-, lowest_common_ancestor.cpp
-, connected_components.cpp
-, number_of_positive_divisors.cpp
+: connected_components.cpp
, least_common_multiple.cpp
, dijkstra.cpp
-, comb_sort.cpp
+, number_of_positive_divisors.cpp
+, sieve_of_eratosthenes.cpp
+, double_factorial.cpp
+, insertion_sort.cpp
, complex_numbers.cpp
+, lowest_common_ancestor.cpp
+, miller_rabin.cpp
+, hopcroft_karp.cpp
+, check_factorial.cpp
+, comb_sort.cpp
+, breadth_first_search.cpp
TH()
: tower_of_hanoi.cpp
diff --git a/namespacemembers.html b/namespacemembers.html
index 5c9e9ea7b..2673e4a62 100644
--- a/namespacemembers.html
+++ b/namespacemembers.html
@@ -234,6 +234,9 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
N linear_probing An implementation of hash table using linear probing algorithm N linked_list Functions for singly linked list algorithm N machine_learning Machine learning algorithms N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N morse Functions for Morse Code N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N neural_network Neural Network or Multilayer Perceptron N others Other algorithms N palindrome_partitioning Functions for Palindrome Partitioning algorithm N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N rat_maze Functions for N math For std::vector N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N morse Functions for Morse Code N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N neural_network Neural Network or Multilayer Perceptron N others Other algorithms N palindrome_partitioning Functions for Palindrome Partitioning algorithm N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N qr_algorithm Functions to compute QR decomposition of any rectangular matrix N quadratic_probing An implementation of hash table using quadratic probing algorithm N range_queries Algorithms and Data Structures that support range queries and updates N rat_maze Functions for Rat in a Maze algorithm N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Range queries using sparse-tables N spirograph N statistics Statistical algorithms N std STL namespace N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm N search Search algorithms N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Range queries using sparse-tables N spirograph N statistics Statistical algorithms N std STL namespace N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N util_functions Various utility functions used in Neural network N vigenere Functions for vigenère cipher algorithm N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm 
1.8.20
+