Shopping Cart (0 items)
View Cart (0 items)
100% Satisfaction Guaranteed
50% Off Hats & 40% Off Totes    |    15% Off Sitewide    |    Use Code: TOTESANDHATS    |     LAST DAY    |    See Details

Coprime Lattice of 4 and 9 Coffee Mug

$15.80

per mug

Qty:
1
15% Off with code TOTESANDHATS
  • Left
    Left
  • Front Left
    Front Left
  • Center
    Center
  • Front Right
    Front Right
  • Right
    Right
  • Handle
    Handle
  • With Donut
    With Donut
Designed for youby The Committee To
Classic Mug
More (7)
Style
Select an option:
Details
Classic Mug
 
Details
Two-Tone Mug
+ $1.05
Details
Combo Mug
+ $2.10
Details
Frosted Glass Mug
+ $5.30
Details
Morphing Mug
+ $6.35
Details
Stein
+ $8.45
Details
Travel/Commuter Mug
+ $10.55
  • Sold by
About This Product
Style: Classic Mug

Give a made-to-order mug from Zazzle to someone special, or treat yourself to a design that brings you joy or makes you laugh. Create your own photo mug, shop our collection of the funniest joke mugs, personalize your mug with a monogram, or express yourself with one of our 10 million designs.

  • Available in 11-ounce or 15-ounce
  • Dimensions:
    • 11-ounce: 3.8” h x 3.2” diameter
    • 15-ounce: 4.5” high x 3.4” diameter
  • Microwave and dishwasher safe
  • Strong, ceramic construction
  • Meets or exceeds FDA requirements for food and beverage safety
  • Printed on demand in San Jose, California
About This Design
available on or 31 products
Coprime Lattice of 4 and 9 Coffee Mug
This lattice illustrates that the integers 4 and 9 are coprime if and only if the point with coordinates (4, 9) in a Cartesian coordinate system is "visible" from the origin (0,0), in the sense that there is no point with integer coordinates between the origin and (4, 9). In mathematics, two integers a and b are said to be coprime or relatively prime if they have no common positive factor other than 1 or, equivalently, if their greatest common divisor is 1. For example, 6 and 35 are coprime, but 6 and 27 are not coprime because they are both divisible by 3. The number 1 is coprime to every integer. A fast way to determine whether two numbers are coprime is given by the Euclidean algorithm. Euler's totient function (or Euler's phi function) of a positive integer n is the number of integers between 1 and n which are coprime to n.
50% Off Hats & 40% Off Totes    |    15% Off Sitewide    |    Use Code: TOTESANDHATS    |     LAST DAY    |    See Details
Reviews
There are no reviews for this product yet.
Have you purchased this product? Write a review!
Loading...