Skip to content

Functions to test whether all positive integers under a given interval can be written as the sum of n Platonic numbers, based on Pollock's conjectures.

Notifications You must be signed in to change notification settings

lightediand/platonic-sums

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 

Repository files navigation

Based on Pollock's conjectures regarding sums of Platonic numbers, the functions test whether every positive integer in a given range can be written as at most:

  • 5 tetrahedral numbers
  • 7 octahedral numbers
  • 9 cube numbers
  • 13 icosahedral numbers
  • 21 dodecahedral numbers

All were conjectured to output the empty set, however we observe non-empty outputs for the icosahedral and dodecahedral cases. The smallest counterexample to the icosahedral case is 47, and the smallest counterexample to the dodecahedral case is 79.

About

Functions to test whether all positive integers under a given interval can be written as the sum of n Platonic numbers, based on Pollock's conjectures.

Topics

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages