Cindy wishes to arrange her coins into X piles, each consisting of the same number of coins, Y.
Each pile will have more than 1 coin and no pile will have all the coins. If there are 13 possible values for Y given all of the restrictions, what is the smallest number of coins she could have?
Please, help

Question

Cindy wishes to arrange her coins into X piles, each consisting of the same number of coins, Y. 
Each pile will have more than 1 coin and no pile will have all the coins. If there are 13 possible values for Y given all of the restrictions, what is the smallest number of coins she could have?
Please, help

loser66 · Answer

@ganeshie8

loser66 · Answer

By mistake, I deleted my post. Here is my comments. http://openstudy.com/study#/updates/56a183e0e4b05f90b1d19f78

xapproachesinfinity · Answer

old man you post hard problem :(

xapproachesinfinity · Answer

i feell like this problem is similar to |dw:1453429229032:dw|

xapproachesinfinity · Answer

a game that looks almost like your problem

xapproachesinfinity · Answer

|dw:1453429447592:dw|