A problem you find interesting
Let's say your friend knows nothing about olympiad math problems, and as an example you want to give him or her one that shows the idea of problem solving but at the same time isn't overly complex so they can find it intellectually interesting and understand the problem. What problem would you give them? (looking for a specific one)
Note by
Michael Tong
7 years, 8 months ago
No vote yet
10 votes
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*or_italics_**bold**or__bold__paragraph 1
paragraph 2
[example link](https://brilliant.org)> This is a quote# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"\(...\)or\[...\]to ensure proper formatting.2 \times 32^{34}a_{i-1}\frac{2}{3}\sqrt{2}\sum_{i=1}^3\sin \theta\boxed{123}Comments
I like this one - it's about mid-late AIME, and I wrote it!
Call a number huge if the sum of its digits is at least 23. There are exactly 35 huge three-digit numbers, and there are exactly 2205 huge four-digit numbers. Find the number of five-digit huge numbers.
Log in to reply
I like it.. but what I first thought is that these American Michael Ts are messing with my brain!
Log in to reply
He's michael tAng, i'm michael tOng :D
Show that at a party there are always at least 2 people who greet the same number of participants.
Log in to reply
I know it's an easy problem but here's the solution if someone needs it ;)
Let n be the number of participants.
[1] The number of participants someone could greet is a number between 1 and n−1 (if someone greets 0 people than no one can greet n−1 people and the number is between 0 and n−2).
Let's suppose that each participant has a card with a number corresponding to the "number of participants greeted by him": in consequence of what was said in [1], there are n−1 possible values for this number. But the participants are n. Therefore there are at least 2 participants who have a card with the same number (box principle): this shows that there are at least 2 people who greet the same number of participants.
This one is actually given from me to a friend that is curious what "math olympiad" is. Which is also a well-known problem, but hey why not.
A standard (8×8) chessboard has two opposite corners removed. We want to place 31 dominoes (there are 62 squares remaining), each covering two adjacent squares, on the board, such that all dominoes lie on the board and all squares are covered. Can we do it?
It's a fairly simple statement, but with a nontrivial answer. Exactly as the question asks for?
Also, if you want a problem that is easy to understand, always try giving a combinatorics question; second contender would be some kind of geometry that doesn't involve naming points. People are easily shunned by variables. Combinatorics wins against geometry just because problems in combinatorics are more "real-life" like; they can imagine the problem simpler. But that's my opinion, and yours might differ.
What is the last digit of 22013?
How many positive divisors does 120 have?
Log in to reply
Something more complex than that though. I don't think anybody would find a question like that "interesting"
Log in to reply
Well, you didn't specify the problemsolving-level of this friend. While these problems might not be that hard, the math behind them is quite interesting! Furthermore, alot of advanced questions boil down to these simple questions.
last digit=[2^10]^2012^3=248=192 last digit =2
since[ 2^10]^odd=last two digits are 24 and in case of even it is 76
120=2^3 35 hence total no of divisor=(3+1)(1+1)(1+1)=16
last digit=[2^10]^2012^3=248=192 last digit =2
120=2^3 35 hence total no of divisor=(3+1)(1+1)(1+1)=16 since[ 2^10]^odd=last two digits are 24 and in case of even it is 76
An old manuscript describing the location of a buried treasure: There are only two trees, A and B, in a flat terrain, and a bed of tomatoes. "A" is a hose, and B an appletree. From the center K of the tomatoes bed, measure the distance in a straight line to the hose. Turn 90 degrees to the left and go through the same distance to point C. Go back to the tomatoes bed. Measure the straight line distance to the appletree. Turn 90 degrees to the right and go through the same distance to the point D. The treasure is at the midpoint T of the segment CD. An adventurer found the manuscript, identified the trees, but as the tomatoes bed disappeared over time, could not locate it, and gave up the search. The student Brilli the Ant, under same conditions, says it would be able to locate the treasure. Show you how to solve the problem, ie, give the coordinates of point T as a function of the coordinates of A = (5, 3) and B = (8, 2).
Find ii, where i=−1.
That's cool :P
Log in to reply
i^i = e^(-pi/2) which is real.
1)Every road in Sikinia is one-way.Every pair of cities is connected exactly by one direct road.Show that there exists a city which can be reached from every city directly or via at most one other city.
2)One of the n+1 numbers from {1,2,3,⋯,2n} is divisible by another.
Why does the ASS congruence not hold?
What is ∞∞?
Log in to reply
Hm... you can't really answer that using olympiad math techniques.