Skip to main content
Mathematica

Return to Question

added a tag
Source Link
Artes
Artes
  • 58.2k
  • 13
  • 161
  • 251

I want to use Mathematica to solve the problem:

Find the maximum $k$ such that $6x+9y+20z=k$ does not have a non-negative solution.

I tried FrobeniusSolve. But what is the elegant way to find the maximum?

I know the theoretical background of this problem, and I know other ways of getting the solution. But I want to see how this can be done elegantly in a program in Mathematica.

I want to use Mathematica to solve the problem:

Find the maximum $k$ such that $6x+9y+20z=k$ does not have a non-negative solution.

I tried FrobeniusSolve. But what is the elegant way to find the maximum?

I know the theoretical background of this problem, and I know other ways of getting the solution. But I want to see how this can be done elegantly in a program in Mathematica.

I want to use Mathematica to solve the problem:

Find the maximum $k$ such that $6x+9y+20z=k$ does not have a non-negative solution.

I tried FrobeniusSolve. But what is the elegant way to find the maximum?

I know the theoretical background of this problem, and I know other ways of getting the solution. But I want to see how this can be done elegantly in Mathematica.

added 3 characters in body; edited tags; edited title
Source Link
J. M.'s missing motivation
J. M.'s missing motivation
  • 126.6k
  • 11
  • 411
  • 590

maximum Finding the largest integer not able to partitionthat cannot be partitioned in Mathematicaa certain way

I want to use MathematicaMathematica to solve the problem: find the maximum k such that 6x+9y+20z=k does not have non-negative (x,y,z) solution.

Find the maximum $k$ such that $6x+9y+20z=k$ does not have a non-negative solution.

I tried FrobeniusSolve. But what is the elegant way to find the maximum?

I know the theoretical background of this problem, and I know other ways of getting the solution. But I want to see how this can be done elegantly in a program in MathematicaMathematica.

maximum integer not able to partition in Mathematica

I want to use Mathematica to solve the problem: find the maximum k such that 6x+9y+20z=k does not have non-negative (x,y,z) solution.

I tried FrobeniusSolve. But what is the elegant way to find the maximum?

I know the theoretical background of this problem, and I know other ways of getting the solution. But I want to see how this can be done elegantly in a program in Mathematica.

Finding the largest integer that cannot be partitioned in a certain way

I want to use Mathematica to solve the problem:

Find the maximum $k$ such that $6x+9y+20z=k$ does not have a non-negative solution.

I tried FrobeniusSolve. But what is the elegant way to find the maximum?

I know the theoretical background of this problem, and I know other ways of getting the solution. But I want to see how this can be done elegantly in a program in Mathematica.

Tweeted twitter.com/#!/StackMma/status/339518443659354112
Source Link
Qiang Li
Qiang Li
  • 1.2k
  • 10
  • 19

maximum integer not able to partition in Mathematica

I want to use Mathematica to solve the problem: find the maximum k such that 6x+9y+20z=k does not have non-negative (x,y,z) solution.

I tried FrobeniusSolve. But what is the elegant way to find the maximum?

I know the theoretical background of this problem, and I know other ways of getting the solution. But I want to see how this can be done elegantly in a program in Mathematica.