Difference between revisions of "2021 JMPSC Invitationals Problems/Problem 5"
(Created page with "==Problem== An <math>n</math>-pointed fork is a figure that consists of two parts: a handle that weighs <math>12</math> ounces and <math>n</math> "skewers" that each weigh a n...") |
(→Problem) |
||
| Line 2: | Line 2: | ||
An <math>n</math>-pointed fork is a figure that consists of two parts: a handle that weighs <math>12</math> ounces and <math>n</math> "skewers" that each weigh a nonzero integer weight (in ounces). Suppose <math>n</math> is a positive integer such that there exists a fork with weight <math>n^2.</math> What is the sum of all possible values of <math>n</math>? | An <math>n</math>-pointed fork is a figure that consists of two parts: a handle that weighs <math>12</math> ounces and <math>n</math> "skewers" that each weigh a nonzero integer weight (in ounces). Suppose <math>n</math> is a positive integer such that there exists a fork with weight <math>n^2.</math> What is the sum of all possible values of <math>n</math>? | ||
<center> | <center> | ||
| − | [[File:Invites5.png| | + | [[File:Invites5.png|400px]] |
</center> | </center> | ||
==Solution== | ==Solution== | ||
Revision as of 14:03, 11 July 2021
Problem
An 
-pointed fork is a figure that consists of two parts: a handle that weighs 
ounces and "skewers" that each weigh a nonzero integer weight (in ounces). Suppose is a positive integer such that there exists a fork with weight 
What is the sum of all possible values of ?
