Study questions platform-wide or filter by specific tests with correct answers revealed.
1. Carriage Out: Debit side too high by $90 (Correction: Credit Suspense $90).
2. Purchases Returns: Credit side (returns) too high by $100 (Correction: Debit Suspense $100).
3. Wrong Person: No effect on Suspense (Debit/Credit match).
4. Rent: Income ($350 Cr) put in Expense ($350 Dr). Total error is $700 on debit side (Correction: Credit Suspense $700).
Net correction: $90 (Cr) - $100 (Dr) + $700 (Cr) = $690 Credit. To clear this, the opening balance must have been $690 Credit.
Entropy is a concept borrowed from thermodynamics and information theory. In communication, it measures the degree of uncertainty or unpredictability in a message system. The greater the number of possible messages a source could send, the higher the entropy β because the receiver cannot predict with confidence what will arrive next. Consider a coin toss (low entropy, only two outcomes) versus selecting one square on a 64-square chessboard (high entropy, 64 possible outcomes). High entropy means more information value per message received, because the message resolves greater uncertainty. However, very high entropy also makes communication more difficult because there is little predictability to guide decoding. This is why communication systems balance entropy with redundancy β repeating or reinforcing elements that the receiver can use to reconstruct meaning even under noisy conditions.
Find the number of surjective (onto) functions $f$ from $\{1,2,3,\ldots,20\}$ to $\{1,2,3,\ldots,20\}$ such that $f(k)$ is a multiple of 3 whenever $k$ is a multiple of 4.
Multiples of 4 in $\{1,\ldots,20\}$: $\{4,8,12,16,20\}$ β 5 elements. Their images must be multiples of 3 in $\{1,\ldots,20\}$: $\{3,6,9,12,15,18\}$ β 6 elements.
Assign the 5 multiples-of-4 to 5 of the 6 multiples-of-3 (injectively, since $f$ is onto): $6 \times 5 \times 4 \times 3 \times 2 = 6!/(6-5)! = 720$... but we need surjection on all 20 elements.
The remaining 15 domain elements map to the remaining 15 codomain elements (after fixing the 5 images above): $(15)!$ ways. But 1 multiple-of-3 is unused by the multiples-of-4, so it must be covered by remaining 15 elements.
Total $= 6! \times (15)! = (15)! \times 6!$
Douglas McGregor's Theory X and Theory Y (1960):
| Theory X | Theory Y |
|---|---|
| Employees are inherently lazy | Employees are self-motivated |
| Dislike work and avoid it | Find work natural and satisfying |
| Need close supervision and control | Can be self-directed and creative |
| Motivate through punishment/rewards | Motivate through autonomy and responsibility |
In nursing management, Theory X leads to authoritarian leadership, while Theory Y encourages participative management. Most modern nursing management advocates Theory Y to improve staff engagement and retention.
Let $A$ be a $2\times2$ symmetric matrix with integer entries. If the sum of the diagonal elements of $A^2$ equals 1, find the number of such possible matrices.
Let $A=\begin{pmatrix}a&b\\b&c\end{pmatrix}$. Then $A^2=\begin{pmatrix}a^2+b^2&ab+bc\\ab+bc&b^2+c^2\end{pmatrix}$.
Sum of diagonal of $A^2 = a^2+2b^2+c^2 = 1$.
Since $a,b,c$ are integers and $a^2+2b^2+c^2=1\geq0$: $b=0$ (since $2b^2\leq1$ with integer $b$ forces $b=0$), then $a^2+c^2=1$.
Solutions: $(a,c)\in\{(1,0),(β1,0),(0,1),(0,β1)\}$ and $b=0$: 4 matrices. But we should check $b=\pm1$: $2(1)=2>1$, not possible. Hmm β that gives only 4. But checking $b=0$, $a^2+c^2=1$: integer solutions are $(\pm1,0)$ and $(0,\pm1)$ β exactly 4 pairs, each with $b=0$. So $\mathbf{4}$ matrices... but wait: $b$ can also vary if we allow it. Total = $\mathbf{4}$ matrices.
Sign in to join the conversation and share your thoughts.
Log In to Comment