All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Place Ten Positive Integers, Get Minimum (Posted on 2023-04-25) Difficulty: 3 of 5
Consider a positive integer constant n.

Ten distinct integers are placed on the vertices of a regular decagon satisfying both the following conditions:
• The product of two non adjacent integers on the decagon is a multiple of n.
• The product of any pair of adjacent integers is NOT a multiple of n.

Determine the minimum value of n.

See The Solution Submitted by K Sengupta    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips Improvement | Comment 4 of 5 |
For the decagon an improved minimum is (2*3*5*7*11)^2

The idea is to place five "holes" around the perimeter two spaces apart.  Each with no factors of a certain prime and its neighbors with only one factor.

let (a,b,c,d,e) be the number of factors of 2,3,5,7,11 then we have the cycle

(0,2,2,2,2)
(1,1,2,2,2)
(2,0,2,2,2)
(2,1,1,2,2)
(2,2,0,2,2)
(2,2,1,1,2)
(2,2,2,0,2)
(2,2,2,1,1)
(2,2,2,2,0)
(1,2,2,2,1)

You can see that each adjacent pair lacks a sum of 2 in one of the primes, but pairs further apart do sum of at least 2 in all spots.

  Posted by Jer on 2023-04-25 16:39:11
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (13)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information