Some problems
by hashbrown2009, Apr 19, 2025, 11:01 PM
1. Real numbers a,b,c are satisfy a+1/b = b+1/c = c+1/a =x. If a,b,c are distinct, what is the value of x?
2. If x^2+y^2=1, then what is the value of : root(x^2-2x+1) + root(xy-2x+y-2) ?
3. Find the value of the sequence 2^2 + (3^2+1) + (4^2+2) + … + (97^2+95) + (98^2+96).
4. If x^2+x-1=0, then evaluate (1-x^2-x^3-x^4-…-x^2022-x^2023)/x^2022 .
5. If triangle XYZ has 3 sides that are all whole numbers, and the perimeter of XYZ is 24, what is the probability XYZ is a right triangle?
Note: If someone can latex-ify this it would help.
2. If x^2+y^2=1, then what is the value of : root(x^2-2x+1) + root(xy-2x+y-2) ?
3. Find the value of the sequence 2^2 + (3^2+1) + (4^2+2) + … + (97^2+95) + (98^2+96).
4. If x^2+x-1=0, then evaluate (1-x^2-x^3-x^4-…-x^2022-x^2023)/x^2022 .
5. If triangle XYZ has 3 sides that are all whole numbers, and the perimeter of XYZ is 24, what is the probability XYZ is a right triangle?
Note: If someone can latex-ify this it would help.
This post has been edited 1 time. Last edited by hashbrown2009, Yesterday at 11:02 PM
Twin Primes Digital Root
by FerMath10, Apr 19, 2025, 8:51 PM
Hi,
I noticed something interesting while playing around with twin primes (pairs of primes that differ by 2). Here is what I noticed:
Conjecture: The product of twin primes—excluding the pair (3, 5)—always has a digital root of 8.
Just to clarify, the digital root of a number is the single-digit value you get by repeatedly summing its digits until only one digit remains. For example, the digital root of 77 is 7 + 7 = 14, and then 1 + 4 = 5.
I tested this on several examples, and it seems to hold, but I’m not sure if it’s a well-known result or something that breaks down for larger primes.
Is this an obvious consequence of some known number theory property? Would love to hear your thoughts!
I noticed something interesting while playing around with twin primes (pairs of primes that differ by 2). Here is what I noticed:
Conjecture: The product of twin primes—excluding the pair (3, 5)—always has a digital root of 8.
Just to clarify, the digital root of a number is the single-digit value you get by repeatedly summing its digits until only one digit remains. For example, the digital root of 77 is 7 + 7 = 14, and then 1 + 4 = 5.
I tested this on several examples, and it seems to hold, but I’m not sure if it’s a well-known result or something that breaks down for larger primes.
Is this an obvious consequence of some known number theory property? Would love to hear your thoughts!
L
Good Problem??
by pedronis, Apr 19, 2025, 6:05 PM
Let
be a positive integer and
a prime number. Consider the sequence
defined by
Let
be the smallest prime such that some term of the sequence is divisible by
. Determine all pairs
for which
.



![\[
a_n = (p - 2)^n + p^n - m, \quad \text{for } n \geq 1.
\]](http://latex.artofproblemsolving.com/5/9/e/59e2074875b2d41f1e2ac272d06e65f3ebab85ff.png)




Calculus BC help
by needcalculusasap45, Apr 19, 2025, 1:51 PM
So basically, I have the AP Calculus BC exam in less than a month, and I have only covered until Unit 6 or 7 of the cirriculum. I am self studying this course (no teacher) and have not had much time to study bc of 6 other APs. I need to finish 8, 9, and 10 in less than 2 weeks. What can I do ? I would appreciate any help or resources anyone could provide. Could I just learn everything from barrons and princeton? Also, I have not taken AP Calculus AB before.
ez problem....
by Cobedangiu, Apr 18, 2025, 11:07 AM
Let
and 
Find
.



Find


This post has been edited 1 time. Last edited by Cobedangiu, Friday at 11:08 AM
Reason: .
Reason: .
L
Geometry
by AlexCenteno2007, Apr 17, 2025, 6:28 PM
Let A, B, C, and D be four distinct points on a straight line, in that order. The circles with diameters AC and BD intersect at X and Y. The straight line XY intersects BC at Z. Let P be a point on XY distinct from Z. The straight line CP intersects the circle with diameter AC at C and M, and the straight line BP intersects the circle with diameter BD at B and N. Show that AM, DN, and XY are aligned.
Geometry
by AlexCenteno2007, Apr 17, 2025, 3:54 AM
Let C be a point on a semicircle of diameter AB and let D be the mid-length of arc AC. Let E be the projection of point D on BC and F the intersection of AE with the semicircle. Prove that BF bisects segment DE.
This post has been edited 1 time. Last edited by AlexCenteno2007, Apr 17, 2025, 5:42 PM
Reason: Error
Reason: Error
Inequalities
by sqing, Apr 16, 2025, 4:52 AM
Let
be reals such that
. Prove that



Let
be reals such that
. Prove that
















Inscribed Semi-Circle!!!
by ehz2701, Sep 11, 2022, 7:29 AM
A right triangle
with legs
and
is drawn with a semicircle inscribed into the triangle. What is the smallest possible radius of the semi-circle and the largest possible radius?



Combinatorics #2
by utkarshgupta, Feb 18, 2017, 10:46 AM
Problem (ISL 2004 C5) :
and
play a game, given an integer
,
writes down
first, then every player sees the last number written and if it is
then in his turn he writes
or
, but his number cannot be bigger than
. The player who writes
wins. For which values of
does
win?
Proposed by A. Slinko & S. Marshall, New Zealand
Idea of Solution












Proposed by A. Slinko & S. Marshall, New Zealand
Idea of Solution
The questions is kinda easy if you dont know the answer
.
Well I will be only instructive !
Show that
will win for all odd
.
And then show that if
wins for
, she also wins for
and
.
It's really that simple (as the strategy is realllly easy)
But the answer !
Ohh the answer !
B has a winning strategy for all numbers with it's digits as
in expression of
in base-
.
I couldn't really frame the answer in this way.
But elegant and amazing indeed

Well I will be only instructive !
Show that


And then show that if




It's really that simple (as the strategy is realllly easy)
But the answer !
Ohh the answer !
B has a winning strategy for all numbers with it's digits as



I couldn't really frame the answer in this way.
But elegant and amazing indeed
Combinatorics #1
by utkarshgupta, Feb 17, 2017, 1:57 PM
JEE preps are adversely impacting my thinking ability.
So I will try and do something that I didn't even do when I was actually preparing for the olympiads
Actually think !
It's trivial I know I know...
But it was fun !
Problem (ISL 2015 C1) :
In Lineland there are
towns, arranged along a road running from left to right. Each town has a left bulldozer (put to the left of the town and facing left) and a right bulldozer (put to the right of the town and facing right). The sizes of the
bulldozers are distinct. Every time when a left and right bulldozer confront each other, the larger bulldozer pushes the smaller one off the road. On the other hand, bulldozers are quite unprotected at their rears; so, if a bulldozer reaches the rear-end of another one, the first one pushes the second one off the road, regardless of their sizes.
Let
and
be two towns, with
to the right of
. We say that town
can sweep town
away if the right bulldozer of
can move over to
pushing off all bulldozers it meets. Similarly town
can sweep town
away if the left bulldozer of
can move over to
pushing off all bulldozers of all towns on its way.
Prove that there is exactly one town that cannot be swept away by any other one.
Solution :
Let the statement be true for
.
Let the towns be labelled
from left to right and their left and right bulldozer
respectively.
Now we have to prove the statement for
towns..
Consider the rightmost town
and let some
collide with 
Then there are two cases :
derails all such
. Then obviously
is the new winner town !
If some
derails
. Then obviously since there is no other bulldozer between this point and
,
sweeps 
Since there are no bulldozers between
and
, The first
towns live unaffected by the remaining towns. And hence by inducton we are done.
So I will try and do something that I didn't even do when I was actually preparing for the olympiads

Actually think !
It's trivial I know I know...
But it was fun !
Problem (ISL 2015 C1) :
In Lineland there are


Let












Prove that there is exactly one town that cannot be swept away by any other one.
Solution :
Let the statement be true for

Let the towns be labelled


Now we have to prove the statement for

Consider the rightmost town



Then there are two cases :



If some





Since there are no bulldozers between



Stay insane,Coz it's your will, labour and pain,which takes you to the top of the mountain.
Archives

















Shouts
Submit
48 shouts
Contributors
Tags
About Owner
- Posts: 2280
- Joined: Jan 4, 2013
Blog Stats
- Blog created: Nov 30, 2013
- Total entries: 86
- Total visits: 39755
- Total comments: 102
Search Blog