Extending The Linear Diophantine Problem: a.k.a. 'The Frob prob',Used

Extending The Linear Diophantine Problem: a.k.a. 'The Frob prob',Used

In Stock
SKU: DADAX3845405139
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$69.62
Quantity
Add to wishlist
Add to compare
Sold by Ergodebooks, an authorized reseller.

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Given integervalued relatively prime coins' a1; a2; :::; ak, the Frobenius number is the largest integer n such that the linear diophantine equation a1m1 + a2m2 + ::: + akmk = n has no solution in nonnegative integers m1;m2; :::;mk. We denote by g(a1; :::; ak) the largest integer value not attainable by this coin system. That is to say that any integer x greater than the Frobenius number g(a1; :::; ak) has a representation x = a1x1 + a2x2 + ::: + akxk by a1; a2; :::; ak for some nonnegative integers x1; x2; :::; xk. We say x is representable by a1; a2; :::; ak. While it is obvious that there are representable positive integers and nonrepresentable positive integers, must there be a largest nonrepresentable integer? Maybe there are indefinitely large nonrepresentable integers for a1; a2; :::; ak with gcd (a1; a2; :::; ak) = 1. This notion of whether or not the Frobenius number is welldefined will be the first bit of mathematics we look at in this paper. Proposition 1.1. The Frobenius number g(a1; :::; ak) is welldefined. Proof. Given a1; a2; :::; ak with gcd (a1; a2; :::; ak) = 1, the extended Euclidean algorithm gives that there exist m1;m2; :::;mk 2 Z such that...

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed