Contents - TiERA http://f3.tiera.ru/2/M_Mathematics/MSch_School-level/Andreescu%20T., %20Dospinescu%20G.%20Problems%20from%20the%20book %20%28draft,%20XYZ,%202008%29%28284s%29_MSch_.

pdf <Downloaded>
bib.tiera.ru/b/99311 the introduction to this problem that it has a solution based on calculus. The idea of that

Gabriel Dospinescu, TST 2004, Romania. Solution.

solution is to .....
BMO1 2003 final question (Q5) https://nrich.maths.org/discus/messages/153904/149403.html?1281107322 Niloy B
Frequent poster Post Number: 107

Posted on Monday, 26 July, 2010 - 02:10 pm: Questions: Let p, q and r be prime numbers. It is given that p divides qr-1, q divides pr-1 and r divides pq-1. Find all possible values of pqr. Any possible approach for the Q?

Sam Cappleman-Lynes
Frequent poster Post Number: 103

Posted on Monday, 26 July, 2010 - 02:54 pm: As a start: bearing in mid that the numbers involved are prime, can you find a divisibility condition involving pqr? Posted on Monday, 26 July, 2010 - 03:06 pm: You could also try some examples, to get a feel for the question. Can you find any p, q and r that work? Any that don't work? Posted on Tuesday, 27 July, 2010 - 01:29 pm: The obvious solution is 2,3,5. This suggested to me that perhaps I could prove that two of p,q,r can not be the a prime in the 6k(+/-)1, but I have not been able to show this. Obviously pqr divides (qr-1)(pr-1)(pq-1). Also, assuming p,q,r is none of 2 or 3, then by setting them in the form 6k(+/-)1 tells us that either all three of (qr-1), (pr-1) and (pq-1)are 0(mod 6) or that one is 0 (mod 6) and that the other two are 4 (mod 6). So, as p,q,r is none of 2 or 3, they must repectively divided atleast one of (qr-1) or (pr-1) or (pq-1) over 6 (as at least one is 0(mod6), and p/q/r do not divide six). I have tried other lines of attack, but without much success.

Vicky Neale
Veteran poster Post Number: 3023

Niloy B
Frequent poster Post Number: 108

andrew

Prolific poster

Posted on Tuesday, 27 July, 2010 - 05:14 pm: I would expand (pq-1)(qr-1)(rs-1) and find a bound an

Post Number: 225

upper bound on pqr, in terms of p,q,r. Show that this bound can only be satisfied when one of p,q,r is very small; remember that p,q,r are held under symmetric conditions so we might as well assume p > q > r (it's easy to see that none of them can be equal). Posted on Friday, 30 July, 2010 - 02:36 pm: Andrew, I have tried to restrict pqr using inequalities, but can not seem to find a way to do so... Also, one notable observation is that pqr|qr+pr+pq-1. Any other hints?

Niloy B
Frequent poster Post Number: 109

andrew

Prolific poster Post Number: 226

Posted on Friday, 30 July, 2010 - 02:52 pm: When tackling a problem of the same essence, but slightly different, I was given this advice:
quote:

Notice that this problem is for positive integers, so the classical inequalities like AM-GM, which hold for all positive reals, probably won't help you, as they are not strong enough.

The fact that pqr|pq+qr+rp-1 is useful. Since p,q,r are positive integers this means pq+qr+rp-1>=pqr or pq+qr+rp>pqr; certainly not true for large p,q and r. However we have noted p>q>r so pq>pr>qr. Then 3pq=pq+pq+pq>pq+qr+rp. See if you can continue from here using the same idea, this idea helps in many number theory problems (i recall a problem from an old IMO shortlist that is trivial using this method). andrew
Prolific poster Post Number: 230

Posted on Friday, 06 August, 2010 - 02:55 pm: Niloy, have you solved the problem? My last post with less subtlety was: We have pq+qr+rp>pqr, but also 3pq>pq+rp+qr. Thus 3pq>pqr. What does this say about r? Do the same for q.

Niloy B

Frequent poster Post Number: 112

Posted on Friday, 06 August, 2010 - 03:36 pm: OK, sorry andrew. SO 3>r, giving r=2; Subsituting into the question gives: 2pq|pq+2q+2p-1, so 2pq<pq+2q+2p, but pq+2q+2p<p(q+4), so 2q<q+4, giving q<4, so q=3. SO, as p|qr-1=5, p=5. My first BMO paper where all the questions have been solved! (ofcourse, with the exception of this Q, where some "less than subtle" hints were needed)

andrew

Prolific poster

Posted on Friday, 06 August, 2010 - 04:08 pm:

Post Number: 231

Well done, in fact it was a Romanian TST problem for the Junior Balkan in itself (from roughly 2000) to find all primes p,q,r such that pq+qr+rp>pqr. Of course there are no other restrictions so there are more solutions. BMO2 1995 Q1 should seem simpler to you now.

http://forum.matholympiad.org.bd/viewtopic.php?f=25&t=2044

Russia 1995; Romanian TST 1996; Iran 1997

Post Number:#1 by FahimFerdous Sun Apr 15, 2012 12:50 pm Consider a circle with diametre AB and centre O and let C and D be two points on this circle. The line CD meets the line AB at a point M satisfying MB MA and MD MC . Let K be the point of intersection (different from O) of the circumcircles of triangles AOC and DOB. Show that MKO=90o Your hot head might dominate your good heart! My solutions: define AC BD=F and AD BC=J.then F is the radical point.so O K F are collinear.angle chasing yields F C K D are concyclic.and as J is the orthocentre then F C J D concyclic.so C K J D concyclic.again C K J B concyclic.so M is the radical point.so M J K are collinear.as MJ is the polar of F,OF is perpendicular to MJ. Awesomeness comes first.After that may come whatever the shit you are made of.

Re: Russia 1995; Romanian TST 1996; Iran 1997

Post Number:#3 by zadid xcalibured Tue Apr 24, 2012 1:01 am My solutions: 1.complex number+pole-polar 2.if we do inversion with respect to O,the problem gets killed.then just Feuerbach circle. Awesomeness comes first.After that may come whatever the shit you are made of.

http://mathvn.org/forum/viewthread.php? thread_id=1261http://mathvn.org/forum/viewthread.php?thread_id=1261

Cc bn thi olympic hy th nh! Nonlinear Ordinary Differential Equations: Problems and Solutions ..... Sau y l li gii ca mnh cho Romania TST 2007: Cho a_1,a_2_ ...

Singapore Mathematical Society - SIMO Home Page

#1 Gi vo lc 16-07-2009 04:53 Cho rng

can_hang2007 iu hnh vin

. Chng minh

Posts: 256 Joined: 27.02.09

Bi ny dng pht biu ca n gi cho mnh ngh n mt bi khc c vit th ny: Cc bn c th thy y l mt kt qu lm mnh ca bi APMO 2004: V ta c th cm n nh sau: ta ch cn chng minh . R rng trong 3 s lun tn ti 2 s tha tnh cht ny nn ta c th gi s n. Bdt ny c lin quan vi bi ton chnh t nhiu, c th ta thy

Sa bi wishes vo lc 16-07-2009 11:58

http://mathproblems123.wordpress.com/2011/04/20/romanian-tst-2011-problem-1/ Home > Algebra, Olympiad > Romanian TST 2011 Problem 1

Romanian TST 2011 Problem 1

April 20, 2011 beni22sof Leave a comment Go to comments

1 Votes Find all functions for which we have . Romanian TST 2011 Solution: For we get that . In the initial identity, take . For . For we find that , and get . , and

This means that is constant on therefore is constant everywhere.

and . Therefore take to get that

April 20, 2011 at 11:34 pm | #1 Reply | Quote 0 0 Rate This

There is a shorter solution: Take directly and obtain , hence is a constant. The converse is immediate.

http://books.vnmath.com/2013/04/dap-de-thi-olympic-sinh-vien-giai-tich.html

http://projectpen.wordpress.com/category/pen-solutions-archive/page/5/

http://www.cheenta.com/wiki/index.php?title=Polynomials

http://diendantoanhoc.net/forum/index.php?/topic/14062-romania-tst-2006/