Search   Keyword Search
 
Page : 1
Search Result
DIGITAL DICE: COMPUTATIONAL SOLUTIONS TO PRACTICAL PROBABILITY PROBLEMS by NAHIN, PAUL J. (Hardcover - 2008)
ISBN: 9780691126982
Subject: SCIENCE & NATURE
Publisher: PRINCETON UNIVERSITY PRESS USA
DR. EULER'S FABULOUS FORMULA : CURES MANY MATHEMATICAL ILLS by NAHIN, PAUL J (Hardcover - 2006)
ISBN: 9780691118222
Subject: N/A
Publisher: PRINCETON UNIVERSITY PRESS
DR. EULER'S FABULOUS FORMULA: CURES MANY MATHEMATICAL ILLS by NAHIN, PAUL J. (Paperback - 2017)
ISBN: 9780691175911
Subject: SCIENCE & NATURE
Publisher: PRINCETON UNIVERSITY PRESS
HOW TO FALL SLOWER THAN GRAVITY by NAHIN, PAUL J. (Paperback - 2021)
ISBN: 9780691229171
Subject: SCIENCE & NATURE
Publisher: PRINCETON UNIVERSITY PRESS
IMAGINARY TALE: THE STORY OF "I" [THE SQUARE ROOT OF MINUS ONE] by NAHIN, PAUL J. (Paperback - 2007)
ISBN: 9780691127989
Subject: SCIENCE & NATURE
Publisher: PRINCETON UNIVERSITY PRESS USA
IMAGINARY TALE: THE STORY OF ¡Ô-1 by NAHIN, PAUL J. (Paperback - 2016)
ISBN: 9780691169248
Subject: SCIENCE & NATURE
Publisher: PRINCETON UNIVERSITY PRESS
IMAGINARY TALE: THE STORY OF THE SQUARE ROOT OF MINUS ONE by NAHIN, PAUL J. (Hardcover - 1998)
ISBN: 9780691027951
Subject: SCIENCE & NATURE
Publisher: PRINCETON UNIVERSITY PRESS US
IN PURSUIT OF ZETA-3: THE WORLD'S MOST MYSTERIOUS UNSOLVED MATH PROBLEM by NAHIN, PAUL J. (Hardcover - 2021)
ISBN: 9780691206073
Subject: SCIENCE & NATURE
Publisher: PRINCETON UNIVERSITY PRESS
TIME MACHINES: TIME TRAVEL IN PHYSICS, METAPHYSICS, AND SCIENCE FICTION by NAHIN, PAUL J. (Paperback - 1999)
ISBN: 9780387985718
Subject: SCIENCE
Publisher: SPRINGER
WHEN LEAST IS BEST: HOW MATHEMATICIANS DISCOVERED MANY CLEVER WAYS TO MAKE THINGS AS SMALL (OR AS LARGE) AS POSSIBLE by NAHIN, PAUL J. (Paperback - 2007)
ISBN: 9780691130521
Subject: SCIENCE & NATURE
Publisher: PRINCETON UNIVERSITY PRESS USA
   
    Home
    Upcoming Events
    Special Offer
    Kobo eReader
    My Account
    View Cart
    Order History
    Recommendation
    Of The Month
    Textbooks
    About Us
    Contact Us
    FAQs