Shopping Cart (0 items)
View Cart (0 items)
100% Satisfaction Guaranteed
Shopping Cart (0 items)
View Cart (0 items)
100% Satisfaction Guaranteed
15% Off All Orders + 50% Off Business Cards - Perfect Impressions!    Ends Soon!    Code: BUSINESSSALE    Details

Uh oh...Unknown 0 can’t display all the features of our site.

May we suggest an alternative browser? Because you won’t want to miss out on all this goodness.
Coprime Lattice of 4 and 9 Coffee Mug
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.
Right
Right
Center
Center
Left
Left
Handle
Handle
Safe area(what is this?)
Design area
Bleed line

Product Details

Read more...

About the Design

Coprime Lattice of 4 and 9
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.
Read more...
Created By TheCommitteeTo :
 Report this product

Psst... we can't move forward 'til you fix the errors below.

$15.95
per mug
Qty:
The value you specified is invalid.
* plus applicable embroidery conversion fee
In Stock Ships by Mon, Aug 25 100% Satisfaction No Setup Fees No Minimum Orders Highest Quality No Hassle Returns
Add to wishlist
The value you specified is invalid.
Also add to:
Added to wishlist
Like
Help us personalize your shopping experience by telling us what you like. (learn more)
Share
Share an image of this product on a blog, on a website, or with your friends.
Your design has been saved.
Only $2.00 more on Ringer Mug
Style:
$15.95
Color:
Size:
SWEET! This Product Qualifies For: 15% Off All Orders + 50% Off Business Cards - Perfect Impressions!    Ends Soon!    Code: BUSINESSSALE    Details

More Essential Accessories

Reviews

5 star:
2825
4 star:
387
3 star:
93
2 star:
43
1 star:
23
98% reviewers would recommend this to a friend
This product is most recommended for Myself
Have you purchased this product?  Write a review!

Comments

No comments yet.

Other Info

Product ID: 168591666934840323
Made on: 9/10/2009 8:57 AM
Reference: Guide Files