I'm trying to work out this MITPrimes Neural Code problem (Problem #7). Can anyone who knows this stuff give me a few tips on how to approach this problem?Pell’s Equation can be used to generate infinitely many pairs of powerful numbers. Can this or something similar be used to generate infinitely many pairs of powerful numbers inside a coprime arithmetic progression?
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
@Vishruth Bharath What about Logimath round 3?? When will it start?? And when will we get the results of round 2?? Meanwhile lemme think abt this question......
Log in to reply
@Aaghaz Mahajan Sorry for the delay for LogiMath, but there has been a significant problem within the foundation... so we'll have to delay round 3