A tennis tournament has 64 players and every match knocks one player out. How many matches are played? You could count round by round: 32+16+8+4+2+1=63. Or notice that each match eliminates exactly one player, and 63 players must be eliminated to leave a single winner, so there are 63 matches. The second argument is elegant: one observation, no adding, and it works just as easily for 100 players (99 matches), where the rounds no longer halve neatly.
That is the pattern. An elegant solution finds the structure that makes the problem easy, and in doing so it explains why the answer is what it is. Gauss's pairing for 1+2+⋯+100, the one-loser-per-match count, and the picture in which 1+3+5+7=16 appears as a 4-by-4 square built from L-shaped layers all trade calculation for insight.
Short is not the same as elegant. "By a known formula, the answer is 5050" is short but explains nothing, and a trick that works once while hiding its reasoning isn't elegant either. Elegance is also separate from rigour: a beautiful idea still has to be written carefully, with every case covered, before it counts as a proof.
Think of it like this. An elegant solution is like finding the light switch in a dark room instead of feeling your way around every piece of furniture: one move and the whole room is visible, including why it is arranged as it is. Not every room has a switch, though; some problems only give way to careful brute force.
Core idea. Mathematical elegance is an argument or result that reaches its goal with striking simplicity and economy.