Escolar Documentos
Profissional Documentos
Cultura Documentos
Home
(1)AlgebraProblem:AustralianMathematicsCompetition2015Q30SharkyKesa|Brilliant
AustralianMathematicsCompetition2015Q30
Stats
Profile
Interact
Community
In a stack of logs, each row has exactly one fewer log than the row
below. With 9 logs, the tallest possible stack is 4 logs at the
bottom, 3 logs in the second row and 2 logs on the top row,
making a total of 3 rows. With 2015 logs, how many rows are
there in the tallest possible stack?
Correct!
Youanswered62.
Publish
About
Hide3solutions
Nextproblem
Topics
Algebra
Shareit.
Geometry
28%ofpeoplegotitright
NumberTheory
Calculus
bySharkyKesa,14,Australia
144Solvers
Save
Share
More
Combinatorics
BasicMathematics
Logic
Search
3Solutions
Voteupsolutionsyouadmire
ClassicalMechanics
ElectricityandMagnetism
ComputerScience
KrutarthPatel
QuantitativeFinance
SATMath
Writeasolution.
JEEMath
Solutionwritingguide:Level4
Formattingguide
Insertanimage
Preview
ChewSeongCheong
1week,5daysago
14
We note that the number of logs of a "perfect" stack, that is the top row with
... until
Since
. For example:
rows.
greater than
and check
logs is
.
Subscribetocomments
Reply
KushagraSahni
1week,4daysago
Reply
AsdfghRfcv
1week,4daysago
https://brilliant.org/problems/australianmathematicscompetitionq30/?group=zmCFaDQeLvbe#!/solutioncomments/113503/
1/4
10/2/2015
(1)AlgebraProblem:AustralianMathematicsCompetition2015Q30SharkyKesa|Brilliant
hold on explain how tallest stack has n-1 rows.a doubt from a student.
Reply
ChewSeongCheong
1week,4daysago
In response to Asdfgh Rfcv: Let the number of logs be . The following shows
how
logs are stacked. Note not all number of rows is
. When
, such as
, the number of rows is . When
, such as
then the number of rows is
. Observe that
is
an odd one out.
Lastmodified1week,2daysago
Reply
SharkyKesa
1week,3daysago
Reply
OttoBretscher
1week,2daysago
In response to Sharky Kesa: Sure stacking 8 logs is possible... one row of eight
logs ;)
Reply
AsdfghRfcv
1week,4daysago
Reply
SharkyKesa
1week,5daysago
Nice solution.
Reply
SharkyKesa
1week,5daysago
https://brilliant.org/problems/australianmathematicscompetitionq30/?group=zmCFaDQeLvbe#!/solutioncomments/113503/
2/4
10/2/2015
(1)AlgebraProblem:AustralianMathematicsCompetition2015Q30SharkyKesa|Brilliant
Since and
give 4030.
Since
are positive integers, we have to determine pairs of positive integers that multiply to
Since and both satisfy being positive integers, this combination works. Therefore, the
maximum value of
is
. There are 62 rows of logs in the stack.
ChallengeMasternote:
Goodobservationofpullingoutjust
Subscribetocomments
Reply
LowPeiZuo
1week,4daysago
There is a statement written wrong accidentaly, m+n+1 should be greater than m-n.
Reply
KushagraSahni
1week,4daysago
Reply
OttoBretscher
1week,2daysago
Reply
https://brilliant.org/problems/australianmathematicscompetitionq30/?group=zmCFaDQeLvbe#!/solutioncomments/113503/
. For
rows, and we
Subscribetocomments
3/4
10/2/2015
(1)AlgebraProblem:AustralianMathematicsCompetition2015Q30SharkyKesa|Brilliant
Tryrelatedproblems
There'ssomethingspecialaboutRamanuja
Logismyfirstlove
Algebra Level3
Algebra Level3
Integerpolynomial
BouncingBall
Algebra Level4
Algebra Level3
Practicemath
Practicemath
https://brilliant.org/problems/australianmathematicscompetitionq30/?group=zmCFaDQeLvbe#!/solutioncomments/113503/
4/4