2004 USAMO Problems/Problem 6: Difference between revisions

Revision as of 18:45, 23 February 2012

For what values of $k > 0$ is it possible to dissect a $1 \times k$ rectangle into two similar, but incongruent, polygons?

2004 USAMO (Problems • Resources)
Preceded by Problem 5	Followed by Last problem
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions

Revision as of 18:45, 23 February 2012 view source Kubluck (talk \| contribs) 307 edits Created page with "==Problem== For what values of <math>k > 0 </math> is it possible to dissect a <math> 1 \times k </math> rectangle into two similar, but incongruent, polygons? ==Solution== ==..."		Revision as of 18:45, 23 February 2012 view source Kubluck (talk \| contribs) 307 edits No edit summary Newer edit →
Line 7:		Line 7:
	== Resources ==		== Resources ==

	{{USAMO newbox\|year=2004\|num-b=5\|~~num-a~~=4}}		{{USAMO newbox\|year=2004\|num-b=5\|after=Last problem}}