The positive sequence $\{a_n\}$ satisfies:$a_1=1$ and $$a_n=2+\sqrt{a_{n-1}}-2 \sqrt{1+\sqrt{a_{n-1}}}(n\geq 2)$$Let $S_n=\sum\limits_{k=1}^{n}{2^ka_k}$. Find the value of $S_{2023}$.

$A$ is a non-empty subset of positive integers. Let $$f(A)=\{abc-b-c+2\vert a,b,c\in A\}$$Determine all integers $n$ greater than $1$ so that we can divide the set of positive integers into $A_1, A_2, \dots, A_n$ ($A_i\neq \emptyset (i=1, 2, \dots , n)$, $\forall 1\le i < j \le n, A_i\cap A_j = \emptyset$ and $\bigcup_{i=1}^{n} A_i=\mathbb{N}^*$) satisfy that $\forall 1\le i\le n, f(A_i) \subseteq A_i$.

In acute triangle $ABC$ ($\triangle ABC$ is not an isosceles triangle), $I$ is its incentre, and circle $ \omega$ is its inscribed circle. $\odot\omega$ touches $BC, CA, AB$ at $D, E, F$ respectively. $AD$ intersects with $\odot\omega$ at $J$ ($J\neq D$), and the circumcircle of $\triangle BCJ$ intersects $\odot\omega$ at $K$ ($K\neq J$). The circumcircle of $\triangle BFK$ and $\triangle CEK$ meet at $L$ ($L\neq K$). Let $M$ be the midpoint of the major arc $BAC$.Prove that $M, I, L$ are collinear.

Given an integer $n\geq 2$. Call a positive integer ${T}$ Pingsheng Number, if there exists pairwise different non empty subsets $A_1,A_2,\cdots ,A_m$ $(m\geq 3)$ of set $S=\{1,2,\cdots ,n\},$ satisfying $T=\sum\limits_{i=1}^m|A_i|,$ and for $\forall p,q,r\in\{1,2,\cdots ,m\},p\neq q,q\neq r,r\neq p,$ we have $A_p\cap(A_q\triangle A_r)=\varnothing$ or $A_p\subseteq (A_q\triangle A_r).$ Find the max Pingsheng Number.

Let $AB$ be a chord of the semicircle $O$ (not the diameter). $M$ is the midpoint of $AB$, and $D$ is a point lies on line $OM$ ($D$ is outside semicircle $O$). Line $l$ passes through $D$ and is parallel to $AB$. $P, Q$ are two points lie on $l$ and $PO$ meets semicircle $O$ at $C$. If $\angle PCD=\angle DMC$, and $M$ is the orthocentre of $\triangle OPQ$. Prove that the intersection of $AQ$ and $PB$ lies on semicircle $O$.

Let $a_1\geq a_2\geq \cdots \geq a_n >0 .$ Prove that$$ \left( \frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n}\right)^2\geq \sum_{k=1}^{n} \frac{k(2k-1)}{a^2_1+a^2_2+\cdots+a^2_k}$$

The positive integer number $S$ is called a "line number". if there is a positive integer $n$ and $2n$ positive integers $a_1$, $a_2$,...,$a_n$, $b_1$,$b_2$,...,$b_n$, such that $S = \sum^n_{i=1} a_ib_i$, $\sum^n_{i=1} (a_i^2-b_1^2)=1$, and $\sum^n_{i=1} (a_i+b_i)=2023$, find: (1) The minimum value of line numbers. (2)The maximum value of line numbers.

Let $p(x)$ be an $n$-degree $(n \ge 2)$ polynomial with integer coefficients. If there are infinitely many positive integers $m$, such that $p(m)$ at most $n -1$ different prime factors $f$, prove that $p(x)$ has at most $n-1$ different rational roots . a help in translation is welcome

Let $a, b>0$. Prove that:$$ (a^3+b^3+a^3b^3)(\frac{1}{a^3} + \frac{1}{b^3} + \frac{1}{a^3b^3} ) +27 \ge 6(a+b+\frac{1}{a} +\frac{1}{b} +\frac{a}{b} +\frac{b}{a}) $$

For a non-empty finite complex number set $A$, define the "Tao root" of $A$ as $\left|\sum_{z\in A} z \right|$. Given the integer $n\ge 3$, let the set $$U_n = \{\cos\frac{2k \pi}{n}+ i\sin\frac{2k \pi}{n}|k=0,1,...,n-1\}.$$Let $a_n$ be the number of non-empty subsets in which the Tao root of $U_n$ is $0$ , $b_n$ is the number of non-empty subsets of $U_n$ whose Tao root is $1$. Compare the sizes of $na_n$ and $2b_n$.

In $\triangle {ABC}$, ${D}$ is on the internal angle bisector of $\angle BAC$ and $\angle ADB=\angle ACD$. $E, F$ is on the external angle bisector of $\angle BAC$, such that $AE=BE$ and $AF=CF$. The circumcircles of $\triangle ACE$ and $\triangle ABF$ intersects at ${A}$ and ${K}$ and $A'$ is the reflection of ${A}$ with respect to $BC$. Prove that: if $AD=BC$, then the circumcenter of $\triangle AKA'$ is on line $AD$.

Find the largest real number $c$, such that for any integer $s>1$, and positive integers $m, n$ coprime to $s$, we have$$ \sum_{j=1}^{s-1} \{ \frac{jm}{s} \}(1 - \{ \frac{jm}{s} \})\{ \frac{jn}{s} \}(1 - \{ \frac{jn}{s} \}) \ge cs$$where $\{ x \} = x - \lfloor x \rfloor $.

As shown in the figure, in $\vartriangle ABC$, $AB>AC$, the inscribed circle $I$ is tangent to the sides $BC$, $CA$, $AB$ at points $D$, $E$, $F$ respectively, and the straight lines $BC$ and $EF$ intersect at point $K$, $DG \perp EF$ at point $G$, ray $IG$ intersects the circumscribed circle of $\vartriangle ABC$ at point $H$. Prove that points $H$, $G$, $D$, $K$ lie on a circle.

Let $R[x]$ be the whole set of real coefficient polynomials, and define the mapping $T: R[x] \to R[x]$ as follows: For $$f (x) = a_nx^{n} + a_{n-1}x^{n- 1} +...+ a_1x + a_0,$$let $$T(f(x))=a_{n}x^{n+1} + a_{n-1}x^{n} + (a_n+a_{n-2})x^{n-1 } + (a_{n-1}+a_{n-3})x^{n-2}+...+(a_2+a_0)x+a_1.$$Assume $P_0(x)= 1$, $P_n(x) = T(P_{n-1}(x))$ ( $n=1,2,...$), find the constant term of $P_n(x)$.

Let ${n}$ be a fixed positive integer. ${A}$ and ${B}$ play the following game: $2023$ coins marked $1, 2, \dots, 2023$ lie on a circle (the marks are considered in module $2023$) and each coin has two sides. Initially, all coins are head up and ${A}$'s goal is to make as many coins with tail up. In each operation, ${A}$ choose two coins marked ${k}$ and $k+3$ with head up (if ${A}$ can't choose, the game ends) and ${B}$ choose a coin marked $k+1$ or $k+2$ and flip it. If at some moment there are ${n}$ coins with tail up, ${A}$ wins. Find the largest ${n}$ such that ${A}$ has a winning strategy.