Consider the set of ordered triples , with , , and being integers, and that
How many elements in exist does not satisfy the condition ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
By the substitution of k = y z , we reduce this to the form
x k = k x
Which, by all means, will make it clear that x = k makes the statement true (well, uhm, that is aside from the two other solutions, i.e., x = 2 , k = 4 and x = 4 , k = 2 ) . This will mean that for all x = n n for some integer n , and this will give us an infinite set of triples of the form ( n n , n , n ) for all positive integers n > 2 . There.