These are some really cool problems. Try them!

\(\displaystyle \dfrac{1}{x} + \dfrac{1}{y}=\dfrac{1}{n}\) has 505 ordered pairs(x,y) of positive integers that satisfy the equation. Prove that n is a perferct square.

Find all integer solutions of \(x^{4} + y^{4} = 3x^{3}y\)

Find the solutions of the following system of equations:

\(x - \sqrt{yz} = 42\)

\(y - \sqrt{xz} = 6\)

\(z - \sqrt{xy} = 30\)

Here's the second part

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) 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

Sort by:

TopNewestFor the last one, there are no solutions. Suppose \( (x,y,z) \) was a solution, and note that \( x,y,z \) must all be positive (indeed, they are at least \( 42,6,\) and \( 30 \) respectively). The equations imply \( x > \sqrt{yz}, y > \sqrt{xz}, z > \sqrt{xy}. \) Multiplying all these gives \( xyz > xyz \), which is a contradiction.

Log in to reply

Wau! I solved it in a much really complicated way!. Thanks!

Log in to reply

For the second one:

Since \( 3|3x^3y\) ,then \(3|x^4+y^4\).That means that 3|x and 3|y.

Let x and y be the smallest integer solutions.From before, \(x=3x_1\) and \(y=3y_1\)

So \(x_1^4+y_1^4=3x_1^3y_1\)

This is a solution clearly smaller than x and y which is a contradiction.Thus there are no solutions in positive integers.

Log in to reply

Your conclusion also proves that \((x,y)=(0,0)\), the trivial solution, is the only solution over all integers.

Log in to reply

Nice idea! This is the way I solved it:

Log in to reply

Here is the second part. Follow me if you want more problems!

Log in to reply

First one:

Clearing denominators gives \(xy=nx+ny\) or \(xy-nx-ny=0\).

Using Simon's Favorite Factoring Trick, we get \((x-n)(y-n)=n^2\).

We are given that this has \(505\) ordered pairs of positive integers that satisfy it. Note that \(x,y \ge n\) or else one of them is negative. Thus, \(x-n\) and \(y-n\) are both positive, so we just need to equate the number of factors of \(n^2\) to \(505\).

We have a few cases now:

\(n^2=p^{504}\) for a prime \(p\). Clearly, \(n=p^{252}\), so \(n\) is a perfect square.

\(n^2=p^4\cdot q^{100}\) for primes \(p,q\). Clearly, \(n=p^2\cdot q^{50}\), so \(n\) is a perfect square.

QED

Log in to reply

Same solution as mine! you nailed it!

Log in to reply