Full analysis of the ShAD-2019 exam

Hello! My name is Azat, I am a 3rd year student at the HSE Faculty of Computer Science. A few days ago a friend from the HSE Economics contacted me and asked for help with solving the problems of the entrance exam at the School of Economics. My classmate Daniil and I looked at the tasks, they seemed to us rather difficult, but very interesting, I wanted to break my head over them. As a result, we solved 1 of the options for 2019 and want to show our solutions to the world.



Task 1


Fill in the third column of the matrix

\ frac {1} {6} \ left (\ begin {array} {ccc} 5 & -2 &? \\ - 2 & 2 &? \\ - 1 & -2 &? \ end {array} \ right)

\ frac {1} {6} \ left (\ begin {array} {ccc} 5 & -2 &? \\ - 2 & 2 &? \\ - 1 & -2 &? \ end {array} \ right)


if it is known that this is the matrix of orthogonal projection onto some plane.

Decision
A, :
A2=A :

A2=136(5βˆ’2xβˆ’22yβˆ’1βˆ’2z)(5βˆ’2xβˆ’22yβˆ’1βˆ’2z)=136(29βˆ’xβˆ—βˆ—βˆ’14βˆ’yβˆ—βˆ—βˆ’1βˆ’zβˆ—βˆ—)


=16(5βˆ’2xβˆ’22yβˆ’1βˆ’2z)=A



2 3 , , .

:

{29βˆ’x=5β‹…6βˆ’14βˆ’y=βˆ’2β‹…6βˆ’1βˆ’z=βˆ’1β‹…6⇔{29βˆ’x=30βˆ’14βˆ’y=βˆ’12βˆ’1βˆ’z=βˆ’6⇔{x=βˆ’1y=βˆ’2z=5



, 3 ,

A=16(5βˆ’2βˆ’1βˆ’22βˆ’2βˆ’1βˆ’25)




Task 2


What can you say about the convergence (absolute or conditional) of a series  sum inftyn=1(n+2019)anif it is known that the series  sum inftyn=1(nβˆ’2019)an converges (a) absolutely, (b) conditionally?

Decision
:

S=βˆžβˆ‘n=1(n+2019)an,T=βˆžβˆ‘n=1(nβˆ’2019)an.


Sβ€²=βˆžβˆ‘n=1|n+2019||an|,Tβ€²=βˆžβˆ‘n=1|nβˆ’2019||an|


A=βˆžβˆ‘n=1an,Aβ€²=βˆžβˆ‘n=1|an|



(1).

βˆ‘βˆžn=1(n+a)an β‡’Aβ€²=βˆ‘βˆžn=1an βˆ€a∈Z.

βˆ‘βˆžn=1(n+a)ann+a (, , -a).

, βˆ‘βˆžn=1Ξ±nΞ²n, Ξ±n=1n+a,Ξ²n=(n+a)an. n=max(1,βˆ’a+1), . . :

1. Bn=βˆ‘nk=1Ξ²k , βˆ‘βˆžn=1Ξ²n .
2. Ξ±nβ©ΎΞ±n+1
3. limnβ†’βˆžΞ±n=0

, . , .

a) T , Tβ€²=βˆ‘βˆžn=1|nβˆ’2019||an| . :

Tβ€²=2018βˆ‘n=1|nβˆ’2019||an|+βˆžβˆ‘n=2019|nβˆ’2019||an|=…


2018 , :

…=2018βˆ‘n=1(nβˆ’2019)|an|+βˆžβˆ‘n=2019(nβˆ’2019)|an|=βˆžβˆ‘n=1(nβˆ’2019)|an|


, (1), βˆ‘βˆžn=1|an| .

2018 ( , ) :

Sβ€²βˆ’Tβ€²=βˆžβˆ‘n=2019((n+2019)βˆ’(nβˆ’2019))|an|=4038βˆžβˆ‘n=2019|an|


, Aβ€²=βˆ‘βˆžn=1|an| . , Sβ€²=Tβ€²+Aβ€² β€” 2 . .

) T , T , Tβ€² β€” .

, S .

, T (1) A. , , S T, , S . , Sβ€² .

. Sβ€² . , 2018 Sβ€² Tβ€², , :

βˆžβˆ‘n=2019|nβˆ’2019||an|β‰€βˆžβˆ‘n=2019|n+2019||an|


|n+2019|β‰₯|nβˆ’2019|βˆ€nβ‰₯2019.

, , . Tβ€² , .

Task 3


Alena loves algebra very much. Every day, going to her favorite algebraic forum, she is likely frac14 finds there a new interesting problem about groups, and with probability  frac110An interesting puzzle about rings. With probability frac1320new tasks on the forum will not be. Let beX- this is the minimum number of days for which Alena will have at least one new task about groups and at least one about rings. Find the distribution of a random variableX. Only compact expressions (not containing signs of summation, dots, etc.) should participate in the answer.

Decision
P[X=k]. , X=k. β€” kβˆ’1 , , k- . β€” kβˆ’1 , , k- . , kβˆ’1 . :

P[x=k]=((1320+14)kβˆ’1βˆ’(1320)kβˆ’1)β‹…110+


((1320+110)kβˆ’1βˆ’(1320)kβˆ’1)β‹…14



Task 4


Dan array  textA[1:n] real numbers, sorted in ascending order, as well as numbers p, q, r. Suggest an algorithm building an array textB[1:n]consisting of numbers px2+qx+rwhere x in textAalso sorted in ascending order. Time limit isO(n), for additional memory - O(n).

Decision
A=[x1,…,xn], x1≀…≀xn.

, p>0.

.



, :

1. βˆ€x:x>βˆ’q2p f(x) .
2. βˆ€x:xβ‰€βˆ’q2p f(x) .

«» f , .

O(logn) A, . reverse . f. 2 . merge O(n) .

p<0 βˆ’f, reverse f(x) -1. .

p=0 q.

1. q>0β‡’f(xi)≀f(xi+1)βˆ€i
2. q<0β‡’f(xi)β‰₯f(xi+1)βˆ€i

. q<0 O(n) reverse. qβ‰₯0 .

Task 5


Real-valued function f defined on the segment [a;b] (ba geqslant4)and differentiable on it. Prove that there is a pointx0 in(a;b), for which

fβ€²(x0)<1+f2(x0).



Decision
. βˆ€x∈(a;b):fβ€²(x)β‰₯1+f2(x).

, :

fβ€²(x)=1+f2(x)


dfdx=1+f2β‡”βˆ«df1+f2=∫dx


arctg(f)=x+C⇒f(x)=tg(x+C)



g(x)=tg(x+C). , fβ€²(x)β‰₯gβ€²(x)βˆ€x∈(a;b)β‡’f(x)βˆ’f(a)β‰₯g(x)βˆ’g(a)βˆ€x∈(a;b). , f , , , g.

g C. , g(a)=f(a). :

f(x)βˆ’f(a)β‰₯g(x)βˆ’g(a)⇔f(x)β‰₯g(x)



, bβˆ’aβ‰₯4. (a;b) xβ€² , xβ€²+C=Ο€2+Ο€k ( Ο€<4). g(xβ€²)=+∞. , f(xβ€²)β‰₯g(xβ€²)β‡’f(xβ€²)=+∞.

, - (a;b) . , , . .

Task 6


Square real matrix A such that A textT=p(A)where p(x)- polynomial with nonzero free term. Prove thatAreversible. Is it true that for any operator varphi: mathbbRn to mathbbRn there is a polynomial p(x) and some basis in which the matrix  varphi satisfies the condition A textT=p(A)?

Decision
, , A=p(AT), :

A=(AT)T=(p(A))T=(pnAn+…+p1A+p0E)T


=(pn(An)T+…+AT+p0E)=(pn(AT)n+…+AT+p0E)=p(AT)



, A=p(AT)=p(p(A)).

1. . A . x≠0 , Ax=0. , xTAx=0. :

0=xTAx=xTp(AT)x=xT(pn(AT)n+…+p1AT+p0E)x


=pn(xTAT)(AT)nβˆ’1x+…+p1xTATx+p0xTEx


, xTAT=(Ax)T=0:

0=…=p0xTx=p0β€–xβ€–


, p0β‰ 0β‡’β€–xβ€–=0β‡’x=0. .

2. Ο• A=(0100) .

B=Cβˆ’1AC, C β€” .

, A2=0, An=0βˆ€nβ‰₯2. Bn=Cβˆ’1AnC=0βˆ€nβ‰₯2.

BT=p(B). 1 , BT=Ξ±B+Ξ²E.

Ξ²=0, , , , B , (.. detB=detA=0).

, B=p(BT)=p(p(B)).

: B=Ξ±(Ξ±B)=Ξ±2Bβ‡’(1βˆ’Ξ±2)B=0.

:

1. Ξ±=βˆ’1:

:

BT=p(B)=βˆ’Bβ‡’B+BT=0



2, :

{b11+b11=0b12+b21=0b21+b12=0b22+b22=0β‡’{b11=b22=0b12=βˆ’b21



detB=detA=0. :

detB=0β‹…0βˆ’b12(βˆ’b12)=b212=0β‡’b12=b21=0β‡’B=0

.
. Ο• , .

2. Ξ±=1:

BT=p(B)=B. BTB=B2=0.


(BTB)ii=nβˆ‘k=1(Bki)2=0βˆ€iβ‡’Bki=0βˆ€k,iβ‡’B=0


.

3. Ξ±β‰ Β±1.

, (1βˆ’Ξ±)2B=0β‡’B=0.

A Ο• , AT=p(A). .

Task 7


Dan count with 30peaks. It is known that for any5 vertices in the graph there is a cycle of length 5containing these vertices. Prove that there is10 peaks pairwise connected by edges with each other.

Decision
, diamG≀2.

2 u v 3 . , 5 . , 5 . u v 2 ( ). diamG≀2.



v∈G. , v 1, 2. , Β«β€Ž Β»β€Ž 2 :



. a,b,c∈L2. x∈G. , . , , v a, b c 1, .



, |L2|≀2β‡’|L1|β‰₯30βˆ’1βˆ’2=27, 27.

(, β€” , ) 10. 10 G β€” , ( , ) 10 Β―G.

Β―G. G v degvβ‰₯27βˆ€v∈G, degΒ―v≀2βˆ€Β―v∈¯G.

«» (1) «» (2). - degΒ―v≀2.



(1) ⌈m2βŒ‰, (2) β€” ⌊m2βŒ‹.

k β€” , k1 β€” «». :

|I|=k1βˆ‘i=1⌈mi2βŒ‰+kβˆ‘i=k1+1⌊mi2βŒ‹ kβˆ‘i=1mi=30



, , , . , , 10 3. .

|I|β‰₯10βˆ‘i=1⌊32βŒ‹=10



, Β―G 10 , G 10 . .

Task 8


Find the limit

limnβ†’βˆž5nβˆ‘k=nCnβˆ’1kβˆ’1(15)n(45)kβˆ’n.



Decision
.

:

ΞΎn=# n


β€” 15.

P[ΞΎn=k] :

P[ΞΎn=k]=Cnβˆ’1kβˆ’1(15)n(45)kβˆ’n



Cnβˆ’1kβˆ’1 β€” nβˆ’1 ( 1 ).
(15)n β€” .
(45)kβˆ’n β€” .


limnβ†’βˆžP[ΞΎn≀5n].


, ΞΎn≀5n -. , 5n β‰₯n .

:

S5n=# 5n


:

S5n=5nβˆ‘i=1Ξ·i,Ξ·i=I{i }




ES5n=5nβˆ‘i=1EΞ·i=5nβ‹…15=n


S5n. :

limnβ†’βˆžP[ΞΎn≀5n]=limnβ†’βˆžP[S5nβ‰₯n]=limnβ†’βˆžP[S5nβˆ’nβ‰₯0]=


limnβ†’βˆžP[S5nβˆ’nΟƒβˆšnβ‰₯0]=P[Ξ·β‰₯0],η∼N(0,1)



, :

limnβ†’βˆžP[ΞΎn≀5n]=P[Ξ·β‰₯0]=12




Conclusion


In general, the exam is quite complicated. My friend complained that preparing is not easy. This is really so - you need to not only know the vast mathematical theory, but also have the skill to solve olympiad problems, in the ShAD they give just such. Therefore, to prepare you need to train a lot, remember the theory and fill your hand.

If you have other ideas for solving problems or any comments, feel free to write to me in telegrams @ Azatik1000 . Always happy to answer!

Azat Kalmykov, curator at ShAD Helper

Source: https://habr.com/ru/post/undefined/


All Articles