mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2021-04-24, 19:10   #23
Kebbaj
 
Kebbaj's Avatar
 
"Kebbaj Reda"
May 2018
Casablanca, Morocco

2·47 Posts
Default

[QUOTE=Yusuf;]


The amount of steps and the amount of spins both equal to 7? No.


The amount of steps is = 7 .
The amount of spins is a variable.

Last fiddled with by Kebbaj on 2021-04-24 at 19:40
Kebbaj is offline   Reply With Quote
Old 2021-04-25, 02:18   #24
Yusuf
 
Jan 2020

23 Posts
Default

[QUOTE=Kebbaj;576761]
Quote:
Originally Posted by Yusuf;


The amount of steps and the amount of spins both equal to 7? No.


The amount of steps is = 7 .
The amount of spins is a variable.
But it says "the set is of size n-7", wouldn't that mean that there are 7 spins since there are 7 numbers being taken away from the wheel?

Last fiddled with by Yusuf on 2021-04-25 at 02:19
Yusuf is offline   Reply With Quote
Old 2021-04-25, 04:46   #25
Dieter
 
Oct 2017

112 Posts
Default

[QUOTE=Yusuf;576792]
Quote:
Originally Posted by Kebbaj View Post

But it says "the set is of size n-7", wouldn't that mean that there are 7 spins since there are 7 numbers being taken away from the wheel?
Yes. I'm sure that Kebbaj wanted to say this.

I repeat: Look at #2! That was my first comment to this challenge.

Or look at #8 (uau): "Those refer to different things with "step".

Seems that when the puzzlemaster formulated the real task ("your goal...") he had forgotten the definitions he had made at the beginning of the challenge.

"At each spin ... a number is eliminated from the wheel."

For the challenge without *, k=number of spins = 7.
Dieter is offline   Reply With Quote
Old 2021-05-04, 22:37   #26
uau
 
Jan 2017

1708 Posts
Default

Here's my solution. Just pretty straightforward brute force - enough for the sizes asked for in the question.

The program takes the size as input, so calling it with an argument of "7" gives the basic solution, "8" bonus one.

Code:
#!/usr/bin/python3

from itertools import combinations
from math import lcm
import sys

def calc(n, q, s):
    a = list(range(1, n+1))
    for _ in range(s):
        w = (q-1) % len(a)
        a = a[w+1:] + a[:w]
    a.sort()
    return tuple(a)

turns = int(sys.argv[1])
for n in range(turns, 100):
    print("Trying", n)
    s = set()
    for i in range(lcm(*range(n-turns+1, n+1))):
        s.add(calc(n, i, turns))
    r = s.symmetric_difference(set(combinations(range(1, n+1), n-turns)))
    if r:
        break
print(n)
print(len(r))
print(sorted(r))
uau is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
2021 project goals gd_barnes Conjectures 'R Us 17 2021-09-19 18:00
March 2021 tgan Puzzles 0 2021-02-28 13:30
January 2021 tgan Puzzles 36 2021-02-09 21:29
February 2021 Xyzzy Puzzles 11 2021-02-04 14:53
Space plans for 2021. TommyJ Soap Box 2 2021-01-04 19:47

All times are UTC. The time now is 15:36.


Tue Oct 26 15:36:34 UTC 2021 up 95 days, 10:05, 0 users, load averages: 0.90, 1.35, 1.44

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.