# Brilliant problem clarification

Hello all, I have a little problem. The problem is deal with the current Brilliant problem about number theory.

My question is Should m and n always different, or are they can be same? Thanks

Note by Leonardo Chandra
4 years, 5 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

The integers m and n can be the same. The answer the website thinks is correct is actually wrong, so if you got the right answer and the website said that you were incorrect, that is why. Hopefully, the staff will fix this soon.

- 4 years, 5 months ago

Thanks for your reply. I've just got the answer, but it's wrong. Jon, I wonder how can you solve this problem: https://brilliant.org/mathematics-problem/let-our-powers-combine/?group=vAjLywc9ZnIz,

I have already used all the try: http://tinypic.com/r/2dhcvtx/5

But, cannot get the correct answer. Maybe you can try to send me your solution via my e-mail? My e-mail: leonardochandra@hotmail.com. Thanks

- 4 years, 5 months ago

I don't really have a solution, but I can give you some idea of how I approached the problem.

Let $$y_i = x_i^6$$, so $$x_i = y_i^{1/6}$$ and $y_1 + y_2 + \dots + y_n = n.$ Also, let $$f(y) = y^{5/6} - y^{1/3}$$, and let $S = \sum_{i = 1}^n f(y_i).$ Then the problem is to find all $$n$$ for which $$S$$ is always nonnegative.

It took a lot of work and persistence to even find an $$n$$ for which $$S$$ could be negative. The results I was getting suggested looking at an example where one of the $$y_i$$ was relatively "large," and the remaining $$y_i$$ were "small." Once I found an example that worked, the rest was just refining the example to get the answer.

Beyond that, there's not much more I can say, except that the answer is much bigger than 2. I can only recommend being tenacious, and keeping things simple. That's what I did.

- 4 years, 5 months ago