Question is :

If m,k,n are natural numbers and n>1, prove that we cannot have m(m+1)=kn.

My attempt :

Using induction:

If m follows this rule... m+1 must follow it ..
so
(m+1)(m+2) = kn
Since every natural number can be expressed as the product of primes, it follows that (m+1) and (m+2) are primes.
Now, my question is...
are there any two consecutive primes which can be expressed in the form of kn.

Thanks for any help.
 PhysOrg.com science news on PhysOrg.com >> Leading 3-D printer firms to merge in $403M deal (Update)>> LA to give every student an iPad;$30M order>> CIA faulted for choosing Amazon over IBM on cloud contract

 Quote by physics kiddy Since every natural number can be expressed as the product of primes, it follows that (m+1) and (m+2) are primes.
Why?

Also where have you used the induction step?

Blog Entries: 2
 Quote by physics kiddy \Since every natural number can be expressed as the product of primes, it follows that (m+1) and (m+2) are primes. Thanks for any help.
I think you don't understand what is met by "product of primes" . For m = 13, m+1= 14 and m+2 = 15. 14*15 is a product of primes, i.e. 2*3*5*7 but neither 14 or 15 are primes.

hint: m and (m+1) are relatively prime, so any prime factor of k, divides either m or m+1

 Quote by willem2 hint: m and (m+1) are relatively prime, so any prime factor of k, divides either m or m+1
I believe you proved it. Since k divides either of m or m+1, it is not expressible in the form of kn because then it would have to divide both m and m+1.
Is that enough or needs a better proof ?

Thanks for the hint ....

 Quote by physics kiddy I believe you proved it. Since k divides either of m or m+1, it is not expressible in the form of kn because then it would have to divide both m and m+1. Is that enough or needs a better proof ? Thanks for the hint ....
It isn't that simple. Some of the prime factors of k could divide m, and some of them could divide m+1, but none of them can divide both.

Spoiler
This means that if a prime factor p of k divides m, then p^n has to divide m, so m has to be an n'th power, and so has m+1, but different n'th powers differ by more than one if m>0, so m and m+1 can't be both n'th powers, but we just proved they have to be, producing a contradiction
 The thing to notice is that m and m+1 are relatively prime. This means that the only factor of k which can divide m and m+1 simultaneously is 1. Hence both m and m+1 must be nth powers. This is impossible for n>1.
 I have found a solution to the problem. It was a bit difficult to type, so I wrote it and attached two .jpg files. Let me know if it's correct ... Attached Thumbnails

 Quote by physics kiddy I have found a solution to the problem. It was a bit difficult to type, so I wrote it and attached two .jpg files. Let me know if it's correct ...
Nope. You've proved that k can't be a factor of m. There's no reason why k has to be a factor of m or m+1
 I request you to consider it once again. Let me be clear with it ... If m(m+1) = k^n, then m(m+1)/k*k ... n = 1 alright upto here ? Then it's clear that k must divide either m or m+1 but it can't divide both. I don't believe there's anything wrong with it. I would like to seek opinion of others (mathsman1963,ramsey) also. If they say it's not upto mark, then I would pick some other step. Thanks.

 Quote by physics kiddy Then it's clear that k must divide either m or m+1 but it can't divide both.
No it's not obvious. Suppose k is the product of two primes, ##k=pq##. Then it's entirely possible that ##p | m## and ##q | m+1##. You need to argue that this is impossible.

Blog Entries: 2
 Quote by willem2 hint: m and (m+1) are relatively prime, so any prime factor of k, divides either m or m+1
This and other posts by willem2 are very good hints. Note that willem2 said any "prime factor" of k had to divide either m or m+1. You need to give consideration to why willem 2 was so specific. If 10 divides 14*15, there is no reason why 10 must divide both 14 and 15. You need consider what are the prime factors of k and how many times each factor appears in k^n. For instance if k^3 = 3^3 * 7^12 * 2^6 divides m * (m+1) Then at least one of 3^3, 7^12 and 2^6 must divide m and those that don't divide m must divide m+1. Why is this and why is it not possible. You merely need to look at the posts by willem2 to answer this question. You have proven you have what is needed to solve this problem, you just need to put it all together. Please keep trying, and you will get it.
P.S. problems in number theory are interesting in that the details can be put into specific criteria and that there are facts that if properly associated with specific criteria will allow for solutions to more complicated problems. Some problems have proven to be seemingly imposible to solve, but that only makes it more interesting. You have a interest in math. This is good since the world need good mathematicans. In number theory, products of primes, squares, congruences, and powers of numbers are basic building blocks. Once you understand those, there are a whole world of interesting concepts to explorer.
 I now understand what you people wanna say .... but I don't find any way to solve the problem that way ... For example I considered the number 6 = 2 * 3. Simply, I can say that 2(3) when divided by k = 6 is divisible by k as n = 1 here but k = (6)^2 can't divide 2(3). How do I put it in variables. I am new to number theory. Please give a solution this time ... I would certainly try some other on my own some day.

Blog Entries: 2
 Quote by physics kiddy I now understand what you people wanna say .... but I don't find any way to solve the problem that way ... For example I considered the number 6 = 2 * 3. Simply, I can say that 2(3) when divided by k = 6 is divisible by k as n = 1 here but k = (6)^2 can't divide 2(3). How do I put it in variables. I am new to number theory. Please give a solution this time ... I would certainly try some other on my own some day.
OK I will be as specific as I can. Every number k can be written as a product of primes, say k = (P1)^(i1) * (P2)^(i2)*(P3)^(i3)*...(Pm)^(im) and k^n = (P1)^(i1*n)*(P2)^(i2*n)*...(Pm)^(im*n). Thus the power of each prime is divisible by n. Assume that k^n = m*(m+1). Since m and m+1 are coprime, m must equal (Pj)^(ij*n)*...(Pk)^(ik*n) = (k')^n and m+1 must equal (Pf)^(if*n)*...(Pl)^(il*n). Since each power of the prime factors of m is divisible by n and each power of the prime factors of m+1 are divisible by n, m and m+1 much each be a number to the nth power. Thus we have a proof by contridiction since for n>1 like powers of numbers must differ by more than 1 or we must have m = 0 in which case there are no prime factors.
 Recognitions: Homework Help Science Advisor say n = 2. then m and m+1 are both squares, which is not likely.
 I got it. Thanks a lot for teaching me something new. Such fabulous proofs of number theory make me a fan of it. I wanna master it but don't know where to begin. Please suggest me some books. Thanks again ...
 Recognitions: Homework Help Science Advisor there are many good books on number theory at a wide variety of prices. here is a good elementary one cheap. http://www.amazon.com/Elementary-Num...+number+theory

 Similar discussions for: a mathematics olympiad problem Thread Forum Replies Precalculus Mathematics Homework 8 General Math 9 Precalculus Mathematics Homework 7 Science Textbook Discussion 1 General Math 4