- #1
herraotic
- 4
- 0
Let a,b>1 be integers such that for all n>0 we have a^n-1|b^n-1. Then b is a natural power of a. I can't find a solution.
It doesn't look right to me. As far as I can tell you have a|b and nothing else. In other words if b/a is an integer, then so is (b/a)n.herraotic said:Let a,b>1 be integers such that for all n>0 we have a^n-1|b^n-1. Then b is a natural power of a. I can't find a solution.
Since your hypothesis is for all n, then for n=2, you are assuming a|b, which means b/a is an integer. Since all positive integer powers of integers are integers, there seems to be nothing else there.Martin Rattigan said:Well mathman doesn't actually give a counterexample or prove a|b unless I'm missing something in, "In other words ...", so no progress so far.
Converse is easy to prove, and the result looks very plausible, but what is the origin of the question? I.e. is this likely to be a Sundy afternoon problem?
Martin Rattigan said:Well mathman doesn't actually give a counterexample or prove a|b unless I'm missing something in, "In other words ...", so no progress so far.
Converse is easy to prove, and the result looks very plausible, but what is the origin of the question? I.e. is this likely to be a Sundy afternoon problem?
Your first step fails: the hypothesis that b is not a power of a does not imply that b is divisible by a prime that doesn't divide a.Petek said:Actually, I think my previous post is a complete solution to the problem. I wanted to acknowledge your contribution.
Petek
Hurkyl said:Your first step fails: the hypothesis that b is not a power of a does not imply that b is divisible by a prime that doesn't divide a.
e.g. consider b = 12 and a = 6.
I agree that Mathman and I were probably reading the problem incorrectly, because given thatMartin Rattigan said:I've just read Dodo's note and the previous replies now make more sense. But I think what he says is certainly correct. It is the case that
[itex](\exists k\in N)b=a^k\implies(\forall n\in N)a^n-1|b^n-1[/itex]
I think we're being asked to prove the converse. The question wouldn't make much sense read the other way.
The converse is likely to be a lot more awkward, which is why I wanted to get an idea of how much more awkward before I started thinking about it.
Number theory is a branch of mathematics that studies the properties and relationships of numbers. It focuses on understanding the patterns and structures of numbers, including prime numbers, integers, and rational numbers.
A number theory problem is a mathematical question or puzzle that involves the properties and relationships of numbers. These problems often require creative thinking and use of mathematical concepts to find a solution.
When approaching a number theory problem, it is important to carefully read and understand the given information. Then, try to identify any patterns or relationships between the numbers involved. You can also use known theorems and techniques from number theory to help solve the problem.
Some common techniques used in number theory include prime factorization, modular arithmetic, and the Chinese remainder theorem. Other techniques such as Euclid's algorithm and Fermat's little theorem can also be useful in solving number theory problems.
To improve your skills in number theory, it is important to practice solving different types of problems and familiarize yourself with various techniques and theorems. You can also read books and attend lectures or workshops to deepen your understanding of number theory concepts and applications.