This Lesson (How many integers of the form n^2 + 18n + 13 are perfect squares) was created by by ikleyn(52781)  : View Source, ShowAbout ikleyn:
How many integers of the form n^2 + 18n + 13 are perfect squares
Problem 1How many integers of the form n^2 + 18n + 13 are perfect squares?
Solution
It looks AMAZINGLY, but there is the way to solve the problem formally, in strict Algebra logic, without trials and errors.
Let n^2 + 18n + 13 = m^2 be a perfect square.
Then
(n + 9)^2 - 68 = m^2
(n + 9)^2 - m^2 = 68
(n + m + 9)*(n - m + 9) = 68.
Decompositions for 68 are 1*68, 2*34, 4*17, 17*4, 34*2 and 68*1.
For each decomposition, we have the system of equations
n + m + 9 = 1
n - m + 9 = 68
n + m + 9 = 2
n - m + 9 = 34
n + m + 9 = 4
n - m + 9 = 17
n + m + 9 = 17
n - m + 9 = 4
n + m + 9 = 34
n - m + 9 = 2
n + m + 9 = 68
n - m + 9 = 1
Easy analysis shows that some of these systems produce non-integer solutions, that are out of our scope.
The only system, which produces appropriate integer solutions, is THIS
n + m + 9 = 34
n - m + 9 = 2
The solution is n = 9, m = 16.
Therefore, n = 9 is the solution to the problem.
If you analyze the same systems with decomposition of the number 68 into the product of negative factors,
you will find another solution n = -27.
In all, there are 2 (two) such numbers n, 9 and -27.
Problem 2Prove that there are infinitely many natural numbers n such that is irrational.
Solution
Consider any integer positive number " n ", which has the last digit of 2.
(In other words, consider any integer positive number n such that n = 2 (mod 10) ).
For example, such numbers "n" are 12, 22, 32, 42, 52 . . . and so on.
Then the number 19n has the last digit of 8, and the number (19n+9) has the last digit of 7, because 8 + 9 = 17 = 7 (mod 10).
+-------------------------------------------------------------------------+
| But NO ONE such integer positive number is a perfect square (!) |
+-------------------------------------------------------------------------+
(Notice that a square of an integer number may have the last digit only 0, 1, 4, 5, 6, 9, but may not have the last digit of 2, 3, 7, 8).
Therefore, all the numbers (19n +9) with n = 2 (mod 10) are not perfect squares and, THEREFORE, create/produce IRRATIONAL numbers .
My other lessons in this site on miscellaneous problems on divisibility of integer numbers are
- Light flashes on a Christmas tree and a Least Common Multiple
- The number that leaves a remainder 1 when divided by 2, by 3, by 4, by 5 and so on until 9
- Introductory problems on divisibility of integer numbers
- Finding Greatest Common Divisor of integer numbers
- Relatively prime numbers help to solve the problem
- Solving equations in integer numbers
- Quadratic polynomial with odd integer coefficients can not have a rational root
- Proving an equation has no integer solutions
- Composite number of the form (4n+3) must have a prime divisor of the form (4n+3)
- Problems on divisors of a given number
- How many three-digit numbers are multiples of both 5 and 7?
- How many 3-digit numbers are not divisible by 2; not divisible by 3; not divisible by either 2 or 3
- How many integer numbers in the range 1-300 are divisible by at least one of the integers 4, 6 and 15 ?
- Find the remainder of division
- Why 3^n + 7^n - 2 is divisible by 8 for all positive integer n ?
- What is the last digit of the number a^n ?
- Find the last three digits of these numbers
- Find the last two digits of the number 3^123 + 7^123 + 9^123
- Find the last two digits of (1! + 2! + 3! + ... + 2024!)^2024
- Find n-th term of a sequence
- Solving Diophantine equations
- Miscellaneous problems on divisibility numbers
- Find the sum of digits of integer numbers
- Two-digit numbers with digit "9"
- Find a triangle with integer side lengths and integer area
- Math circle level problem on the hundred-handed monster Briareus
- Math Circle level problem on lockers and divisors of integer numbers
- Nice entertainment problems related to divisibility property
- Solving problems on modular arithmetic
- Using the little Fermat's theorem to solve a problem on modular arithmetic
- OVERVIEW of miscellaneous solved problems on divisibility of integer numbers
This lesson has been accessed 1138 times.
|