证明题(2024年罗马尼亚

Let BC be a fixed segment in the plane, and let A be a variable point in the plane not on the line BC. Distinct points X and Y are chosen on the rays (CA)  ⃗ and (BA) ⃗, respectively, such that ∠CBX=∠YCB=∠BAC.Assume that the tangents to the circumcircle of ABC at B and C meet line XY at P and Q, respectively, such that the points X,P,Y, and Q are pairwise distinct and lie on the same side of BC. Let Ω1 be the circle through X and Y centred on BC. Similarly let Ω2 be the circle through Y and Q centred on BC. Prove that Ω1 and Ω2 intersect at two fixed points as A varies.

【译】在同一平面内,BC为给定线段,动点A不在直线BC上. X和Y分别为射线(CA) ⃗,射线(BA) ⃗上不重合的两点,满足∠CBX=∠YCB=∠BAC.若三角形ABC外接圆在点B和C处的切线分别交直线XY于点P和点Q,点X,P,Y,Q不重合,且位于直线BC同侧.圆Ω1经过点X,P且圆心在BC上.类地,圆Ω2经过点Y,Q且圆心在BC上.证明:当点A运动时,圆Ω1和圆Ω2始终交于两定点.

答案解析

暂无答案

讨论

Fix integers a and b greater than 1. For any positive integer n, let rn be the (non-negative) remainder that bn leaves upon division by an. Assume there exists a positive integer N such that rn<2n/n for all integers n≥N.Prove that a divides b.给定大于1的整数a和b.对任意的正整数n,记rn为bn除以an的非负余数.若存在正整数N,使得对任意的n≥N,都有rn<2n/n.证明:a整除b.

Given a positive integer n, a set S is n-admissible if①each element of S is an unordered triple of integers in {1,2,⋯,n},②|S|=n-2,and③for each 1≤k≤n-2 and each choice of k distinct A1,A2,⋯,Ak∈S,|A1∪A2∪⋯∪Ak |≥k+2Is it true that, for all n>3 and for each n-admissible set S, there exist pairwise distinct points P1,P2,⋯,Pn in the plane such that the angles of the triangle Pi Pj Pk are all less than 61° for any triple {i,j,k} in S?【译】给定正整数n,称集合S是n-可行,如果其满足以下条件:①S的每个元素都是{1,2,⋯,n}的三元子集;②|S|=n-2;③对任意的1≤k≤n-2和任意k个互不相同的A1,A2,⋯,Ak∈S,都有|A1∪A2∪⋯∪Ak |≥k+2判断以下命题是否为真:对所有n>3和所有的n-可行集合S,在平面内总存在n个互不相同的点P1,P2,⋯,Pn,使得对集合S中任意元素{i,j,k},三角形Pi Pj Pk的每个内角都小于61°.

Consider an odd prime p and a positive integer N<50p. Let a1,a2,⋯,aN be a list of positive integers less than p such that any specific value occurs at most 51/100 N times and a1,a2,⋯,aN is not divisible by p. Prove that there exists a permutation b1,b2,⋯,bN of the a_i such that, for all k=1,2,⋯,N, the sum b1+b2+⋯+bk is not divisible by p.【译】已知奇素数p和正整数N<50p.设a1,a2,⋯,aN是一些小于p的正整数,同一数值至多出现51/100 N次,且a1+a2+⋯+aN不能被p整除.证明:存在a_i的一个排列:b1,b2,⋯,bN,使得对任意的k=1,2,⋯,N,都有b1+b2+⋯+bk不能被p整除.

Let n be a positive integer. Initially, a bishop is placed in each square of the top row of a 2n×2n chessboard; those bishops are numbered from 1 to 2n ,from left to right. A jump is a simultaneous move made by all bishops such that the following conditions are satisfied:each bishop moves diagonally, in a straight line, some number of squares, andat the end of the jump, the bishops all stand in different squares of the same row.Find the total number of permutations σ of the numbers 1,2,⋯,2n with the following property: There exists a sequence of jumps such that all bishops end up on the bottom row arranged in the order σ(1),σ(2),⋯,σ(2n ), from left to right.【译】设n是正整数.最开始在一个2n×2n的方格棋盘上的第一行的每个小方格内均放置一枚“象”,这些“象”从左到右依次编号:1,2,⋯,2n.定义一次“跳跃”操作为同时移动所有的“象”并满足如下条件:每一枚“象”可沿对角线方向移动任意方格;在这次“跳跃”操作结束时,所有的“象”恰在同一行的不同方格.求满足下列条件的数1,2,⋯,2n的排列σ的总个数:存在一系列的“跳跃”操作,使得结束时所有的“象”都在棋盘的最后一行,并且从左到右编号依次为:σ(1),σ(2),⋯,σ(2n ).

Let m<n be positive integers. Start with n piles, each of m objects. Repeatedly carry out the following operation: choose two piles and remove n objects in total from the two piles. For which (m ,n) is it possible to empty all the piles?【译】设正整数m<n.起初一共有n 堆石子,每堆有 m块石子. 重复执行以下操作: 选择两堆石子,从这两堆中移除共n 块石子.问:对于怎样的 (m , n),可以移除所有石子?

Let ABC be an acute-angled triangle with AB > AC. Let P be the intersection of the tangents to the circumcircle of ABC at B and C. The line through the midpoints of line segments PB and PC meets lines AB and AC at X and Y respectively.Prove that the quadrilateral AXPY is cyclic.【译】在锐角三角形ABC中,AB>AC,△ABC的外接圆在点B和点C处的切线交于点P.一条同时过PB和PC中点的直线与AB,AC分别交于点X,Y.求证:A,X,P,Y四点共圆.

Find all functions f from the integers to the integers such that for all integers n:2f(f(n))=5f(n)-2n【译】求所有函数f:z→z,使得对任意整数n有:2f(f(n))=5f(n)-2n

In the sequence 7,76,769,7692,76923,769230,… ,the nth term is given by the first n digits after the decimal point in the expansion of 10/13=0.7692307692⋯.Prove that of the first 60 terms of the sequence, at least 49 have three or more prime factors (repeated prime factors are allowed; for example, 76=2×2×19 has three prime factors).【译】在10/13=0.7692307692⋯的十进制表示中,由小数点后的前n位数构成数列:7,76,769,7692,76923,769230,… ,求证:在该数列的前60项中,至少有49项有三个或以上的素因子(包含重复的素因子,例如76=2×2×19有三个素因子).

设S={z∈C||z|=1}.求所有函数f:S→S,使得f为连续单射,且对任意z1,z2∈S,有f(z1 z2 )=f(z1)f(z2).

复矩阵A与A的任意正整数次常相似.(1)证明:A的特征值为0或 1;(2)求A的若当标准型.

在锐角三角形ABC中,AB<AC.设Ω为三角形ABC的外接圆.点S是Ω上包含点A的弧BC的中点.过点A作垂直于BC的直线与BS交于点D,与圆Ω交于另一点E,E≠A.过点D且平行于BC 的直线与直线BE交于点L.记ω为三角形BDL的外接圆.设ω与Ω交于另一点P,P≠B.证明:ω在点P处的切线与直线BS的交点在∠BAC的内角平分线上.

设n是一个正整数.日式三角是将1+2+…+n个圆排成正三角形的形状,使得对 i= 1,2,…,n,从上到下的第i行恰有个圆,且其中恰有一个被染为红色.在日式三角内,忍者路径是指一串由n个圆组成的序列,从最上面一行的圆开始,每次从当前圆连接到它下方相邻的两个圆之一,直至到达最下面一行的某个圆为止.下图为一个n=6的日式三角,其中画有一条包含两个红色圆的忍者路径.求最大的整数k(用n表示),使得在每个日式三角中都存在一条忍者路径,它包含至少k个红色圆.

设ABC是一个正三角形.点A1,B1,C1在三角形ABC的内部,且满足A1 B=A1 C,B1 A=B1 C,C1 A=C1 B及∠BA1 C+∠CB1A+∠AC1 B=480°.设直线BC1与CB1交于点A2,AC1与A1 C交于B2,AB1与A1 B交于C2.证明:若三角形A1 B1 C1的三边长度两两不等,则三角形AA1 A2,BB1 B2,CC1 C2的外接圆都经过两个公共点.

如图,∠ABC=90°,AC=BC,AD⊥CE,BE⊥CE,垂足分别是D,E.已知AD=8,BE=3,则DE=______.

以 n 角形之顶点为顶点,而不是 n 角形之边为边之三角形共有若干?

路旁有塔 CD,塔底 D 与路最近处为路上之 A 点.于路上 B 点测得塔顶 C之仰角为 α,又测得 BC 与路成角β .已知 AD =l,求塔高.

设ABCD为一平行四边形,AC为对角线,由B作任意直线各交AC、CD及AD于F、G及E,求证EF·FG=BF².

设有一三角形,其底为 7 cm,高为 5 cm,用圆规及尺作一正方形,其面积与此相等者.

证从平行四边形之一顶点作线至对边之中点,三等分四边形之对角线.

某城街路为棋盘式,走向南北者有 a 条,而走向东西者有 6 条,一行人欲由西北隅向最短之路走到东南隅,问计共有若干方法?