Hi Brilliantants, can you help me in solving this tough question on primes.

**Ques:** What is the largest value of \(ab\) if it is given that \(ab\) divides \((a^{2}+1)(b^{2}+1)\) completely where \(a\) and \(b\) are positive prime numbers and \(ab<10^{6}\).

Please post full solutions to enrich my knowledge.

Thanks.

:)

## Comments

Sort by:

TopNewestHint:Ignore the condition that \(a, b \) are prime numbers.Classify all pairs of positive integers that satisfy \( \frac{ b^2+1}{a} \) and \( \frac{ a^2 + 1 } { b} \) are integers.

Hint:Read this wikiAnd finally, here's the problem, which has a great solution by @Bojan Serafimov – Calvin Lin Staff · 2 years ago

Log in to reply

Without loss of generality, let \(b\geq a\).

\((2, 5)\) works.

Note that if \((a, b)\) satisfies our conditions, so does \((b, \frac{b^2+1}{a})\) [See the wiki Calvin linked]. And with this algorithm, we can generate as many \((a, b)\) as we like and make \(ab\) as large as we want [notice that \(\frac{b^2+1}{a}>b\) since \(b\geq a\)].

\((2, 5) \rightarrow (5, 13) \rightarrow (13, 34) \rightarrow (34, 89) \rightarrow \cdots\)

This is where I'm stuck. As we can see, not all the pairs contain prime numbers. And there's no way [that I can think of] to directly generate the \(n\)-th pair where \(n\) is any positive integer without finding out all the pairs that came before it.

So now we have some very tedious calculation ahead of us. We basically have to find all the pairs upto \((a_n,b_n)\) where \(a_nb_n<10^6\) and \(a_{n+1}b_{n+1} \geq 10^6\)

andthen check if \(a_n\) and \(b_n\) are both primes. If they are not, we have to backtrack and find such a pair that is.Is there any way around this?

Can anyone help? – Mursalin Habib · 2 years ago

Log in to reply

original source is a problem I created, which is why I didn't want to give away too much.

TheThe condition of prime numbers was a intentional red herring, that was meant to disguise the possible approach to this problem.

There are not that many pairs up to \( _an b_n < 10^ 6 \Rightarrow b_n < 1000 \), because the numbers grow exponentially (I think there is a total of 10 or so). So just list out the pairs till you are done.

With Vieta Root jumping, you typically want to go "as low as possible", in order to ensure that you got everything. In this case, \( (2,5) \) should not be your starting value, because it leaves the possibility of other starting pairs of the form \( (1,n) \) or even \( (2,n) \). – Calvin Lin Staff · 2 years ago

Log in to reply

– Yash Singhal · 2 years ago

Actually, this problem was given to me by my friend. I found it quite difficult at the first sight and hence posted here so that I can get a solution to this problem. Really, Vieta Root Jumping is a very nice technique to solve these type of questions. Thanks for your help Calvin sir, Mursalin and Jubayer.Log in to reply

For those who fixated about the fact that the numbers were prime, merely looking for prime numbers would provide you with no information to work with. Those who do so often end up having to do a tedious search through all prime pairs as in Jubayer's coding solution. Relaxing the condition from primes to integers makes is slightly easier to deal with.

This also highlights an approach to problem solving, which most people do not use. The idea is to start out with the most general of statements and relax the conditions, then impose restrictions along the way as we see obstacles and push through. As an example, see Solving problems from the back. – Calvin Lin Staff · 2 years ago

Log in to reply

Thank you for linking the original problem. I had seen it before but couldn't solve it back then. It just goes to show how much I've learnt here.

I also want to point out the how good the solution-discussion for that problem is. We don't see this often now. That is what I was trying to say the other day. – Mursalin Habib · 2 years ago

Log in to reply

Brilliant is a small startup, and we have to choose what aspects we can work on. I think it is really amazing what we have achieved in these past 2 years, which most people would not think was possible. We managed to:

- demonstrate that many people are willing to spend 2-5 hours a week solving math problems. (This is not limited to just the best and brightest).

- pique the interest of those who are ambivalent about math, and help them develop a liking and eagerness to it. (Stories of "I used to hate math. Then I joined Brilliant, and now I am addicted.")

- show that sustained activity on the site leads to improved ability (see your comment)

- show that a community is able to generate problems that are interesting to themselves (look at community tab) - demonstrate an ability to reach across borders and into outlying regions (by focusing on the simplicity of a problem, even those with slow internet access can work on them, instead of having to download a video) - figure out avenues for people to learn about things outside their curriculum (We are still working on this).

- and many more

Of course, in choosing what we do, there are trade-offs / opportunity costs. For example, when we were only posting a small number of weekly problems, there was a demand to "see everything". As a result of that, we did see an increase in solving easier problems, and a decrease in solving hard problems which led to a decrease in solution quality. At that point in time, because solutions were gated and released only the week after, I had the power to select only the best solution and add minor edits to improve them significantly, so this effect was not felt/seen. Over time, with product changes like making solutions immediately available and expanding out to the community generating problems, I no longer had control over solution discussions, and you saw the full extent of what people will submit.

There are certainly ways that we can help to improve solution discussions, and I have a vision for what it should be like. I recognize that it is not possible to leap to that immediately, but it is a journey of many steps. – Calvin Lin Staff · 2 years ago

Log in to reply

Log in to reply