Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Repo implementation #259

Open
NathanCheshire opened this issue Feb 26, 2023 · 0 comments
Open

Repo implementation #259

NathanCheshire opened this issue Feb 26, 2023 · 0 comments
Assignees

Comments

@NathanCheshire
Copy link
Owner

NathanCheshire commented Feb 26, 2023

  • implement a dollar splitting algorithm visualizer/widget

This is a classic discrete math problem but we should allow the user to enter a dollar amount and choose between brute force or iterative algorithms. We could also display the coins visually with an 3x label or such

  • implement the GOO algorithm after you think about it more

The core of the GOO (Group Order Optimizer) algorithm is an algorithm to find the maximum order of an nth symmetric group. For example, s5 is (12345) and the max order is (123)(45) which equals 3x2 or 6. Basically the numbers 1-n are put into a cycle and the goal is to make disjoint cycles which produce a maximum order.

@NathanCheshire NathanCheshire self-assigned this Feb 26, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant