# Difference between revisions of "Project Euler/61"

### From charlesreid1

(→Code) |
m (Replacing charlesreid1.com:3000 with git.charlesreid1.com) |
||

Line 45: | Line 45: | ||

==Code== | ==Code== | ||

− | https://charlesreid1.com | + | https://git.charlesreid1.com/cs/euler/src/master/scratch/Round2_050-070/061/GuavaFigurate.java |

==Flags== | ==Flags== | ||

{{ProjectEulerFlag}} | {{ProjectEulerFlag}} |

## Latest revision as of 03:49, 9 October 2019

## Problem Statement

This problem explores an extension of the concept of a triangular number, generated by the formula , to other shapes.

Exploring triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers - numbers that are generated according to particular formulae:

Link: https://projecteuler.net/problem=61

## Solution Technique

**CURRENTLY UNSOLVED**

Our solution technique is to generate a graph (for this, we use the Guava library).

We wish to find the sum of the ordered set of six cyclic 4-digit numbers for which *each* polygonal type, triangle/square/pentagonal/hexaongal,/heptagonal,octagonal, is represented by a different permutation of the digits (maintaining original order).

To do this, we create a graph, with each possible connection between a prefix and a suffix marked with an edge.

This results in a 6-partite graph, and we seek a path, a cycle, that passes through all 6 partitions.

## Code

https://git.charlesreid1.com/cs/euler/src/master/scratch/Round2_050-070/061/GuavaFigurate.java

## Flags

Project Euler
Problem 1
Problem 11
Problem 51
Problem 100
Problem 500
- = in progress
· Template:ProjectEulerFlag · e |