Divisor Exploration 3 - Ad Infinitium18

June 10, 2017

Introduction

Problem statement is here. The algorithm is hard level, and it is a tree algorithm.

Now it is 11:16 pm, Julia plans to spend another 10 - 20 minutes to document some ideas after she read the problem statement and thought about the ideas over 30 minutes at least.

The value n is the root of tree. n value is defined using m, a, prime numbers. The ith prime ( i >= 1) is 2 ( i = 1).

if the input arguments are m = 2, a = 0, d = 1, then n = 18, because n = 2² * 3².

Algorithm talk