FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Not safe to deliver by Christmas NOTSANTA SAFE
    Diophantine Frobenius Problem

Diophantine Frobenius Problem

Jorge L. Ramirez Alfonsin
    Product form
      FORMAT: Hardback

      R 7,734.00 Price and availability exclusive to website

      YOU COULD EARN 7,734 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 20 - 30 Business Days
      BUY NOW PAY LATER
      From R 1,289.00 per month!
      3x monthly payments of R 2,578.00 with
      4x fortnightly payments of R 1,933.50 with
      During the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised he following problem, known as the Frobenius Problem (FP): given relatively prime positive integers a1,...,an, find the largest natural number (called the Frobenius number and denoted by g(a1,...,an) that is not representable as a nonnegative integer combination of a1,...,an, .At first glance FP may look deceptively specialized. Nevertheless it crops up again and again in the most unexpected places and has been extremely useful in investigating many different problems. A number of methods, from several areas of mathematics, have been used in the hope of finding a formula giving the Frobenius number and algorithms to calculate it. The main intention of this book is to highlight such methods, ideas, viewpoints and applications to a broader audience.
      Format: CONTRIBUTORS: Jorge L. Ramirez Alfonsin EAN: 9780198568209 COUNTRY: United Kingdom PAGES: WEIGHT: 537 g HEIGHT: 240 cm
      PUBLISHED BY: Oxford University Press DATE PUBLISHED: 2005-12-01 CITY: GENRE: MATHEMATICS / Number Theory WIDTH: 65 cm SPINE:

      Book Themes:

      Number theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      During the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised he following problem, known as the Frobenius Problem (FP): given relatively prime positive integers a1,...,an, find the largest natural number (called the Frobenius number and denoted by g(a1,...,an) that is not representable as a nonnegative integer combination of a1,...,an, .At first glance FP may look deceptively specialized. Nevertheless it crops up again and again in the most unexpected places and has been extremely useful in investigating many different problems. A number of methods, from several areas of mathematics, have been used in the hope of finding a formula giving the Frobenius number and algorithms to calculate it. The main intention of this book is to highlight such methods, ideas, viewpoints and applications to a broader audience.
      Format: CONTRIBUTORS: Jorge L. Ramirez Alfonsin EAN: 9780198568209 COUNTRY: United Kingdom PAGES: WEIGHT: 537 g HEIGHT: 240 cm
      PUBLISHED BY: Oxford University Press DATE PUBLISHED: 2005-12-01 CITY: GENRE: MATHEMATICS / Number Theory WIDTH: 65 cm SPINE:

      Book Themes:

      Number theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account