How many number pairs are there, such that , both of and are integers and is an irrational number?
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.
Denote the irrational number I = ( n + k ) 2 = ( n + k ) + 2 n k An irrational number only exist if and only if n k is not a perfect square number.
Note that there are 1 9 0 numbers pairs for 1 ≤ k < n ≤ 2 0 and counting such all the possible pairs of ( k , n ) for the number to be irrational is tedious job to do however finding all the possible pairs of ( k , n ) such the ( n + k ) 2 is an integer aids us to determine such pairs resulting to irrational number and for which n k should be perfect square number for n = k
Considering case 1 :
Seeking for the perfect square number with Product of distinct factors between 1 to 100 We can take as 1 ≤ n k ≤ 1 0 1 ≤ n k ≤ 1 0 0 ⟹ 4 ≤ n k ≤ 1 0 0 We see that for n k = 4 , 9 , 1 6 and n = k , n k yields a perfect square number for the pairs ( k , n ) = ( 1 , 4 ) , ( 1 , 9 ) , ( 2 , 8 ) , ( 1 , 1 6 ) and there exist no pairs for n k = 2 5 , 4 9 , 8 1 in the defined range since the one of divisor n > 2 0 also they are perfect square number of odd numbers which is only yield if n = k .
Also note that for n k = 3 6 , 6 4 , 1 0 0 possible pairs ( k , n ) = ( 2 , 1 8 ) , ( 4 , 9 ) , ( 3 , 1 2 ) , ( 4 , 1 6 ) , ( 5 , 2 0 ) respectively corresponds n k to a perfect square numbers. So numbers of pairs of numbers of ( n , k ) are 9 .
Considering case 2 : Seeking the perfect square number in between 100 to 400 we can directly reject the odd numbers in between 10 to 20. Only for n k = 1 4 4 pairs of integers are defined for n < 2 0 that are ( 9 , 1 6 ) , ( 8 , 1 8 ) however, for n k = 1 4 , 1 6 , 1 8 , 2 0 the divisor of n k , n > 2 0 .
∴ total pairs of ( n , k ) = 1 9 0 − 1 1 = 1 7 9 .