We deliver solutions for the AI eraâcombining symbolic computation, data-driven insights and deep technical expertise
A Frobenius equation is an equation of the form
where , …, are positive integers, is an integer, and the coordinates , …, of solutions are required to be non‐negative integers.
The Frobenius number of , …, is the largest integer for which the Frobenius equation has no solutions.
FrobeniusSolve[{a1,…,an},b] give a list of all solutions of the Frobenius equation FrobeniusSolve[{a1,…,an},b,m] give solutions of the Frobenius equation ; if less than solutions exist, give all solutions FrobeniusNumber[{a1,…,an}] give the Frobenius number of , …,Functions for solving Frobenius equations and computing Frobenius numbers.
This gives all solutions of the Frobenius equation : This gives one solution of the Frobenius equation : This shows that indeed, the Frobenius equation has no solutions: Here are all the ways of making 42 cents change using 1, 5, 10, and 25 cent coins: Using 24, 29, 31, 34, 37, and 39 cent stamps, you can pay arbitrary postage of more than 88 cents:RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4