'Rings, Fields and Groups' gives a stimulating and unusual introduction to the results, methods and ideas now commonly studied on abstract algebra courses at undergraduate level. The author provides a mixture of informal and formal material which help to stimulate the enthusiasm of the student, whilst still providing the essential theoretical concepts necessary for serious study. Retaining the highly readable style of its predecessor, this second edition has also been thoroughly revised to include a new chapter on Galois theory plus hints and solutions to many of the 800 exercises featured.

Rings, Fields and Groups: An Introduction to Abstract Algebra

Politics & Social Sciences

Allenby, R.B.J.T.

Social Sciences

Edward Arnold

This introduction to number theory has been written specifically for mathematics and computing undergraduates. Computer programs in BASIC are accompanied by basic text which explains the subject and demonstrates how computers have opened up new horizons for number theorists.

Introduction to Number Theory With Computing

Computers & Technology

Redfern, E. J.

Software

Hodder Arnold

Emphasizes a Problem Solving Approach A first course in combinatorics Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics. New to the Second Edition This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet’s pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises. Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya’s counting theorem.

How to Count (Discrete Mathematics and Its Applications)

Slomson, Alan

Operating Systems

Chapman and Hall/CRC

See the best price to sell, buy, or rent books by Allenby, R.B.J.T.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Allenby, R.B.J.T.