Project Euler/61: Difference between revisions
From charlesreid1
(Created page with "==Problem Statement== Link: https://projecteuler.net/problem=61 ==Solution Technique== ==Code== ==Flags== {{ProjectEulerFlag}}") |
No edit summary |
||
| Line 1: | Line 1: | ||
==Problem Statement== | ==Problem Statement== | ||
This problem explores an extension of the concept of a triangular number, generated by the formula <math>\dfrac{n(n+1)}{2}</math>, to other shapes. | |||
Exploring triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers - numbers that are generated according to particular formulae: | |||
<math> | |||
P_{3,n} = \dfrac{n(n+1)}{2} | |||
</math> | |||
<math> | |||
P_{4,n} = n^2 | |||
</math> | |||
<math> | |||
P_{5,n} = \dfrac{n(3n-1)}{2} | |||
</math> | |||
<math> | |||
P_{6,n} = n(2n-1) | |||
</math> | |||
<math> | |||
P_{7,n} = \dfrac{n(5n-3)}{2} | |||
</math> | |||
<math> | |||
P_{8,n} = n(3n-2) | |||
</math> | |||
Link: https://projecteuler.net/problem=61 | Link: https://projecteuler.net/problem=61 | ||
| Line 6: | Line 34: | ||
==Code== | ==Code== | ||
https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/061 | |||
==Flags== | ==Flags== | ||
{{ProjectEulerFlag}} | {{ProjectEulerFlag}} | ||
Revision as of 10:17, 8 January 2018
Problem Statement
This problem explores an extension of the concept of a triangular number, generated by the formula $ \dfrac{n(n+1)}{2} $, to other shapes.
Exploring triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers - numbers that are generated according to particular formulae:
$ P_{3,n} = \dfrac{n(n+1)}{2} $
$ P_{4,n} = n^2 $
$ P_{5,n} = \dfrac{n(3n-1)}{2} $
$ P_{6,n} = n(2n-1) $
$ P_{7,n} = \dfrac{n(5n-3)}{2} $
$ P_{8,n} = n(3n-2) $
Link: https://projecteuler.net/problem=61
Solution Technique
Code
https://charlesreid1.com:3000/cs/euler/src/master/scratch/Round2_050-070/061
Flags
