Alexa66's blog

Very "EASY" problem;)
By Alexa66, history, 6 years ago, In English

See the image. Its approximate problem

  • Vote: I like it
  • +26
  • Vote: I do not like it

Comments Comments (10)
| Write comment?
»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I am NOT sure if this works, but from a first glance, it seems appropriate.

Code
→ Reply
  • »
    »
    6 years ago, hide # ^ |
    ← Rev. 3  
    Vote: I like it -6 Vote: I do not like it

    This doesn't work.

    We have $$$45 + 6 = 36 + 15 = 51 \Leftrightarrow \frac{9 \times 10}{2} + \frac{3 \times 4}{2} = \frac{8 \times 9}{2} + \frac{5 \times 6}{2}$$$.

    → Reply
    • »
      »
      »
      6 years ago, hide # ^ |
       
      Vote: I like it +3 Vote: I do not like it

      I think what you suggested is not valid as it doesn't supplied any pairwise sum. Both equal to 30 doesn't imply that the solution is wrong.

      → Reply
  • »
    »
    6 years ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it +3 Vote: I do not like it

    As $$$10 + 66 = 21 + 55$$$, your solution is incorrect.

    → Reply
»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I was interested as well, but easily can be found with a quick google search (look at solution 2 for construction).

https://artofproblemsolving.com/wiki/index.php/2001_IMO_Shortlist_Problems/N6

→ Reply
  • »
    »
    6 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    yeah it will give if its possible. but how will u print all the numbers

    → Reply
    • »
      »
      »
      6 years ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      Like i said solution 2 says the construction. You iterate through a for loop and print (2 * p * i + i^2 mod p) for each i from 1 to p, where p is a prime large enough to fit the constraints of the problem.

      → Reply