Edit ‘quant_interview_questions’

This commit is contained in:
osmarks
2026-02-22 15:43:06 +00:00
committed by wikimind
parent 2fd5007c87
commit 4b811c28b8

View File

@@ -93,7 +93,7 @@
* A. B & C live together and share everything equally. One day A brings home 5 logs of wood, B brings 3 logs and C brings none. Then they use the wood to cook together and share the food. Since C did not bring any wood, he gives $8 instead. How much to A and how much to B?
* A group has 70 members. For any two members X and Y there is a language that X speaks but Y does not, and there is a language that Y speaks but X does not. At least how many different languages are spoken by the members of this group?
* An 8x8 chessboard can be entirely covered by 32 dominoes of size 2x1. Suppose we cut off two opposite corners of chess (i.e. two white blocks or two black blocks). Prove that now it is impossible to cover the remaining chessboard with 31 dominoes.
* You are in a glass box looking at seven other copies of you in their own boxes. Each of you has a white or black hat, selected at random uniformly and independently, and you are all numbered from 1 to 8 in an arbitrary order. You can see everyone else's hat colors and numbers, but not your own. Each of you may select black or white. A total of $8000 is split between you all based on how many shares you have (if this would result in non-whole cents each share's payout is rounded down). Each of you starts with one share. If your color selection matches the color of your hat, you gain one share, but remove $400 from the total payout. If it does not, you retain one share and the total payout does not change. You may not communicate with each other. What do you do to maximize your return? What if you are given an option to abstain at a cost of $100 to you?
* You are in a glass box looking at seven other copies of you in their own boxes. Each of you has a white or black hat, selected at random uniformly and independently, and you are all numbered from 1 to 8 in an arbitrary order. You can see everyone else's hat colors and numbers, but not your own. Each of you may select black or white. A total of $8000 is split between you all based on how many shares you have (if this would result in non-whole cents each share's payout is rounded down). Each of you starts with one share. If your color selection matches the color of your hat, you gain one share, but remove $400 from the total payout. If it does not, you retain one share and the total payout does not change. You may not communicate with each other. What do you do to maximize your return? What if you are given an option to abstain at a cost of $250 to you?
* There are 51 ants sitting on top of a square table with side length of 1. If you have a square card with side 1/5, can you put your card at a position on the table to guarantee that the card encompasses at least 3 ants?
* What is the minimum number of colors needed to paint the plane so that no two points 1 unit apart share a color?
* A bond prospectus states: “This bond will default if and only if its default cannot be proven in ZFC set theory.” What is the bonds credit rating?