B How to pick some numbers out of 13 integers, by a 4 digits code

  • B
  • Thread starter Thread starter robertphy
  • Start date Start date
  • Tags Tags
    Arithmetic
robertphy
Messages
15
Reaction score
5
TL;DR Summary
How to pick some numbers out of 13 integers, by a 4 digits code
This is the question I read in a Math quizzes book:
- you have the first 13 integers from 1 to 13
- someone gives you a code made of at most 4 digits (0 to 9)
- you decipher the code and tell him exactly which numbers he wanted from the list each number can be picked only once

For example.
case 1 He gives you 8191 and you tell he thought all the 13 integers from 1 to 13.
case 2 He gives you 6145 and you tell he thought only 1, 2, 13.
And so on.

I've not come up with any solutions yet. The only sparse ideas I have are:
case 1 if you sum the first 13 integers you get 91, so the last two digits of 8191
case 2 if you sum 1, 2, 13 you get the same result summing the digits of 6145

Also,
8191 mod 3 = 13
6145 mod 2 = 3

Beside that , I have no other clues how to move forward.
I would be grateful for some hints how to go on. Thank you very much.
 
Mathematics news on Phys.org
Hint: binary.
 
  • Like
Likes pbuk, hmmm27, Gavran and 3 others
If might help to enumerate how many possible outputs there are. From a pure counting perspective, is it even possible to make a map from 4 digit codes to subsets of integers between 1 and 13?
 
Office_Shredder said:
If might help to enumerate how many possible outputs there are. From a pure counting perspective, is it even possible to make a map from 4 digit codes to subsets of integers between 1 and 13?
Definite. Could fit 1/4 - 1/5 of the further ones required for a 14 element set, as well.
 
robertphy said:
I would be grateful for some hints how to go on.
Hill said:
Hint: binary.
This is a very good hint: how are you getting on?
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
3
Views
2K
Replies
2
Views
2K
Replies
8
Views
2K
Replies
9
Views
1K
Replies
12
Views
2K
Replies
16
Views
3K
Back
Top