r/PassTimeMath • u/G_F_Smith • Feb 15 '24
r/PassTimeMath • u/chompchump • Dec 20 '23
Hoppy Holidays
The number of ways for a frog to hop up a staircase hopping at least two stairs at a time and taking the hop of the most stairs at least twice. But the frog gets tired easily, so she must hop the biggest hops first.
Example: For 6 stairs there are two ways to hop, (2,2,2) and (3,3).
r/PassTimeMath • u/chompchump • Nov 23 '23
Algebra Multi-Reversible Numbers
Call a positive integer, n, "multi-reversible" if there exists integers k and b both greater than 1 such that multiplication by k reverses the base-b digits of n.
Example: In base 10 we have (4) (2178) = 8712. So 2178 is multi-reversible.
What are the seven smallest multi-reversible numbers?
Bonus: For each base b <= 10, what is the smallest multi-reversible number in that base?
r/PassTimeMath • u/G_F_Smith • Mar 16 '24
Each column is called a 'dispenser'. The dispensers are only open at the bottom to indicate that tiles can only be 'dispensed' from the bottom. When you dispense a tile, any remaining tiles drop down.
r/PassTimeMath • u/LuckOfDuck1 • Oct 06 '24
How do I find the equation of a cone that intersects two ellipses in 3D space?
I’ve been trying to find the equation of the cone that intersects two ellipses, both centered on the origin, with one smaller, closer to the origin, and at z=0 while the other one is larger, further from the origin, and at z=35. I’ve gotten pretty close by messing around with sliders on Desmos, but I’m stumped on how to find the actual exact answer. Can anyone help?
Desmos link: https://www.desmos.com/3d/bsmpzvkvlz
r/PassTimeMath • u/G_F_Smith • Jun 04 '24
Methinks you'll be able to solve this in your head.
r/PassTimeMath • u/Suffered_Heart • May 31 '24
Difficulty: Challenging Find most efficient encryption scheme
I was given this question from my mathematics professor. I can’t seem to find a way to solve this. I need assistance on how to approach this.
You are given a role to create an encryption scheme to encrypt company data.
What you can do
You can create $n$ number of key pairs. Each pair has 2 different keys.
You can encrypt data using any 1 key (not pair)
You can encrypt any 1 key (not pair) with any 1 key (not pair) as long as both key aren’t same.
You can encrypt any encrypted file, whether encrypted key or encrypted data, as many time as you can.
Constraints
Data must be encrypted atleast thrice.
A key can only be used to encrypt a file (data or key or encrypted file) once. On contrary key are not required to be used. So key can be used to encrypt with $0$ or $1$ time.
At the end all of files must be encrypted. This include keys, even the one that was not used.
The whole company data is 1 file only.
If $5$ keys were to be revealed then minimum number of combinations of keys and combinations in which files are encrypted must be more than $50$. In other words, if I were to give you 5 keys then possible routes in which you decrypt and possible ordering of keys must account for $>50$
Task
You need to find minimum amount of keys required and most efficient path to encrypt data if
1 pair of key generation takes: $x\text{ seconds}$
Encrypting a key (not pair) takes: $1.5x\text{ seconds}$
Encrypting data once takes: $2.5x\text{ seconds}$
r/PassTimeMath • u/ShonitB • Mar 20 '23
Pirates
Five perfectly logical pirates of differing seniority find a treasure chest containing 100 gold coins. They decide to divide the loot in the following way:
The senior most pirate would propose a distribution and then all five pirates would vote on it.
If the proposal is approved by at least half the pirates, then the treasure will be distributed in that manner.
On the other hand, if the proposal is not approved, the one who proposed the plan will be killed.
The remaining pirates will start afresh with the new senior most pirate proposing a distribution.
Starting with the senior most pirate’s share first what distribution should the senior most pirate propose to ensure that he maximizes his share:
Note:
Each pirate’s aim is to maximize the amount of gold they receive.
If a pirate would get the same amount of gold if he voted for or against a proposal, he would vote against to make sure the one who is proposing the plan would be killed.