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:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
For small numbers, you can guess. E.g. y=1,x=2760 works. You can also just try x=1,2,3,… and hopes it works out (which it eventually will).
The Extended Euclidean Algorithm for an algorithm that guarantees finding the values within a reasonable amount of time. I think it is on the order of O(logn), instead of testing all values which has the order of O(n).
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
Hint: 2x+3y=2x+3y−6n+6n=2(x−3n)+3(y+2n)=763. And find the smallest and largest integer solution of x that satisfy the original equation.
What have you tried? Where did you get stuck?
Check out Linear Diophantine Equations.
Log in to reply
Sir, isn't there a much time saving way ? Because finding the first random solutions takes a lot time even if you go by the Division Algorithm.
Log in to reply
Not particularly.
For small numbers, you can guess. E.g. y=1,x=2760 works. You can also just try x=1,2,3,… and hopes it works out (which it eventually will).
The Extended Euclidean Algorithm for an algorithm that guarantees finding the values within a reasonable amount of time. I think it is on the order of O(logn), instead of testing all values which has the order of O(n).