GitHub - AndyGrant/Subset: Find the largest subset of [1..N] s.t. no three unique values' product is a square

AndyGrant / Subset Public

Find the largest subset of [1..N] s.t. no three unique values' product is a square

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
Python		Python
Subsets		Subsets
Makefile		Makefile
Subset.c		Subset.c
Subset.h		Subset.h

About

Find the largest subset of [1..N] s.t. no three unique values' product is a square

No releases published

No packages published