Abstract
We introduce an algorithm to find a partition of n of the form (Formula presented), where Tk = k(k+1) 2 is the k-th triangular number. The algorithm is based on a reinforcement learning algorithm (TD3) and a genetic algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 91-98 |
| Number of pages | 8 |
| Journal | Hardy-Ramanujan Journal |
| Volume | 43 |
| DOIs | |
| State | Published - 2020 |
Keywords
- Graham partition
- genetic algorithm
- reinforcement learning
- triangular number