New geometry problem
by titaniumfalcon, Apr 3, 2025, 10:40 PM
Post any solutions you have, with explanation or proof if possible, good luck!
Cyclic inequality
by JK1603JK, Apr 3, 2025, 3:40 PM
Given non-negative real numbers
satisfying
Prove that
Equality holds at
and its cyclic permutations.




Excalibur Identity
by jjsunpu, Apr 3, 2025, 3:27 PM
proof is below
This post has been edited 1 time. Last edited by jjsunpu, Today at 12:19 AM
Reason: idk
Reason: idk
Easy Problem
by MathleteMystic, Apr 3, 2025, 1:20 PM
Prove that among n integers we can always choose some of them whose sum is a multiple on n.
I do have a solution to this, but could someone write a more descriptive one, please? Something like the logic behind it...
I do have a solution to this, but could someone write a more descriptive one, please? Something like the logic behind it...
Number of solutions
by Ecrin_eren, Apr 3, 2025, 11:27 AM
The given equation is:
x³ + 4y³ + 2y = (2024 + 2y)(xy + 1)
The question asks for the number of integer solutions.
x³ + 4y³ + 2y = (2024 + 2y)(xy + 1)
The question asks for the number of integer solutions.
Geo Mock #8
by Bluesoul, Apr 1, 2025, 7:05 AM
Consider acute triangle
. Denote
as the midpoint of
, and let
be a point on segment
such that
. Find the length of
given
.








Geo Mock #7
by Bluesoul, Apr 1, 2025, 7:04 AM
Consider
with
and
. Let
be a point on
such that
. Suppose that the angle bisector of
is tangent to the circle with diameter
and say it intersects
at point
. Find the length of
.











L
An inequality
by jokehim, Mar 21, 2025, 3:05 PM
Ramsey problem: 3 people in 6 pairwise knowing or strangers
by adityaguharoy, Jan 19, 2018, 11:57 AM
Given any collection of
people. Prove that there is either a collection of
people among them such that they know each other pairwise, or there is a collection of
people among them who are pairwise strangers.
Proof
In the language of arrows



Proof
Let the
people be
.
Fix any one of them say
.
Consider the relation between
and the other
people.
By Pigeonhole Principle
must know at least
of them or be stranger to at least
of them.
Without loss of generality let
know
of them.
Let
know
.
Now, consider the relationship pairwise among
.
If, they are pairwise strangers then
is a set of
pairwise strangers.
And if they are not pairwise strangers then at least two of them must know each other.
Let,
and
know each other.
Then, observe that
is a set of
people who know each other pairwise.
Done !!


Fix any one of them say

Consider the relation between


By Pigeonhole Principle



Without loss of generality let


Let


Now, consider the relationship pairwise among

If, they are pairwise strangers then


And if they are not pairwise strangers then at least two of them must know each other.
Let,


Then, observe that


Done !!
In the language of arrows
We state this in the language of arrows as
.

The oldest, shortest words — "yes" and "no" — are those which require the most thought.
Archives














Shouts
Submit
117 shouts
Contributors
adityaguharoy • Akatsuki1010 • Amir Hossein • AndrewTom • arqady • CeuAzul • chocopuff • CJA • derangements • dgrozev • Grotex • Hypernova • j___d • Lonesan • Math_CYCR • pco • phi1.6180339.. • Pirkuliyev Rovsen • sqing • szl6208 • Tintarn • Virgil Nicula • xzlbq • Αρχιμήδης 6
Tags
About Owner
- Posts: 4655
- Joined: Apr 29, 2014
Blog Stats
- Blog created: Apr 26, 2016
- Total entries: 101
- Total visits: 25068
- Total comments: 61
Search Blog