Skip to content

Latest commit

 

History

30 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 

Repository files navigation

MathProblem

This program attempts to find ALL (so no random guessing) solutions to this problem in a more efficient manner than simply going through all possible numbers between 0 and 1 billion::: Rule: the 9 numbers (n1-n9) cannot repeat each other. Find the solutions to this equation: (n1/n2n3+n4n5n6/n7+n8n9)=100

About

This program attempts to find a more efficient way of going through all possible iterations of a sequence of numbers without repeating any element in the sequence. This swapping algorithm has O(n!) (which is the same number as the number of possible combinations, implying a linear relationship between the runtime and number of solutions) rather t…

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages