Easy Combinatorial Game Problem in Taiwan TST
by chengbilly, Mar 5, 2025, 5:05 AM
Alice and Bob are playing game on an
grid. Alice goes first, and they take turns drawing a black point from the coordinate set
There is a constraint that the distance between any two black points cannot be an integer. The player who cannot draw a black point loses. Find all integers
such that Alice has a winning strategy.
Proposed by chengbilly

![\[\{(i, j) \mid i, j \in \mathbb{N}, 1 \leq i, j \leq n\}\]](http://latex.artofproblemsolving.com/4/3/f/43f7493d1dff43079eb5481ee17bc8f16d7b9553.png)

Proposed by chengbilly
This post has been edited 1 time. Last edited by chengbilly, Mar 5, 2025, 5:09 AM
L
Cute R+ fe
by Aryan-23, Jan 27, 2024, 2:57 PM
Find all functions
, such that for all positive reals
, the following is true:

Kazi Aryan Amin



Kazi Aryan Amin
This post has been edited 1 time. Last edited by Aryan-23, Jan 27, 2024, 2:58 PM
2 variable functional equation in integers
by Supercali, Dec 20, 2022, 12:08 PM
Find all functions
satisfying
for all integers
.



Tiling problem (Combinatorics or Number Theory?)
by Rukevwe, May 2, 2022, 8:56 PM
A unit square is removed from the corner of an
grid, where
. Prove that the remainder can be covered by copies of the figures of
or
unit squares depicted in the drawing below.
![[asy]
import geometry;
draw((-1.5,0)--(-3.5,0)--(-3.5,2)--(-2.5,2)--(-2.5,1)--(-1.5,1)--cycle);
draw((-3.5,1)--(-2.5,1)--(-2.5,0));
draw((0.5,0)--(0.5,3)--(1.5,3)--(1.5,1)--(3.5,1)--(3.5,0)--cycle);
draw((1.5,0)--(1.5,1));
draw((2.5,0)--(2.5,1));
draw((0.5,1)--(1.5,1));
draw((0.5,2)--(1.5,2));
[/asy]](//latex.artofproblemsolving.com/5/7/8/578baca60367441fe9b771689f1a2e91c0ccf984.png)
Note: Every square must be covered once and figures must not go over the bounds of the grid.




![[asy]
import geometry;
draw((-1.5,0)--(-3.5,0)--(-3.5,2)--(-2.5,2)--(-2.5,1)--(-1.5,1)--cycle);
draw((-3.5,1)--(-2.5,1)--(-2.5,0));
draw((0.5,0)--(0.5,3)--(1.5,3)--(1.5,1)--(3.5,1)--(3.5,0)--cycle);
draw((1.5,0)--(1.5,1));
draw((2.5,0)--(2.5,1));
draw((0.5,1)--(1.5,1));
draw((0.5,2)--(1.5,2));
[/asy]](http://latex.artofproblemsolving.com/5/7/8/578baca60367441fe9b771689f1a2e91c0ccf984.png)
Note: Every square must be covered once and figures must not go over the bounds of the grid.
This post has been edited 2 times. Last edited by Rukevwe, May 6, 2022, 2:54 PM
Another perpendicular to the Euler line
by darij grinberg, Mar 11, 2022, 1:01 PM
Let
be a triangle with orthocenter
and circumcenter
. Let
be a point in the plane such that
. Let
and
be the reflections of
in the lines
and
, respectively. Let
be the orthogonal projection of
onto
. Let
be the orthogonal projection of
onto
. Assume that
and
. Prove that
.
![[asy]
import olympiad;
unitsize(30);
pair A,B,C,H,O,P,Q,R,Y,Z,Q2,R2,P2;
A = (-14.8, -6.6);
B = (-10.9, 0.3);
C = (-3.1, -7.1);
O = circumcenter(A,B,C);
H = orthocenter(A,B,C);
P = 1.2 * H - 0.2 * A;
Q = reflect(A, C) * P;
R = reflect(A, B) * P;
Y = foot(R, C, A);
Z = foot(Q, A, B);
P2 = foot(A, B, C);
Q2 = foot(P, C, A);
R2 = foot(P, A, B);
draw(B--(1.6*A-0.6*B));
draw(B--C--A);
draw(P--R, blue);
draw(R--Y, red);
draw(P--Q, blue);
draw(Q--Z, red);
draw(A--P2, blue);
draw(O--H, darkgreen+linewidth(1.2));
draw((1.4*Z-0.4*Y)--(4.6*Y-3.6*Z), red+linewidth(1.2));
draw(rightanglemark(R,Y,A,10), red);
draw(rightanglemark(Q,Z,B,10), red);
draw(rightanglemark(C,Q2,P,10), blue);
draw(rightanglemark(A,R2,P,10), blue);
draw(rightanglemark(B,P2,H,10), blue);
label("$\textcolor{blue}{H}$",H,NW);
label("$\textcolor{blue}{P}$",P,N);
label("$A$",A,W);
label("$B$",B,N);
label("$C$",C,S);
label("$O$",O,S);
label("$\textcolor{blue}{Q}$",Q,E);
label("$\textcolor{blue}{R}$",R,W);
label("$\textcolor{red}{Y}$",Y,S);
label("$\textcolor{red}{Z}$",Z,NW);
dot(A, filltype=FillDraw(black));
dot(B, filltype=FillDraw(black));
dot(C, filltype=FillDraw(black));
dot(H, filltype=FillDraw(blue));
dot(P, filltype=FillDraw(blue));
dot(Q, filltype=FillDraw(blue));
dot(R, filltype=FillDraw(blue));
dot(Y, filltype=FillDraw(red));
dot(Z, filltype=FillDraw(red));
dot(O, filltype=FillDraw(black));
[/asy]](//latex.artofproblemsolving.com/0/0/c/00c2d50d0fec3d1019ecee07ae97d97f179c9dd5.png)



















![[asy]
import olympiad;
unitsize(30);
pair A,B,C,H,O,P,Q,R,Y,Z,Q2,R2,P2;
A = (-14.8, -6.6);
B = (-10.9, 0.3);
C = (-3.1, -7.1);
O = circumcenter(A,B,C);
H = orthocenter(A,B,C);
P = 1.2 * H - 0.2 * A;
Q = reflect(A, C) * P;
R = reflect(A, B) * P;
Y = foot(R, C, A);
Z = foot(Q, A, B);
P2 = foot(A, B, C);
Q2 = foot(P, C, A);
R2 = foot(P, A, B);
draw(B--(1.6*A-0.6*B));
draw(B--C--A);
draw(P--R, blue);
draw(R--Y, red);
draw(P--Q, blue);
draw(Q--Z, red);
draw(A--P2, blue);
draw(O--H, darkgreen+linewidth(1.2));
draw((1.4*Z-0.4*Y)--(4.6*Y-3.6*Z), red+linewidth(1.2));
draw(rightanglemark(R,Y,A,10), red);
draw(rightanglemark(Q,Z,B,10), red);
draw(rightanglemark(C,Q2,P,10), blue);
draw(rightanglemark(A,R2,P,10), blue);
draw(rightanglemark(B,P2,H,10), blue);
label("$\textcolor{blue}{H}$",H,NW);
label("$\textcolor{blue}{P}$",P,N);
label("$A$",A,W);
label("$B$",B,N);
label("$C$",C,S);
label("$O$",O,S);
label("$\textcolor{blue}{Q}$",Q,E);
label("$\textcolor{blue}{R}$",R,W);
label("$\textcolor{red}{Y}$",Y,S);
label("$\textcolor{red}{Z}$",Z,NW);
dot(A, filltype=FillDraw(black));
dot(B, filltype=FillDraw(black));
dot(C, filltype=FillDraw(black));
dot(H, filltype=FillDraw(blue));
dot(P, filltype=FillDraw(blue));
dot(Q, filltype=FillDraw(blue));
dot(R, filltype=FillDraw(blue));
dot(Y, filltype=FillDraw(red));
dot(Z, filltype=FillDraw(red));
dot(O, filltype=FillDraw(black));
[/asy]](http://latex.artofproblemsolving.com/0/0/c/00c2d50d0fec3d1019ecee07ae97d97f179c9dd5.png)
Integer Functional Equation
by mathlogician, Sep 11, 2020, 11:52 PM
Let
be a function that satisfies
for all positive integer pairs
Find all possible functions 
(Here, we define
as the set of all positive integers.)




(Here, we define

Finding all integers with a divisibility condition
by Tintarn, Jun 22, 2020, 4:09 PM
Determine all positive integers
for which there exists a positive integer
with the property that
is divisible by
and
is divisible by
.






H not needed
by dchenmathcounts, May 23, 2020, 11:00 PM
Let
be a cyclic quadrilateral. A circle centered at
passes through
and
and meets lines
and
again at points
and
(distinct from
). Let
denote the orthocenter of triangle
Prove that if lines
are concurrent, then triangle
and
are similar.
Robin Son
















Robin Son
This post has been edited 2 times. Last edited by v_Enhance, Oct 25, 2020, 6:01 AM
Reason: backdate
Reason: backdate
Find all functions
by WakeUp, Nov 19, 2010, 6:41 PM
Let
denote the set of real numbers. Find all functions
such that
![\[f(x^2)+f(xy)=f(x)f(y)+yf(x)+xf(x+y)\]](//latex.artofproblemsolving.com/5/b/e/5be34cb26d276bae3c60fb299ad66d83bc158a01.png)
for all
.


![\[f(x^2)+f(xy)=f(x)f(y)+yf(x)+xf(x+y)\]](http://latex.artofproblemsolving.com/5/b/e/5be34cb26d276bae3c60fb299ad66d83bc158a01.png)
for all

This post has been edited 1 time. Last edited by WakeUp, Nov 19, 2010, 8:18 PM
Archives























Tags
About Owner
- Posts: 0
- Joined: Nov 21, 2009
Search Blog