Problem 48175. Cipher or Decipher the number according to the second input - 3 keys - order [1 2 3 2 1 2 3 ......]
You will be given an input number. You have to figure out the cipher keys and match it with given input and cipher it and decipher it according to second input.
The following are not real keys, just an example:
ref = [0 1 2 3 4 5 6 7 8 9];
key_1 = [1 2 3 4 5 6 7 8 9 0];
key_2 = [3 4 5 6 7 8 9 0 1 2];
key_3 = [2 3 4 5 6 7 8 9 0 1];
For example, if x = 12321, y = 1:
output = 25552
(Hint: index: 1 -> key 1, 2 -> key 2, 3 -> key 3, 4 -> key 2, 5 -> key 1, 6 -> key 2, 7 -> key 3, 8 -> key 2, 9 -> key 1, ...)
Or, if x = 25552, y = 2:
output = 12321
Solution Stats
Problem Comments
-
4 Comments
Show
1 older comment
Lincoln Poon
on 22 Jan 2021
Other problems of this type (cipher/decipher from 2nd input) are called with 2 arguments.
If that was the intended way of solving this question, someone please fix the test suite.
goc3
on 25 Jan 2021
The problem description has been cleaned up. Also, the test suite now calls the function with two inputs, as mentioned by William.
Based on a commented-out solution by Lincoln Poon, the problem appears to now be functional.
Lincoln Poon
on 30 Jan 2021
Thank you:)
Solution Comments
Show commentsGroup

Number theory
- 44 Problems
- 21 Finishers
- Pseudo-vampire number
- Pell numbers
- Frugal number
- Be happy
- Bell Triangle
- find nth even fibonacci number
- Cantor counting
- check whether a number is a pentatope number
- generate nth pentatope number
- Fangs of a vampire number
- Find all vampire fangs
- Balanced number
- Mandelbrot Numbers
- Parasitic numbers
- Woodall number
- Kaprekar numbers
- Project Euler: Problem 4, Palindromic numbers
- Fangs of pseudo-vampire number
- Project Euler: Problem 9, Pythagorean numbers
- Mersenne Primes
- Sophie Germain prime
- Determine if input is a Narcissistic number
- Determine if input is a perfect number
- Ordinal numbers
- Lychrel Number Test (Inspired by Project Euler Problem 55)
- Circular Primes (based on Project Euler, problem 35)
- Largest Twin Primes
- Golomb's self-describing sequence (based on Euler 341)
- Is it an Armstrong number?
- Champernowne Constant
- Last non-zero digit
- Generate a Parasitic Number
- Smith numbers
- Evil Number
- Armstrong Number
- Polite numbers. Politeness.
- Polite numbers. N-th polite number.
- Narcissistic number ?
- Is this number Munchhausen?
- P-smooth numbers
- Iccanobif numbers 1
- Amicable numbers
- Extra safe primes
- Pentagonal Numbers
Problem Recent Solvers9
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!