Stay ahead of learning milestones! Enroll in a class over the summer!

G
Topic
First Poster
Last Poster
Find all functions $f$: \(\mathbb{R}\) \(\rightarrow\) \(\mathbb{R}\) such : $f(
guramuta   3
N 11 minutes ago by nabodorbuco2
Find all functions $f$: \(\mathbb{R}\) \(\rightarrow\) \(\mathbb{R}\) such :
$f(x+yf(x)) + f(xf(y)-y) = f(x) - f(y) + 2xy$
3 replies
guramuta
Yesterday at 2:18 PM
nabodorbuco2
11 minutes ago
Hard Inequality
JARP091   3
N an hour ago by whwlqkd
Source: Own?
Let \( a, b, c > 0 \) with \( abc = 1 \). Prove that
\[
\frac{a^5}{b^2 + 2c^3} + \frac{2b^5}{3c + a^6} + \frac{c^7}{a + b^4} \geq 2.
\]
3 replies
1 viewing
JARP091
Today at 4:55 AM
whwlqkd
an hour ago
Easy geometry problem
dwrty   1
N an hour ago by Ianis

Let ABCD be a square with center O. Triangles BJC and CKD are constructed outward from the square such that BJ = CJ = CK = DK. Let M be the midpoint of CJ. Prove that the lines OM and BK are perpendicular.

1 reply
dwrty
an hour ago
Ianis
an hour ago
gcd of a^2+b^2-nab and a+b divides n+2 , when a,b are coprime positive
parmenides51   3
N an hour ago by FrancoGiosefAG
Source: Mexican Mathematical Olympiad 1988 OMM P5
If $a$ and $b$ are coprime positive integers and $n$ an integer, prove that the greatest common divisor of $a^2+b^2-nab$ and $a+b$ divides $n+2$.
3 replies
parmenides51
Jul 27, 2018
FrancoGiosefAG
an hour ago
no of ways of selecting 8 integers a_i such that 1<a_1<=...<=a_8<=8
parmenides51   12
N an hour ago by FrancoGiosefAG
Source: Mexican Mathematical Olympiad 1988 OMM P4
In how many ways can one select eight integers $a_1,a_2, ... ,a_8$, not necesarily distinct, such that $1 \le  a_1 \le ... \le a_8 \le 8$?
12 replies
parmenides51
Jul 27, 2018
FrancoGiosefAG
an hour ago
China Northern MO 2009 p4 CNMO
parkjungmin   4
N 2 hours ago by exoticc
Source: China Northern MO 2009 p4 CNMO
China Northern MO 2009 p4 CNMO

The problem is too difficult.
Is there anyone who can help me?
4 replies
parkjungmin
Apr 30, 2025
exoticc
2 hours ago
functional equation
pratyush   3
N 2 hours ago by soryn
For the functional equation $f(x-y)=\frac{f(x)}{f(y)}$, if f ' (0)=p and f ' (5)=q, then prove f ' (-5) = q
3 replies
pratyush
Apr 4, 2014
soryn
2 hours ago
My Unsolved Problem
ZeltaQN2008   2
N 2 hours ago by ErTeeEs06
Let $\triangle ABC$ satisfy $AB<AC$. The circumcircle $(O)$ and the incircle $(I)$ of $\triangle ABC$ are tangent to the sides $AC,AB$ at $E,F$, respectively. The line $BI$ meets $EF$ at $M$ and intersects $AC$ at $P$, while the line $BO$ meets $CM$ at $Q$. Construct the common external tangent $\ell$ (different from $BC$) to the incircles of the triangles $PBC$ and $QBC$. Show that $\ell$ is parallel to the line $PQ$.
2 replies
ZeltaQN2008
4 hours ago
ErTeeEs06
2 hours ago
Computing functions
BBNoDollar   4
N 3 hours ago by ICE_CNME_4
Let $f : [0, \infty) \to [0, \infty)$, $f(x) = \dfrac{ax + b}{cx + d}$, with $a, d \in (0, \infty)$, $b, c \in [0, \infty)$. Prove that there exists $n \in \mathbb{N}^*$ such that for every $x \geq 0$
\[
f_n(x) = \frac{x}{1 + nx}, \quad \text{if and only if } f(x) = \frac{x}{1 + x}, \quad \forall x \geq 0.
\](For $n \in \mathbb{N}^*$ and $x \geq 0$, the notation $f_n(x)$ represents $\underbrace{(f \circ f \circ \dots \circ f)}_{n \text{ times}}(x)$. )
4 replies
BBNoDollar
Yesterday at 5:25 PM
ICE_CNME_4
3 hours ago
Nice concurrency
navi_09220114   1
N 3 hours ago by bin_sherlo
Source: TASIMO 2025 Day 1 Problem 2
Four points $A$, $B$, $C$, $D$ lie on a semicircle $\omega$ in this order with diameter $AD$, and $AD$ is not parallel to $BC$. Points $X$ and $Y$ lie on segments $AC$ and $BD$ respectively such that $BX\parallel AD$ and $CY\perp AD$. A circle $\Gamma$ passes through $D$ and $Y$ is tangent to $AD$, and intersects $\omega$ again at $Z\neq D$. Prove that the lines $AZ$, $BC$ and $XY$ are concurrent.
1 reply
navi_09220114
3 hours ago
bin_sherlo
3 hours ago
k-triangular sets
navi_09220114   0
3 hours ago
Source: TASIMO 2025 Day 2 Problem 6
For an integer $k\geq 1$, we call a set $\mathcal{S}$ of $n\geq k$ points in a plane $k$-triangular if no three of them lie on the same line and whenever at most $k$ (possibly zero) points are removed from $\mathcal{S}$, the convex hull of the resulting set is a non-degenerate triangle. For given positive integer $k$, find all integers $n\geq k$ such that there exists a $k$-triangular set consisting of $n$ points.

Note. A set of points in a Euclidean plane is defined to be convex if it contains the line segments connecting each pair of its points. The convex hull of a shape is the smallest convex set that contains it.
0 replies
navi_09220114
3 hours ago
0 replies
a