A one rupee coin is placed on a table. The maximum number of similar one rupee coins which can be placed on the table, around it, with each one of them touching it and only two others is:
Show Hint
This is known as the "kissing circle" or "circle packing" problem. Around one circle, max 6 of equal size can touch it and just 2 others.
The arrangement requires:
- Each surrounding coin must touch the central coin
- And each coin should touch only 2 other coins (forming a ring)
This is a classic circle-packing scenario.
In 2D, the maximum number of equal-sized circles that can touch another of the same size = 6 (in a circle).
Hence, placing 6 coins in a hexagonal ring around 1 central coin is possible. Each will touch center and its two neighbors.
\[
\boxed{6}
\]