1439 lines
62 KiB
Plaintext
1439 lines
62 KiB
Plaintext
MODEL: qwen3next-80b-a3b
|
||
PATH: /home/qrf/.cache/llama.cpp/Qwen3-Next-80B-A3B-Instruct-Q4_K_S.gguf
|
||
STARTED: 2026-07-12 00:36:47
|
||
|
||
======================================================================
|
||
Q01 [recall]
|
||
What is the Kasner metric, and in what context does it arise in general relativity?
|
||
|
||
ANSWER:
|
||
The **Kasner metric** is an exact solution to Einstein’s field equations in general relativity that describes an **anisotropic, vacuum, homogeneous spacetime** — meaning it has no matter or energy (vacuum), is the same at every point in space (homogeneous), but expands or contracts at different rates along different spatial directions (anisotropic).
|
||
|
||
---
|
||
|
||
### **Mathematical Form**
|
||
|
||
The Kasner metric in vacuum (i.e., with zero cosmological constant and no matter) is typically written in the form:
|
||
|
||
\[
|
||
ds^2 = -dt^2 + t^{2p_1} dx^2 + t^{2p_2} dy^2 + t^{2p_3} dz^2
|
||
\]
|
||
|
||
where:
|
||
- \( t > 0 \) is the time coordinate (often called "Kasner time"),
|
||
- \( x, y, z \) are spatial coordinates,
|
||
- \( p_1, p_2, p_3 \) are constants called **Kasner exponents**.
|
||
|
||
These exponents must satisfy the **Kasner conditions**:
|
||
|
||
\[
|
||
p_1 + p_2 + p_3 = 1
|
||
\]
|
||
\[
|
||
p_1^2 + p_2^2 + p_3^2 = 1
|
||
\]
|
||
|
||
These two constraints imply that not all exponents can be equal — in fact, **only one** of them can be positive, and the other two must be negative (or one zero and the others symmetric), ensuring anisotropic expansion/contraction.
|
||
|
||
For example, a common solution is:
|
||
\[
|
||
p_1 = -\frac{1}{3}, \quad p_2 = -\frac{1}{3}, \quad p_3 = \frac{5}{3}
|
||
\]
|
||
Here, the universe expands along the \( z \)-axis and contracts along \( x \) and \( y \).
|
||
|
||
---
|
||
|
||
### **Context in General Relativity**
|
||
|
||
The Kasner metric arises in the following key contexts:
|
||
|
||
1. **Homogeneous Cosmological Models**:
|
||
- It is one of the simplest exact solutions describing an anisotropic universe, and was first discovered by **Edward Kasner** in 1921.
|
||
- It is a special case of the more general **Bianchi Type I** cosmological models, which assume spatial homogeneity but allow anisotropy.
|
||
|
||
2. **Near the Big Bang (BKL Conjecture)**:
|
||
- In the 1970s, Belinskii, Khalatnikov, and Lifshitz (BKL) proposed that **near a spacetime singularity** (like the Big Bang), the dynamics of general relativity become local and oscillatory, and the spacetime can be approximated by a sequence of Kasner epochs.
|
||
- In this context, the Kasner metric describes **local, anisotropic behavior** of spacetime as it approaches the singularity, with transitions between different Kasner solutions ("Kasner epochs") driven by gravitational effects.
|
||
|
||
3. **Vacuum Gravity and Anisotropy**:
|
||
- It is a pure vacuum solution — no matter, no cosmological constant — so it illustrates how gravity alone can produce anisotropic expansion.
|
||
- It shows that isotropy (like in the FLRW metric) is not required by general relativity; anisotropy is perfectly allowed in vacuum.
|
||
|
||
4. **Limitations**:
|
||
- The Kasner solution is **not physical as a global cosmology** because:
|
||
- It has a **singularity at \( t = 0 \)** (infinite curvature),
|
||
- It does not describe a universe that becomes isotropic at late times (unlike our observed universe),
|
||
- It is unstable under small perturbations (as shown in BKL analysis).
|
||
|
||
---
|
||
|
||
### **Summary**
|
||
|
||
> The **Kasner metric** is an exact, anisotropic, vacuum solution to Einstein’s equations in general relativity, describing a homogeneous universe expanding or contracting at different rates along different spatial axes. It arises in the study of homogeneous cosmologies (Bianchi I models) and plays a central role in the BKL conjecture about the nature of generic spacetime singularities, such as the Big Bang. It demonstrates that general relativity permits anisotropic dynamics even in the absence of matter.
|
||
|
||
It is a foundational solution for understanding the complexity of gravitational collapse and early-universe dynamics beyond simple isotropic models.
|
||
|
||
EXPECTED (judge only): Vacuum solution to Einstein's equations describing an anisotropic, homogeneous universe; exponents satisfy sum p_i = sum p_i^2 = 1; arises in BKL analysis of cosmological singularities.
|
||
(finish=stop tokens=926 time=24.2s tps=39.9)
|
||
|
||
======================================================================
|
||
Q02 [recall]
|
||
In enzyme kinetics, what does the Haldane relationship connect?
|
||
|
||
ANSWER:
|
||
The **Haldane relationship** in enzyme kinetics connects the **equilibrium constant** of a reaction to the **ratio of the forward and reverse catalytic constants** (k<sub>cat</sub> values) of the enzyme, under the assumption of **rapid equilibrium** and **Michaelis-Menten kinetics**.
|
||
|
||
More precisely, the Haldane relationship expresses the connection between:
|
||
|
||
- The **thermodynamic equilibrium constant** (K<sub>eq</sub>) of the reaction,
|
||
- The **Michaelis constants** (K<sub>M</sub>) for the substrates and products,
|
||
- The **catalytic constants** (k<sub>cat</sub><sup>f</sup> and k<sub>cat</sub><sup>r</sup>) for the forward and reverse reactions.
|
||
|
||
For a general reversible reaction:
|
||
|
||
> A + B ⇌ C + D
|
||
|
||
The Haldane relationship is:
|
||
|
||
\[
|
||
K_{eq} = \frac{k_{cat}^f / K_{M,A} \cdot K_{M,B}}{k_{cat}^r / K_{M,C} \cdot K_{M,D}}
|
||
\]
|
||
|
||
Or, rearranged:
|
||
|
||
\[
|
||
\frac{k_{cat}^f}{k_{cat}^r} = K_{eq} \cdot \frac{K_{M,C} \cdot K_{M,D}}{K_{M,A} \cdot K_{M,B}}
|
||
\]
|
||
|
||
### Key Insight:
|
||
The Haldane relationship shows that **the ratio of the forward to reverse catalytic rates is not independent** of the enzyme’s affinity for substrates and products — it is **constrained by thermodynamics**. This is a consequence of microscopic reversibility and detailed balance.
|
||
|
||
It is named after **J.B.S. Haldane**, who derived it in the 1930s to reconcile enzyme kinetics with thermodynamic principles.
|
||
|
||
### Why it matters:
|
||
- It allows prediction of reverse kinetic parameters from forward ones (and vice versa) if K<sub>eq</sub> is known.
|
||
- It ensures that enzyme kinetics are thermodynamically consistent.
|
||
- It is foundational in metabolic modeling and systems biology.
|
||
|
||
✅ **Final Answer**:
|
||
The Haldane relationship connects the **equilibrium constant** of a reaction to the **ratios of the catalytic constants (k<sub>cat</sub>) and Michaelis constants (K<sub>M</sub>)** for the substrates and products in enzyme-catalyzed reversible reactions.
|
||
|
||
EXPECTED (judge only): Relates the equilibrium constant of a reversible enzyme reaction to its kinetic constants: Keq = (Vf*Kmr)/(Vr*Kmf), tying forward/reverse kcat and Km to thermodynamic equilibrium.
|
||
(finish=stop tokens=516 time=13.3s tps=39.8)
|
||
|
||
======================================================================
|
||
Q03 [recall]
|
||
Who was Hypatia of Alexandria and roughly when did she die?
|
||
|
||
ANSWER:
|
||
Hypatia of Alexandria was a prominent Greek Neoplatonist philosopher, mathematician, and astronomer who lived in late 4th and early 5th century CE Alexandria, Egypt, which was then part of the Roman Empire. She was the daughter of Theon of Alexandria, a mathematician and scholar, and she became the head of the Platonist school in Alexandria, where she taught philosophy and astronomy. Hypatia was renowned for her intellect, her public lectures, and her ability to explain complex mathematical and philosophical ideas. She is one of the earliest known female scientists and philosophers in recorded history.
|
||
|
||
Hypatia died in March 415 CE. She was murdered by a mob of Christian zealots, possibly incited by political and religious tensions between the Christian bishop Cyril of Alexandria and the Roman prefect Orestes, with whom Hypatia was associated. Her death was a violent and tragic event, often cited as a symbol of the decline of classical learning and the rise of religious intolerance in late antiquity.
|
||
|
||
Her death marked a turning point in the intellectual history of Alexandria and has since made her an enduring symbol of reason, scholarship, and the persecution of women in science and philosophy.
|
||
|
||
**Final Answer:** Hypatia of Alexandria was a renowned philosopher, mathematician, and astronomer who died in March 415 CE.
|
||
|
||
EXPECTED (judge only): Neoplatonist philosopher/mathematician/astronomer in Alexandria; murdered by a Christian mob around 415 CE.
|
||
(finish=stop tokens=278 time=7.3s tps=39.8)
|
||
|
||
======================================================================
|
||
Q04 [recall]
|
||
What is the Gershgorin circle theorem used for?
|
||
|
||
ANSWER:
|
||
The **Gershgorin Circle Theorem** is a result in linear algebra used to **estimate the location of eigenvalues** of a square matrix in the complex plane.
|
||
|
||
### What it does:
|
||
Given an $ n \times n $ complex matrix $ A = [a_{ij}] $, the theorem states that **every eigenvalue** of $ A $ lies within **at least one** of the **Gershgorin discs**.
|
||
|
||
Each disc $ D_i $ is centered at the diagonal entry $ a_{ii} $, and has a radius equal to the sum of the absolute values of the off-diagonal entries in row $ i $:
|
||
|
||
$$
|
||
D_i = \left\{ z \in \mathbb{C} : |z - a_{ii}| \leq \sum_{j \neq i} |a_{ij}| \right\}
|
||
$$
|
||
|
||
### Purpose and Uses:
|
||
1. **Eigenvalue localization**: It provides a quick, easy way to bound the eigenvalues without computing them explicitly — useful when exact eigenvalues are hard to find.
|
||
2. **Qualitative analysis**: Helps determine if all eigenvalues lie in the left half-plane (for stability analysis in dynamical systems), or if they are real (if all discs lie on the real line).
|
||
3. **Diagonal dominance**: If a matrix is strictly diagonally dominant (i.e., $ |a_{ii}| > \sum_{j \neq i} |a_{ij}| $ for all $ i $), then all Gershgorin discs do not contain the origin → all eigenvalues are non-zero → matrix is invertible.
|
||
4. **Numerical linear algebra**: Used as a preliminary tool in algorithms to estimate spectral properties before more expensive computations.
|
||
|
||
### Important Notes:
|
||
- The theorem gives **bounds**, not exact values.
|
||
- Eigenvalues may lie in the union of the discs, but not necessarily in every disc.
|
||
- Sometimes, combining row and column discs (a variant) gives tighter bounds.
|
||
|
||
### Example Use Case:
|
||
In engineering or physics, when analyzing the stability of a system modeled by a matrix, Gershgorin’s theorem can quickly tell you whether all eigenvalues have negative real parts (stable) without solving the characteristic polynomial.
|
||
|
||
---
|
||
|
||
**Final Answer**:
|
||
The Gershgorin Circle Theorem is used to estimate the location of eigenvalues of a square matrix by providing discs in the complex plane, each centered at a diagonal entry, such that every eigenvalue lies within at least one of these discs. It is a valuable tool for qualitative analysis, stability assessment, and avoiding direct computation of eigenvalues.
|
||
|
||
EXPECTED (judge only): Bounds the location of eigenvalues of a square matrix: every eigenvalue lies within at least one Gershgorin disc centered at a diagonal entry with radius equal to the sum of absolute off-diagonal entries in that row.
|
||
(finish=stop tokens=536 time=13.7s tps=39.9)
|
||
|
||
======================================================================
|
||
Q05 [recall]
|
||
In RF engineering, what is the difference between the noise figure and noise temperature of a device, and how are they related?
|
||
|
||
ANSWER:
|
||
In RF engineering, **noise figure (NF)** and **noise temperature (T<sub>n</sub>)** are two related but distinct ways to quantify how much a device (such as an amplifier, mixer, or receiver) degrades the signal-to-noise ratio (SNR) of a signal passing through it. Both describe the added noise introduced by the device, but they are expressed in different units and are used in different contexts.
|
||
|
||
---
|
||
|
||
### **1. Noise Figure (NF)**
|
||
|
||
- **Definition**: Noise figure is the **ratio** (in linear terms) of the input SNR to the output SNR of a device, expressed in **decibels (dB)**.
|
||
|
||
\[
|
||
\text{NF} = 10 \log_{10} \left( \frac{\text{SNR}_{\text{in}}}{\text{SNR}_{\text{out}}} \right) \quad \text{(in dB)}
|
||
\]
|
||
|
||
- **Physical meaning**: It tells you how much the device degrades the SNR. An ideal noiseless device has NF = 0 dB. Real devices have NF > 0 dB.
|
||
|
||
- **Reference**: Noise figure is defined assuming the input noise is from a **standard noise source at 290 K** (room temperature, 17°C), which corresponds to the thermal noise power density \( kT_0 \), where:
|
||
- \( k \) = Boltzmann’s constant (\(1.38 \times 10^{-23} \, \text{J/K}\))
|
||
- \( T_0 = 290 \, \text{K} \)
|
||
|
||
- **Use case**: Commonly used in system specifications, datasheets, and communication standards because it’s intuitive and directly relates to SNR degradation.
|
||
|
||
---
|
||
|
||
### **2. Noise Temperature (T<sub>n</sub>)**
|
||
|
||
- **Definition**: Noise temperature is the **equivalent temperature** (in Kelvin) that a resistor would need to be at to produce the same amount of excess noise power as the device under test, when connected to a noise-free source at reference temperature \( T_0 \).
|
||
|
||
- **Physical meaning**: It represents the **additional noise power** the device adds, expressed as if it were thermal noise from a resistor at temperature \( T_n \).
|
||
|
||
- **Reference**: Unlike noise figure, noise temperature is **not tied to 290 K** in its definition — it’s an absolute measure of noise power. However, it is often referenced to the same \( T_0 = 290 \, \text{K} \) for consistency.
|
||
|
||
- **Use case**: Preferred in **low-noise systems** (e.g., satellite receivers, radio astronomy) and when cascading components, because noise temperature adds linearly (unlike noise figure, which requires more complex calculations).
|
||
|
||
---
|
||
|
||
### **3. Relationship Between Noise Figure and Noise Temperature**
|
||
|
||
The two are **mathematically related** via the reference temperature \( T_0 = 290 \, \text{K} \):
|
||
|
||
\[
|
||
T_n = T_0 \cdot (F - 1)
|
||
\]
|
||
|
||
Where:
|
||
- \( T_n \) = noise temperature (K)
|
||
- \( T_0 = 290 \, \text{K} \)
|
||
- \( F \) = noise factor (linear, not in dB) = \( 10^{\text{NF}/10} \)
|
||
|
||
So, rearranged:
|
||
|
||
\[
|
||
F = 1 + \frac{T_n}{T_0}
|
||
\]
|
||
|
||
And in decibels:
|
||
|
||
\[
|
||
\text{NF (dB)} = 10 \log_{10} \left(1 + \frac{T_n}{290}\right)
|
||
\]
|
||
|
||
---
|
||
|
||
### **Example**
|
||
|
||
Suppose a low-noise amplifier (LNA) has a noise temperature of 50 K.
|
||
|
||
Then:
|
||
|
||
\[
|
||
F = 1 + \frac{50}{290} \approx 1.172
|
||
\]
|
||
\[
|
||
\text{NF} = 10 \log_{10}(1.172) \approx 0.69 \, \text{dB}
|
||
\]
|
||
|
||
So, a very low noise temperature corresponds to a very low noise figure.
|
||
|
||
---
|
||
|
||
### **Key Differences Summary**
|
||
|
||
| Feature | Noise Figure (NF) | Noise Temperature (T<sub>n</sub>) |
|
||
|--------|-------------------|----------------------------------|
|
||
| **Units** | dB (dimensionless ratio) | Kelvin (K) |
|
||
| **Reference** | Always referenced to 290 K input noise | Absolute measure; can be used independently |
|
||
| **Additivity** | Not additive (requires Friis formula) | Additive in cascade (simpler for multi-stage systems) |
|
||
| **Use Cases** | General RF systems, datasheets | Cryogenic systems, radio astronomy, cascade analysis |
|
||
| **Ideal Value** | 0 dB | 0 K |
|
||
|
||
---
|
||
|
||
### **Conclusion**
|
||
|
||
- **Noise figure** is a **relative, logarithmic measure** of SNR degradation referenced to 290 K.
|
||
- **Noise temperature** is an **absolute, linear measure** of the noise power added by the device, expressed as an equivalent temperature.
|
||
- They are **interchangeable** via the formula \( T_n = 290 \cdot (F - 1) \), and the choice between them depends on context: **noise temperature is preferred for theoretical and cascade analysis**, while **noise figure is standard in practical specifications**.
|
||
|
||
Both are essential tools in designing low-noise RF systems.
|
||
|
||
EXPECTED (judge only): Both quantify added noise; related by F = 1 + Te/T0 (T0=290K), equivalently Te = T0*(F-1). NF is 10log10(F) in dB.
|
||
(finish=stop tokens=1173 time=29.8s tps=39.8)
|
||
|
||
======================================================================
|
||
Q06 [recall]
|
||
What is the Antikythera mechanism and what did it do?
|
||
|
||
ANSWER:
|
||
The **Antikythera mechanism** is an ancient Greek analog device, often described as the world’s first known mechanical computer. It was designed to calculate and display astronomical information, including the positions of celestial bodies, lunar and solar eclipses, and the cycles of the Olympic Games.
|
||
|
||
### Discovery:
|
||
- It was discovered in 1901 in a shipwreck off the coast of the Greek island of Antikythera.
|
||
- The wreck dates to around 60–70 BCE, and the mechanism itself is believed to have been constructed between 150–100 BCE, possibly based on earlier designs.
|
||
|
||
### What it did:
|
||
The Antikythera mechanism was a complex system of at least 30 bronze gears housed in a wooden case, with dials and inscriptions on the front and back. It functioned as a predictive model of the solar system, using gear trains to simulate the irregular motions of the Moon and Sun (accounting for Kepler’s later discoveries about elliptical orbits, though the Greeks used epicycles).
|
||
|
||
Key functions included:
|
||
1. **Tracking the positions of the Sun and Moon** across the zodiac.
|
||
2. **Predicting lunar and solar eclipses** with remarkable accuracy, using the 19-year Metonic cycle and the 223-month Saros cycle.
|
||
3. **Modeling the Moon’s elliptical orbit** (via a pin-and-slot mechanism), which accounted for its varying speed — a sophisticated astronomical insight.
|
||
4. **Displaying the dates of ancient Greek athletic games**, including the Olympic Games, on a secondary dial.
|
||
5. Possibly tracking the positions of the five known planets (Mercury, Venus, Mars, Jupiter, Saturn), though evidence for planetary gears is fragmentary and debated.
|
||
|
||
### Significance:
|
||
- The mechanism demonstrates that ancient Greek engineers had an advanced understanding of astronomy and mechanical engineering — far beyond what was previously assumed for the time.
|
||
- No similar devices of comparable complexity are known to have existed for over a millennium afterward.
|
||
- It challenges the notion that complex mechanical technology only emerged during the European Renaissance.
|
||
|
||
### Modern Research:
|
||
Using X-ray tomography and advanced imaging, researchers have reconstructed its internal structure and decoded many of its inscriptions. It is now widely regarded as a masterpiece of ancient science and technology.
|
||
|
||
**Final Answer:**
|
||
The Antikythera mechanism was an ancient Greek analog computer, built around 150–100 BCE, that used a system of bronze gears to predict astronomical events such as eclipses, track the positions of the Sun and Moon, and display the cycle of the Olympic Games. It represents an extraordinary level of scientific and engineering sophistication in the ancient world.
|
||
|
||
EXPECTED (judge only): Ancient Greek geared analog device (~2nd c. BCE) for predicting astronomical positions, eclipses, and calendrical/Olympiad cycles.
|
||
(finish=stop tokens=552 time=14.2s tps=39.9)
|
||
|
||
======================================================================
|
||
Q07 [recall]
|
||
What does the CAP theorem state in distributed systems?
|
||
|
||
ANSWER:
|
||
The **CAP theorem** (also known as **Brewer’s theorem**) states that in a distributed data system, it is impossible to simultaneously guarantee all three of the following properties:
|
||
|
||
1. **Consistency** – Every read receives the most recent write or an error.
|
||
2. **Availability** – Every request receives a (non-error) response, without guarantee that it contains the most recent write.
|
||
3. **Partition tolerance** – The system continues to operate despite arbitrary message loss or failure (network partitions).
|
||
|
||
### Key Insight:
|
||
The CAP theorem asserts that **a distributed system can only guarantee two out of these three properties at any given time**.
|
||
|
||
- **CA** (Consistency + Availability): Not possible in a real-world distributed system with network partitions — because if the network fails (partition occurs), you cannot maintain both consistency and availability without communication.
|
||
- **CP** (Consistency + Partition tolerance): Prioritize consistency and tolerate partitions. If a partition occurs, the system may refuse requests to avoid inconsistency (e.g., databases like ZooKeeper, HBase).
|
||
- **AP** (Availability + Partition tolerance): Prioritize availability and tolerate partitions. The system continues to respond even if data may be stale (e.g., DNS, Cassandra, Dynamo).
|
||
|
||
### Important Clarifications:
|
||
- **Partition tolerance is unavoidable** in distributed systems over networks. Networks are inherently unreliable, so any practical distributed system must be partition-tolerant.
|
||
- Therefore, the real trade-off is usually between **Consistency** and **Availability** during network partitions.
|
||
- The CAP theorem applies to **shared-data systems** (e.g., distributed databases), not all distributed systems (e.g., message queues or compute clusters without shared state may not be subject to CAP).
|
||
|
||
### Common Misconception:
|
||
CAP is often oversimplified as “you can only pick two,” but it’s more precise to say: **When a network partition occurs, you must choose between consistency and availability**. In the absence of partitions, you can have both consistency and availability.
|
||
|
||
### Origin:
|
||
Proposed by Eric Brewer in 2000 and formally proven by Seth Gilbert and Nancy Lynch in 2002.
|
||
|
||
---
|
||
|
||
**Final Answer**:
|
||
The CAP theorem states that in a distributed system, it is impossible to simultaneously provide all three of Consistency, Availability, and Partition Tolerance — you can only guarantee two of the three at any given time. Since network partitions are inevitable in distributed systems, the practical choice is between Consistency and Availability during such events.
|
||
|
||
EXPECTED (judge only): A distributed data store cannot simultaneously guarantee all three of Consistency, Availability, and Partition tolerance; under a partition you must trade consistency vs availability.
|
||
(finish=stop tokens=509 time=13.0s tps=39.9)
|
||
|
||
======================================================================
|
||
Q08 [recall]
|
||
What is Cherenkov radiation and what condition produces it?
|
||
|
||
ANSWER:
|
||
Cherenkov radiation is a type of electromagnetic radiation emitted when a charged particle (such as an electron) travels through a dielectric medium (like water, glass, or air) at a speed greater than the phase velocity of light in that medium.
|
||
|
||
### Step-by-step explanation:
|
||
|
||
1. **Speed of light in a medium**:
|
||
The speed of light in a vacuum is approximately $ c = 3 \times 10^8 \, \text{m/s} $. In a medium with refractive index $ n $, the speed of light is reduced to $ c/n $. For example, in water ($ n \approx 1.33 $), light travels at about $ 0.75c $.
|
||
|
||
2. **Charged particles can exceed this speed**:
|
||
While no particle can exceed $ c $ in vacuum, it *is* possible for high-energy charged particles (e.g., electrons from nuclear reactors or cosmic rays) to travel faster than $ c/n $ in a medium — without violating relativity, since they’re still slower than $ c $.
|
||
|
||
3. **Electromagnetic shockwave**:
|
||
When a charged particle moves faster than the phase velocity of light in the medium, it polarizes the atoms along its path. These polarized atoms then return to their ground state, emitting photons coherently. This creates a shockwave of light — analogous to a sonic boom, but with light.
|
||
|
||
4. **Characteristics of Cherenkov radiation**:
|
||
- It is typically blue or ultraviolet in color (because shorter wavelengths are emitted more intensely).
|
||
- It is emitted in a cone-shaped pattern at an angle $ \theta $ given by:
|
||
$$
|
||
\cos\theta = \frac{c}{n v}
|
||
$$
|
||
where $ v $ is the particle’s speed.
|
||
- It is continuous in spectrum (unlike fluorescence or atomic emission lines).
|
||
|
||
### Condition that produces Cherenkov radiation:
|
||
> **A charged particle must travel through a dielectric medium at a speed greater than the phase velocity of light in that medium** — i.e., $ v > \frac{c}{n} $.
|
||
|
||
### Common examples:
|
||
- The characteristic blue glow in the water surrounding nuclear reactor cores (due to high-energy electrons from beta decay).
|
||
- Detection of cosmic rays or neutrinos in large water or ice detectors like Super-Kamiokande or IceCube.
|
||
|
||
### Important note:
|
||
Cherenkov radiation does **not** occur in a vacuum, because nothing can travel faster than $ c $, and $ c/n > c $ is impossible in vacuum ($ n = 1 $).
|
||
|
||
---
|
||
|
||
**Final Answer**:
|
||
Cherenkov radiation is the electromagnetic radiation emitted when a charged particle travels through a dielectric medium faster than the phase velocity of light in that medium. The condition for its production is: **the particle’s speed must exceed $ c/n $, where $ c $ is the speed of light in vacuum and $ n $ is the refractive index of the medium**.
|
||
|
||
EXPECTED (judge only): Light emitted when a charged particle travels through a medium faster than the phase velocity of light in that medium (v > c/n); produces the characteristic blue glow, emitted at a cone angle cos(theta)=1/(n*beta).
|
||
(finish=stop tokens=622 time=15.9s tps=39.9)
|
||
|
||
======================================================================
|
||
Q09 [reason]
|
||
A 12-bit ADC has a full-scale range of 0 to 3.3 V. What is its voltage resolution (LSB size) in millivolts? Show the calculation.
|
||
|
||
ANSWER:
|
||
To find the **voltage resolution** (also called the **LSB size**) of an Analog-to-Digital Converter (ADC), we use the formula:
|
||
|
||
$$
|
||
\text{Voltage Resolution (LSB)} = \frac{\text{Full-Scale Range}}{2^n - 1}
|
||
$$
|
||
|
||
Where:
|
||
- **Full-Scale Range** is the maximum voltage range the ADC can measure (in volts),
|
||
- **n** is the number of bits of the ADC.
|
||
|
||
> ✅ **Note**: Some sources use $2^n$ instead of $2^n - 1$, depending on whether the ADC is considered to have $2^n$ levels (including 0) or $2^n - 1$ steps between 0 and full scale.
|
||
> However, **for voltage resolution (LSB size)** in most engineering contexts — especially when the ADC output ranges from 0 to $2^n - 1$ — we use **$2^n - 1$** steps to divide the full-scale range.
|
||
|
||
---
|
||
|
||
### Given:
|
||
- ADC resolution: 12 bits → $n = 12$
|
||
- Full-scale range: 0 to 3.3 V → Range = 3.3 V
|
||
|
||
### Step 1: Compute total number of discrete levels
|
||
$$
|
||
2^{12} = 4096 \text{ possible digital codes (from 0 to 4095)}
|
||
$$
|
||
|
||
So, the number of **intervals** (steps) between levels is:
|
||
$$
|
||
2^{12} - 1 = 4095
|
||
$$
|
||
|
||
### Step 2: Compute LSB size (voltage per step)
|
||
$$
|
||
\text{LSB} = \frac{3.3\ \text{V}}{4095}
|
||
$$
|
||
|
||
Now calculate:
|
||
|
||
$$
|
||
\frac{3.3}{4095} \approx 0.00080586\ \text{V}
|
||
$$
|
||
|
||
Convert to millivolts (multiply by 1000):
|
||
|
||
$$
|
||
0.00080586 \times 1000 \approx 0.80586\ \text{mV}
|
||
$$
|
||
|
||
### ✅ Final Answer:
|
||
$$
|
||
\boxed{0.806\ \text{mV}} \quad \text{(rounded to three decimal places)}
|
||
$$
|
||
|
||
---
|
||
|
||
### Optional Note:
|
||
Some systems approximate using $2^n$ instead of $2^n - 1$, giving:
|
||
|
||
$$
|
||
\frac{3.3}{4096} \approx 0.00080566\ \text{V} = 0.806\ \text{mV}
|
||
$$
|
||
|
||
This gives the **same value when rounded to three decimal places**. So in practice, both are often used interchangeably for 12-bit ADCs, but **technically**, the correct formula for LSB size (voltage per step) is:
|
||
|
||
$$
|
||
\boxed{\frac{V_{\text{ref}}}{2^n - 1}}
|
||
$$
|
||
|
||
Thus, the **most accurate answer** is:
|
||
|
||
> **Voltage resolution (LSB) = 0.806 mV**
|
||
|
||
EXPECTED (judge only): 3.3 V / 2^12 = 3.3/4096 = 0.0008056 V = about 0.806 mV.
|
||
(finish=stop tokens=676 time=17.4s tps=39.7)
|
||
|
||
======================================================================
|
||
Q10 [reason]
|
||
A geostationary satellite orbits at ~35,786 km altitude. Earth's radius is ~6,378 km. Ignoring atmosphere, what is the approximate one-way line-of-sight propagation delay from a ground station directly below it to the satellite, in milliseconds?
|
||
|
||
ANSWER:
|
||
To find the **one-way line-of-sight propagation delay** from a ground station directly below a geostationary satellite to the satellite, we need to calculate the **distance** from the ground station to the satellite, then divide by the **speed of light** to get the time delay.
|
||
|
||
---
|
||
|
||
### Step 1: Determine the distance from ground station to satellite
|
||
|
||
The satellite is in **geostationary orbit**, which means it orbits directly above the equator, and the ground station is directly below it (i.e., on the equator).
|
||
|
||
- Earth’s radius: $ R_{\text{earth}} = 6,378 $ km
|
||
- Satellite altitude: $ h = 35,786 $ km
|
||
|
||
So, the **straight-line distance** from the ground station to the satellite is just the altitude, because the ground station is directly beneath it:
|
||
|
||
$$
|
||
d = h = 35,786 \text{ km}
|
||
$$
|
||
|
||
> ✅ Note: Since the ground station is directly below the satellite, the line-of-sight distance is simply the altitude — we don’t need to use the Pythagorean theorem here (that would be needed if the ground station were off to the side).
|
||
|
||
---
|
||
|
||
### Step 2: Speed of light
|
||
|
||
The speed of light in vacuum is:
|
||
|
||
$$
|
||
c = 299,792 \text{ km/s} \approx 3 \times 10^5 \text{ km/s}
|
||
$$
|
||
|
||
We’ll use the precise value for accuracy.
|
||
|
||
---
|
||
|
||
### Step 3: Calculate propagation delay
|
||
|
||
$$
|
||
\text{Delay} = \frac{d}{c} = \frac{35,786 \text{ km}}{299,792 \text{ km/s}}
|
||
$$
|
||
|
||
Let’s compute that:
|
||
|
||
$$
|
||
\frac{35,786}{299,792} \approx 0.11937 \text{ seconds}
|
||
$$
|
||
|
||
Convert to **milliseconds**:
|
||
|
||
$$
|
||
0.11937 \times 1000 \approx 119.37 \text{ ms}
|
||
$$
|
||
|
||
---
|
||
|
||
### ✅ Final Answer:
|
||
|
||
**Approximately 119 milliseconds**
|
||
|
||
---
|
||
|
||
### Additional Note:
|
||
|
||
Sometimes people mistakenly think the distance is Earth’s radius + altitude, but that’s the **distance from Earth’s center to satellite**. The **line-of-sight from ground station to satellite** is just the altitude when the station is directly below — because the Earth’s curvature doesn’t add extra distance in this direct vertical case.
|
||
|
||
So, **yes**, 35,786 km is the correct distance.
|
||
|
||
---
|
||
|
||
### ✅ Final Answer: **119 ms**
|
||
|
||
EXPECTED (judge only): Distance ~= 35,786 km; delay = 35,786e3 / 3e8 = ~0.1193 s = about 119 ms. (Directly below, slant range = altitude.)
|
||
(finish=stop tokens=574 time=14.8s tps=39.9)
|
||
|
||
======================================================================
|
||
Q11 [reason]
|
||
If a signal has an SNR of 20 dB and a bandwidth of 1 MHz, what is the approximate Shannon channel capacity in Mbps? Show your steps.
|
||
|
||
ANSWER:
|
||
We are given:
|
||
|
||
- Signal-to-Noise Ratio (SNR) = 20 dB
|
||
- Bandwidth (B) = 1 MHz = 1 × 10⁶ Hz
|
||
|
||
We are to find the **Shannon channel capacity** in Mbps using the **Shannon-Hartley theorem**:
|
||
|
||
\[
|
||
C = B \log_2(1 + \text{SNR})
|
||
\]
|
||
|
||
where:
|
||
- \( C \) is the channel capacity in bits per second (bps),
|
||
- \( B \) is the bandwidth in Hz,
|
||
- \( \text{SNR} \) is the **linear** (not dB) signal-to-noise ratio.
|
||
|
||
---
|
||
|
||
### Step 1: Convert SNR from dB to linear scale
|
||
|
||
The formula to convert from dB to linear is:
|
||
|
||
\[
|
||
\text{SNR}_{\text{linear}} = 10^{\frac{\text{SNR}_{\text{dB}}}{10}}
|
||
\]
|
||
|
||
Plug in SNR = 20 dB:
|
||
|
||
\[
|
||
\text{SNR}_{\text{linear}} = 10^{\frac{20}{10}} = 10^2 = 100
|
||
\]
|
||
|
||
So, the linear SNR is **100**.
|
||
|
||
---
|
||
|
||
### Step 2: Apply Shannon-Hartley formula
|
||
|
||
\[
|
||
C = B \log_2(1 + \text{SNR}) = 1 \times 10^6 \times \log_2(1 + 100) = 10^6 \times \log_2(101)
|
||
\]
|
||
|
||
Now compute \( \log_2(101) \).
|
||
|
||
We know that:
|
||
|
||
\[
|
||
\log_2(101) = \frac{\log_{10}(101)}{\log_{10}(2)} \approx \frac{2.0043}{0.3010} \approx 6.658
|
||
\]
|
||
|
||
(You can verify: \( 2^{6.658} \approx 101 \))
|
||
|
||
So,
|
||
|
||
\[
|
||
C \approx 10^6 \times 6.658 = 6,658,000 \text{ bps}
|
||
\]
|
||
|
||
---
|
||
|
||
### Step 3: Convert to Mbps
|
||
|
||
\[
|
||
C \approx \frac{6,658,000}{10^6} = 6.658 \text{ Mbps}
|
||
\]
|
||
|
||
---
|
||
|
||
### ✅ Final Answer:
|
||
|
||
\[
|
||
\boxed{6.66} \text{ Mbps} \quad \text{(approximately)}
|
||
\]
|
||
|
||
So, the approximate Shannon channel capacity is **6.66 Mbps**.
|
||
|
||
EXPECTED (judge only): SNR linear = 10^(20/10)=100. C = 1e6 * log2(1+100) = 1e6 * log2(101) = 1e6 * 6.658 = ~6.66 Mbps.
|
||
(finish=stop tokens=576 time=14.8s tps=39.8)
|
||
|
||
======================================================================
|
||
Q12 [reason]
|
||
You have three resistors: 100, 220, and 330 ohms. Wire the 220 and 330 in parallel, then that combination in series with the 100. What is the total resistance? Show the steps.
|
||
|
||
ANSWER:
|
||
We are given three resistors:
|
||
- R₁ = 100 Ω
|
||
- R₂ = 220 Ω
|
||
- R₃ = 330 Ω
|
||
|
||
The configuration is:
|
||
**Connect R₂ (220 Ω) and R₃ (330 Ω) in parallel**, then connect that **parallel combination in series with R₁ (100 Ω)**.
|
||
|
||
We need to find the **total resistance** of the circuit.
|
||
|
||
---
|
||
|
||
### Step 1: Calculate the equivalent resistance of the parallel combination (220 Ω and 330 Ω)
|
||
|
||
The formula for two resistors in parallel is:
|
||
|
||
\[
|
||
R_{\text{parallel}} = \frac{R_2 \cdot R_3}{R_2 + R_3}
|
||
\]
|
||
|
||
Plug in the values:
|
||
|
||
\[
|
||
R_{\text{parallel}} = \frac{220 \cdot 330}{220 + 330}
|
||
\]
|
||
|
||
First, calculate numerator:
|
||
|
||
\[
|
||
220 \cdot 330 = 72,600
|
||
\]
|
||
|
||
Then denominator:
|
||
|
||
\[
|
||
220 + 330 = 550
|
||
\]
|
||
|
||
Now divide:
|
||
|
||
\[
|
||
R_{\text{parallel}} = \frac{72,600}{550} = 132 \, \Omega
|
||
\]
|
||
|
||
✅ So, the equivalent resistance of the 220 Ω and 330 Ω in parallel is **132 Ω**.
|
||
|
||
---
|
||
|
||
### Step 2: Add this in series with the 100 Ω resistor
|
||
|
||
Series resistance is simply the sum:
|
||
|
||
\[
|
||
R_{\text{total}} = R_1 + R_{\text{parallel}} = 100 + 132 = 232 \, \Omega
|
||
\]
|
||
|
||
---
|
||
|
||
### ✅ Final Answer: **232 ohms**
|
||
|
||
EXPECTED (judge only): 220||330 = (220*330)/(550) = 72600/550 = 132 ohms. Series with 100 = 232 ohms.
|
||
(finish=stop tokens=418 time=11.0s tps=39.6)
|
||
|
||
======================================================================
|
||
Q13 [reason]
|
||
A recipe scales linearly. If 3 people need 450 g of pasta, and you are cooking for 7 people but want each to have 25% more than the standard portion, how many grams do you need? Show the steps.
|
||
|
||
ANSWER:
|
||
We are told that a recipe scales linearly. Let’s break this down step by step.
|
||
|
||
---
|
||
|
||
### **Step 1: Find the standard portion per person**
|
||
|
||
We are told that **3 people need 450 g** of pasta.
|
||
|
||
So, the standard portion per person is:
|
||
|
||
$$
|
||
\frac{450\ \text{g}}{3} = 150\ \text{g per person}
|
||
$$
|
||
|
||
---
|
||
|
||
### **Step 2: Increase the portion by 25%**
|
||
|
||
You want **each person to have 25% more** than the standard portion.
|
||
|
||
So, calculate 25% of 150 g:
|
||
|
||
$$
|
||
25\% \text{ of } 150 = 0.25 \times 150 = 37.5\ \text{g}
|
||
$$
|
||
|
||
Add that to the standard portion:
|
||
|
||
$$
|
||
150 + 37.5 = 187.5\ \text{g per person}
|
||
$$
|
||
|
||
---
|
||
|
||
### **Step 3: Multiply by the number of people (7)**
|
||
|
||
Now, for 7 people, each getting 187.5 g:
|
||
|
||
$$
|
||
7 \times 187.5 = ?
|
||
$$
|
||
|
||
Let’s compute that:
|
||
|
||
$$
|
||
7 \times 187.5 = 7 \times (180 + 7.5) = (7 \times 180) + (7 \times 7.5) = 1260 + 52.5 = 1312.5\ \text{g}
|
||
$$
|
||
|
||
---
|
||
|
||
### ✅ **Final Answer: 1312.5 grams**
|
||
|
||
You need **1312.5 grams** of pasta to serve 7 people with 25% more than the standard portion.
|
||
|
||
EXPECTED (judge only): Standard per person = 450/3 = 150 g. With 25% more = 187.5 g each. For 7 = 1312.5 g.
|
||
(finish=stop tokens=390 time=10.2s tps=39.9)
|
||
|
||
======================================================================
|
||
Q14 [reason]
|
||
A car depreciates 15% per year from an initial value of $30,000. What is its value after 3 years, to the nearest dollar? Show the steps.
|
||
|
||
ANSWER:
|
||
We are told that a car depreciates **15% per year** from an initial value of **$30,000**, and we need to find its value after **3 years**, to the nearest dollar.
|
||
|
||
---
|
||
|
||
### Step 1: Understand depreciation
|
||
Depreciation of 15% per year means that each year, the car retains **85%** of its value from the previous year.
|
||
|
||
That is:
|
||
> **Value after 1 year** = Initial value × 0.85
|
||
> **Value after 2 years** = Initial value × (0.85)²
|
||
> **Value after 3 years** = Initial value × (0.85)³
|
||
|
||
This is an example of **exponential decay**.
|
||
|
||
---
|
||
|
||
### Step 2: Plug in the numbers
|
||
|
||
Initial value = $30,000
|
||
Depreciation factor per year = 0.85
|
||
Number of years = 3
|
||
|
||
So,
|
||
|
||
$$
|
||
\text{Value after 3 years} = 30000 \times (0.85)^3
|
||
$$
|
||
|
||
First, calculate $ 0.85^3 $:
|
||
|
||
$$
|
||
0.85 \times 0.85 = 0.7225
|
||
$$
|
||
$$
|
||
0.7225 \times 0.85 = ?
|
||
$$
|
||
|
||
Let’s compute that:
|
||
|
||
$$
|
||
0.7225 \times 0.85 = (0.7225 \times 0.8) + (0.7225 \times 0.05)
|
||
$$
|
||
$$
|
||
= 0.578 + 0.036125 = 0.614125
|
||
$$
|
||
|
||
So,
|
||
|
||
$$
|
||
\text{Value after 3 years} = 30000 \times 0.614125 = ?
|
||
$$
|
||
|
||
Now multiply:
|
||
|
||
$$
|
||
30000 \times 0.614125 = 30000 \times \frac{614125}{1000000}
|
||
$$
|
||
|
||
Or more simply:
|
||
|
||
$$
|
||
30000 \times 0.614125 = 18423.75
|
||
$$
|
||
|
||
---
|
||
|
||
### Step 3: Round to the nearest dollar
|
||
|
||
$$
|
||
18423.75 \rightarrow \boxed{18424}
|
||
$$
|
||
|
||
---
|
||
|
||
### ✅ Final Answer: **$18,424**
|
||
|
||
EXPECTED (judge only): 30000 * 0.85^3 = 30000 * 0.614125 = $18,423.75, about $18,424.
|
||
(finish=stop tokens=545 time=14.0s tps=39.9)
|
||
|
||
======================================================================
|
||
Q15 [reason]
|
||
In a 5G NR system with 30 kHz subcarrier spacing, how many subcarriers fit in a 20 MHz channel if guard bands consume about 1 MHz total? Approximate, show steps.
|
||
|
||
ANSWER:
|
||
Let’s solve this step by step.
|
||
|
||
---
|
||
|
||
### **Given:**
|
||
- **Channel bandwidth**: 20 MHz
|
||
- **Guard bands**: 1 MHz total (combined on both sides)
|
||
- **Subcarrier spacing (SCS)**: 30 kHz
|
||
- We need to find: **Number of subcarriers that fit in the usable bandwidth**
|
||
|
||
---
|
||
|
||
### **Step 1: Calculate usable bandwidth**
|
||
The total channel is 20 MHz, but 1 MHz is used for guard bands.
|
||
|
||
So, **usable bandwidth** = Total bandwidth − Guard bands
|
||
= 20 MHz − 1 MHz
|
||
= **19 MHz**
|
||
|
||
---
|
||
|
||
### **Step 2: Convert usable bandwidth to kHz**
|
||
19 MHz = 19 × 1000 = **19,000 kHz**
|
||
|
||
---
|
||
|
||
### **Step 3: Divide usable bandwidth by subcarrier spacing**
|
||
Each subcarrier occupies 30 kHz.
|
||
|
||
Number of subcarriers = Usable bandwidth (kHz) ÷ Subcarrier spacing (kHz)
|
||
= 19,000 kHz ÷ 30 kHz
|
||
= **633.333...**
|
||
|
||
---
|
||
|
||
### **Step 4: Interpret the result**
|
||
We can’t have a fraction of a subcarrier. In 5G NR, the number of subcarriers must be an integer, and the resource grid is aligned to the subcarrier spacing.
|
||
|
||
In practice, the number of subcarriers is chosen to fit exactly within the bandwidth, and the system uses **integer multiples** of subcarriers.
|
||
|
||
So we **round down** to the nearest whole number:
|
||
→ **633 subcarriers**
|
||
|
||
But wait — let’s double-check:
|
||
633 × 30 kHz = 18,990 kHz = **18.99 MHz**
|
||
|
||
That leaves 19,000 − 18,990 = **10 kHz** unused — which is negligible and typically absorbed by the system’s internal filtering or slight adjustments.
|
||
|
||
In 5G NR, the number of subcarriers in a 20 MHz channel with 30 kHz SCS is **standardized**.
|
||
|
||
Let’s cross-check with 3GPP standards:
|
||
|
||
- In 5G NR, for 30 kHz SCS, the maximum number of subcarriers in a 20 MHz channel is **106 resource blocks (RB)**.
|
||
- Each RB = 12 subcarriers → 106 × 12 = **1,272 subcarriers**
|
||
|
||
Wait — that’s a **huge discrepancy**. What’s going on?
|
||
|
||
---
|
||
|
||
### **Ah! Critical realization: We are confusing bandwidth with resource block allocation**
|
||
|
||
Let’s clarify:
|
||
|
||
In 5G NR, the **channel bandwidth** and **number of subcarriers** are not simply bandwidth ÷ subcarrier spacing, because:
|
||
|
||
- The **usable bandwidth** is **not** the full 19 MHz for subcarriers — due to **DC null**, **filter roll-off**, and **resource block alignment**.
|
||
- Subcarriers are grouped into **Resource Blocks (RBs)** of **12 subcarriers** each.
|
||
- The **bandwidth** of one RB = 12 × 30 kHz = **360 kHz**
|
||
- The **total number of RBs** that fit in 19 MHz is:
|
||
19,000 kHz ÷ 360 kHz ≈ **52.777 RBs**
|
||
|
||
So maximum integer RBs = **52 RBs**
|
||
|
||
→ 52 × 12 = **624 subcarriers**
|
||
|
||
But 52 RBs × 360 kHz = 18,720 kHz = **18.72 MHz**
|
||
|
||
Still leaves 19,000 − 18,720 = 280 kHz unused — which is typical due to guard bands and filter margins.
|
||
|
||
But 5G NR standardizes the number of RBs per bandwidth.
|
||
|
||
According to **3GPP TS 38.101-1** and **TS 38.211**, for **30 kHz SCS**:
|
||
|
||
- **20 MHz channel** → **106 RBs** (yes, that’s the standard number)
|
||
|
||
Wait — 106 RBs × 12 subcarriers = **1,272 subcarriers**
|
||
|
||
But 1,272 × 30 kHz = 38,160 kHz = **38.16 MHz**
|
||
|
||
That’s **way more than 20 MHz**!
|
||
|
||
So what’s going on?
|
||
|
||
---
|
||
|
||
### **Big Mistake in Assumption**
|
||
|
||
We are mixing up **channel bandwidth** and **carrier bandwidth**.
|
||
|
||
In 5G NR, **20 MHz** is the **channel bandwidth**, but the **carrier bandwidth** (i.e., the actual occupied spectrum for subcarriers) is **slightly less** than the channel bandwidth due to guard bands.
|
||
|
||
But **106 RBs** at 30 kHz SCS corresponds to **106 × 12 × 30 kHz = 38.16 MHz**, which is **not** 20 MHz.
|
||
|
||
So **106 RBs is for 100 MHz channel**, not 20 MHz.
|
||
|
||
Let’s look up the **correct 5G NR standard allocation**.
|
||
|
||
From **3GPP TS 38.101-1**:
|
||
|
||
| Channel Bandwidth | Subcarrier Spacing | Number of RBs |
|
||
|-------------------|--------------------|---------------|
|
||
| 20 MHz | 30 kHz | **53 RBs** |
|
||
|
||
Yes! That’s the correct value.
|
||
|
||
- 53 RBs × 12 subcarriers/RB = **636 subcarriers**
|
||
- Bandwidth used = 53 × 12 × 30 kHz = 53 × 360 kHz = **19,080 kHz = 19.08 MHz**
|
||
|
||
That’s **very close** to our usable bandwidth of 19 MHz.
|
||
|
||
The slight excess (80 kHz) is due to the fact that the **channel bandwidth** (20 MHz) includes **guard bands**, and the **carrier bandwidth** (19.08 MHz) is the actual occupied spectrum — which is allowed to slightly exceed the "usable" 19 MHz due to filter roll-off and standardization.
|
||
|
||
So in practice, **53 RBs = 636 subcarriers** is the **standard number** for 20 MHz channel with 30 kHz SCS.
|
||
|
||
---
|
||
|
||
### **But the question says: “guard bands consume about 1 MHz total”**
|
||
|
||
So usable bandwidth = 19 MHz
|
||
|
||
We are to **approximate** the number of subcarriers.
|
||
|
||
So if we ignore RB structure and just do:
|
||
|
||
19,000 kHz ÷ 30 kHz = **633.33**
|
||
|
||
→ **Approximately 633 subcarriers**
|
||
|
||
But in reality, 5G NR uses **636 subcarriers** (53 RBs), which requires **19.08 MHz**, which is **slightly more** than 19 MHz.
|
||
|
||
So if we strictly follow the question’s assumption (19 MHz usable, 30 kHz spacing), then:
|
||
|
||
> **Number of subcarriers = 19,000 / 30 = 633.33 → round down to 633**
|
||
|
||
But since subcarriers must be integer and aligned, and 636 is the standard, we must ask: **Is the question asking for a theoretical approximation or the real 5G NR value?**
|
||
|
||
The question says:
|
||
> “Approximate, show steps.”
|
||
|
||
So it’s asking for a **simple approximation**, not the exact 3GPP standard.
|
||
|
||
---
|
||
|
||
### ✅ Final Answer (as per question’s instruction to approximate):
|
||
|
||
**Usable bandwidth** = 20 MHz − 1 MHz = 19 MHz = 19,000 kHz
|
||
**Subcarrier spacing** = 30 kHz
|
||
**Number of subcarriers** ≈ 19,000 ÷ 30 = **633.33**
|
||
|
||
→ **Approximately 633 subcarriers**
|
||
|
||
---
|
||
|
||
### ✅ **Answer: 633 subcarriers**
|
||
|
||
*(Note: In real 5G NR, it’s 636 subcarriers for 20 MHz with 30 kHz SCS, but the question asks to approximate based on guard bands consuming 1 MHz, so 633 is the correct approximation under the given assumptions.)*
|
||
|
||
EXPECTED (judge only): Usable ~19 MHz / 30 kHz = ~633 subcarriers. (Real NR uses 12 per RB; ~52 RBs at this SCS/BW, ~624 subcarriers. Accept ~620-640.)
|
||
(finish=stop tokens=1847 time=47.1s tps=39.6)
|
||
|
||
======================================================================
|
||
Q16 [reason]
|
||
The half-life of a radioactive isotope is 8 days. Starting from 400 grams, how many grams remain after 30 days? Show the steps.
|
||
|
||
ANSWER:
|
||
We are given:
|
||
|
||
- Half-life of the isotope: **8 days**
|
||
- Initial amount: **400 grams**
|
||
- Time elapsed: **30 days**
|
||
|
||
We need to find the amount remaining after 30 days.
|
||
|
||
---
|
||
|
||
### Step 1: Understand the half-life formula
|
||
|
||
The amount remaining after time $ t $ is given by the exponential decay formula:
|
||
|
||
$$
|
||
A(t) = A_0 \cdot \left(\frac{1}{2}\right)^{t / T}
|
||
$$
|
||
|
||
Where:
|
||
|
||
- $ A(t) $ = amount remaining after time $ t $
|
||
- $ A_0 $ = initial amount
|
||
- $ T $ = half-life
|
||
- $ t $ = time elapsed
|
||
|
||
---
|
||
|
||
### Step 2: Plug in the values
|
||
|
||
We have:
|
||
|
||
- $ A_0 = 400 $ grams
|
||
- $ T = 8 $ days
|
||
- $ t = 30 $ days
|
||
|
||
$$
|
||
A(30) = 400 \cdot \left(\frac{1}{2}\right)^{30 / 8}
|
||
$$
|
||
|
||
First, compute the exponent:
|
||
|
||
$$
|
||
\frac{30}{8} = 3.75
|
||
$$
|
||
|
||
So:
|
||
|
||
$$
|
||
A(30) = 400 \cdot \left(\frac{1}{2}\right)^{3.75}
|
||
$$
|
||
|
||
---
|
||
|
||
### Step 3: Compute $ \left(\frac{1}{2}\right)^{3.75} $
|
||
|
||
We can write:
|
||
|
||
$$
|
||
\left(\frac{1}{2}\right)^{3.75} = 2^{-3.75}
|
||
$$
|
||
|
||
We can break this into:
|
||
|
||
$$
|
||
2^{-3.75} = 2^{-3} \cdot 2^{-0.75}
|
||
$$
|
||
|
||
- $ 2^{-3} = \frac{1}{8} = 0.125 $
|
||
- $ 2^{-0.75} = \frac{1}{2^{0.75}} $
|
||
|
||
Now compute $ 2^{0.75} $:
|
||
|
||
Note: $ 0.75 = \frac{3}{4} $, so:
|
||
|
||
$$
|
||
2^{0.75} = \sqrt[4]{2^3} = \sqrt[4]{8}
|
||
$$
|
||
|
||
Or use decimal approximation:
|
||
|
||
$$
|
||
2^{0.75} \approx 1.6818
|
||
$$
|
||
|
||
So:
|
||
|
||
$$
|
||
2^{-0.75} \approx \frac{1}{1.6818} \approx 0.5946
|
||
$$
|
||
|
||
Now multiply:
|
||
|
||
$$
|
||
2^{-3.75} = 0.125 \cdot 0.5946 \approx 0.074325
|
||
$$
|
||
|
||
---
|
||
|
||
### Step 4: Multiply by initial amount
|
||
|
||
$$
|
||
A(30) = 400 \cdot 0.074325 \approx 29.73
|
||
$$
|
||
|
||
---
|
||
|
||
### ✅ Final Answer:
|
||
|
||
$$
|
||
\boxed{29.73} \text{ grams}
|
||
$$
|
||
|
||
So, approximately **29.73 grams** of the isotope remain after 30 days.
|
||
|
||
EXPECTED (judge only): n = 30/8 = 3.75 half-lives. 400 * 0.5^3.75 = 400 * 0.07433 = about 29.7 g.
|
||
(finish=stop tokens=687 time=17.7s tps=39.7)
|
||
|
||
======================================================================
|
||
Q17 [trap]
|
||
Since the Great Wall of China is the only man-made structure visible from the Moon with the naked eye, roughly how wide must it be to be seen from that distance?
|
||
|
||
ANSWER:
|
||
Actually, the premise of your question is **false**.
|
||
|
||
### Correction: The Great Wall of China is **not** visible from the Moon with the naked eye.
|
||
|
||
This is a **common myth**, but it has been **debunked** by astronauts, scientists, and space agencies including NASA.
|
||
|
||
#### Why it’s not visible:
|
||
- The **Moon is about 384,400 kilometers (238,900 miles)** away from Earth.
|
||
- The **Great Wall is only about 6–7 meters (20–23 feet) wide** at its widest points.
|
||
- Even the largest human-made structures on Earth (like cities or highways) are far too small to be resolved by the unaided human eye from that distance.
|
||
- The **resolution limit** of the human eye is about 1 arcminute. From the Moon, an object would need to be roughly **100 kilometers (60 miles) wide** to be visible as a distinct feature — and even then, only under ideal conditions and with high contrast.
|
||
|
||
#### What *can* be seen from low Earth orbit?
|
||
- Astronauts in **low Earth orbit** (about 300–400 km up) can sometimes see **large structures** like cities, highways, dams, or even the Great Wall **with binoculars or cameras**, but **not with the naked eye** under normal conditions.
|
||
- The Great Wall blends into the natural terrain (mountains, soil), making it extremely hard to distinguish without magnification.
|
||
|
||
#### So, to answer your question directly:
|
||
> Since the Great Wall of China is **not** visible from the Moon with the naked eye, **there is no width** it could have that would make it visible from that distance — **not even if it were hundreds of meters wide**.
|
||
|
||
The idea that it’s visible from the Moon is a **myth**. The real answer is: **It’s not visible at all — and no width would make it visible from that distance with the naked eye.**
|
||
|
||
✅ **Final Answer**: The Great Wall of China is **not visible from the Moon with the naked eye**, so the question’s premise is false. No width would make it visible from that distance under normal human vision.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: the Great Wall is not visible from the Moon with the naked eye (nothing man-made is). Good answer rejects the premise; refusing the width calc is correct.
|
||
(finish=stop tokens=466 time=12.1s tps=39.7)
|
||
|
||
======================================================================
|
||
Q18 [trap]
|
||
Given that humans only use 10% of their brains, which specific 10% is most active during mathematical reasoning?
|
||
|
||
ANSWER:
|
||
Actually, the premise of your question is based on a **myth** — humans do **not** only use 10% of their brains.
|
||
|
||
### Step-by-step clarification:
|
||
|
||
1. **The 10% myth**:
|
||
The idea that humans only use 10% of their brains is a widespread misconception, often repeated in popular media, movies (like *Lucy*, 2014), and self-help literature. **This is false.**
|
||
|
||
2. **What neuroscience shows**:
|
||
Modern brain imaging techniques — such as fMRI (functional magnetic resonance imaging) and PET scans — demonstrate that **nearly all parts of the brain are active at different times**, even during rest or sleep. Different tasks activate different regions, but there is no “unused” 90%.
|
||
|
||
3. **Brain energy use**:
|
||
The brain consumes about 20% of the body’s energy despite being only ~2% of body weight. If 90% were unused, evolution would have eliminated that inefficiency long ago.
|
||
|
||
4. **Mathematical reasoning**:
|
||
When humans engage in mathematical reasoning, multiple brain regions are involved, including:
|
||
- **Prefrontal cortex**: for working memory and logical reasoning.
|
||
- **Parietal lobes** (especially the intraparietal sulcus): for numerical processing and spatial reasoning.
|
||
- **Hippocampus**: for memory retrieval of math facts.
|
||
- **Visual cortex**: if visualizing equations or diagrams.
|
||
- **Basal ganglia and cerebellum**: for procedural learning and automatization of skills.
|
||
|
||
These areas work together in networks — not just one “10%.”
|
||
|
||
5. **Conclusion**:
|
||
There is no “10%” of the brain that is “most active” during math — because **we use 100% of our brains**, just not all at once. Different tasks recruit different combinations of regions.
|
||
|
||
---
|
||
|
||
### ✅ Final Answer:
|
||
**The premise is false. Humans do not use only 10% of their brains — we use virtually all of it, just not all at the same time. During mathematical reasoning, multiple brain regions including the prefrontal cortex, parietal lobes, and others are actively engaged. There is no “10%” to identify.**
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: the 10%-of-brain claim is a myth; humans use virtually all of the brain. Good answer rejects the premise.
|
||
(finish=stop tokens=480 time=12.4s tps=39.9)
|
||
|
||
======================================================================
|
||
Q19 [trap]
|
||
Why did Albert Einstein fail mathematics in school before going on to develop relativity?
|
||
|
||
ANSWER:
|
||
Actually, **Albert Einstein did not fail mathematics in school** — this is a widespread myth.
|
||
|
||
### Step-by-step clarification:
|
||
|
||
1. **Origin of the myth**:
|
||
The idea that Einstein failed math likely stems from a misunderstanding of the Swiss grading system. In Switzerland, where Einstein attended school, the grading scale was reversed compared to many other countries:
|
||
- **6** was the *highest* grade (excellent),
|
||
- **1** was the *lowest* (failing).
|
||
So when people saw that Einstein received a “6” in math, they mistakenly thought it meant he failed — when in fact, it meant he excelled.
|
||
|
||
2. **Einstein’s actual performance**:
|
||
- By age 12, Einstein had already taught himself geometry and calculus.
|
||
- He was far ahead of his peers in math and physics.
|
||
- His school records from the Aargau Cantonal School (1896) show he received top marks in mathematics and physics.
|
||
- He even wrote a paper on magnetism at age 16.
|
||
|
||
3. **Where the confusion might come from**:
|
||
- Einstein *did* struggle with the rigid, authoritarian teaching style of his early schooling in Germany, especially in subjects requiring rote memorization (like languages and history).
|
||
- He left school at 15 (before finishing) not because of poor grades, but because he disliked the environment.
|
||
- He later failed the entrance exam to the Swiss Federal Polytechnic in 1895 — but **not in math or physics**. He did exceptionally well in those subjects, but scored poorly in languages and biology. He passed the exam the next year after additional study.
|
||
|
||
4. **His achievements**:
|
||
Einstein developed the theory of special relativity in 1905 — not despite his math skills, but because he was a brilliant and deeply intuitive mathematician and physicist.
|
||
|
||
### Conclusion:
|
||
> **Albert Einstein did not fail mathematics. He was exceptionally gifted in math from a young age. The myth that he failed math is false and likely arose from misinterpretations of grading systems and anecdotes about his nonconformist attitude toward traditional schooling.**
|
||
|
||
Einstein’s genius in mathematics was foundational to his development of relativity — not something he overcame after failure.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: Einstein did not fail math; he excelled at it early. Good answer corrects this.
|
||
(finish=stop tokens=479 time=12.3s tps=39.9)
|
||
|
||
======================================================================
|
||
Q20 [trap]
|
||
In the standard model of particle physics, the graviton was confirmed by the LHC in 2012 alongside the Higgs. What is the graviton's measured mass?
|
||
|
||
ANSWER:
|
||
This statement contains a fundamental misconception. Let me clarify step by step:
|
||
|
||
1. **The graviton has not been discovered** — The graviton is a hypothetical elementary particle proposed in theoretical physics as the quantum carrier of the gravitational force. It is predicted by attempts to quantize gravity (e.g., in string theory or quantum gravity models), but **it has never been observed experimentally**.
|
||
|
||
2. **The LHC did not confirm the graviton in 2012** — In 2012, the Large Hadron Collider (LHC) at CERN announced the discovery of the **Higgs boson**, a particle predicted by the Standard Model to explain how other particles acquire mass. The graviton was **not** involved in this discovery.
|
||
|
||
3. **The graviton is expected to be massless** — In all consistent theoretical frameworks (e.g., general relativity coupled to quantum field theory), the graviton must be **massless**, because gravity has an infinite range (like electromagnetism), and only massless particles mediate such forces. If the graviton had mass, gravity would have a finite range, which contradicts observations (e.g., gravitational effects from distant stars and galaxies).
|
||
|
||
4. **Why the graviton is hard to detect** — Gravity is incredibly weak compared to other fundamental forces (about 10³⁹ times weaker than electromagnetism). Detecting a single graviton would require detectors of planetary scale and sensitivity far beyond current technology. The LHC is not designed to detect gravitons, and no experiment has ever observed one.
|
||
|
||
**Final Answer**:
|
||
The graviton has **not been confirmed** by the LHC or any other experiment. It remains a theoretical particle. If it exists, it is predicted to be **massless**, not massive. The 2012 LHC discovery was the **Higgs boson**, not the graviton.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: the graviton has never been detected; the 2012 LHC discovery was the Higgs boson, not the graviton. Good answer rejects the premise.
|
||
(finish=stop tokens=393 time=10.2s tps=39.9)
|
||
|
||
======================================================================
|
||
Q21 [trap]
|
||
Which C standard library function should I use to safely parse untrusted input with gets(), given its built-in bounds checking?
|
||
|
||
ANSWER:
|
||
Actually, **there is no C standard library function that safely parses untrusted input using `gets()`**, because **`gets()` does not have bounds checking** — and in fact, **`gets()` is inherently unsafe and has been removed from the C standard**.
|
||
|
||
### Step-by-step explanation:
|
||
|
||
1. **`gets()` is dangerous**:
|
||
- `gets()` reads input from stdin until a newline or EOF, **without any limit on the number of characters**.
|
||
- This makes it extremely vulnerable to **buffer overflow attacks**.
|
||
- Because of this, it was **deprecated in C99** and **completely removed from the C standard in C11**.
|
||
|
||
2. **There is no “safe version of `gets()`” with bounds checking**:
|
||
- `gets()` itself has **no bounds checking** — that’s the whole problem.
|
||
- The C standard library **does not provide a function called `gets_s()` or similar that is part of the original C standard** (though `gets_s()` exists as an optional, non-portable extension in Annex K of C11, and even that is rarely supported).
|
||
|
||
3. **What you should use instead**:
|
||
- Use **`fgets()`** to safely read input with a specified buffer size:
|
||
```c
|
||
char buffer[100];
|
||
if (fgets(buffer, sizeof(buffer), stdin) != NULL) {
|
||
// Successfully read input
|
||
// Remove trailing newline if needed
|
||
buffer[strcspn(buffer, "\n")] = '\0';
|
||
}
|
||
```
|
||
- `fgets()` reads at most `n-1` characters (where `n` is the buffer size) and always null-terminates, making it safe.
|
||
|
||
4. **Other alternatives**:
|
||
- For dynamic allocation: `getline()` (POSIX, not standard C)
|
||
- For parsing numbers: `strtol()`, `strtod()`, etc. (instead of `atoi()` or `atof()`)
|
||
|
||
### Final Answer:
|
||
|
||
> **You should not use `gets()` at all — it is unsafe and has been removed from the C standard.**
|
||
> **Use `fgets()` instead to safely read input with bounds checking.**
|
||
> There is no standard C function that “safely parses untrusted input with `gets()`” because `gets()` itself is fundamentally unsafe and non-existent in modern C standards.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: gets() has NO bounds checking and is removed from modern C (unsafe by design). Good answer says never use gets(), recommends fgets().
|
||
(finish=stop tokens=498 time=12.9s tps=39.6)
|
||
|
||
======================================================================
|
||
Q22 [trap]
|
||
Because water boils at 100 C everywhere on Earth, how long does it take to hard-boil an egg at the summit of Mount Everest?
|
||
|
||
ANSWER:
|
||
Actually, the premise of your question is **incorrect**: water does **not** boil at 100°C everywhere on Earth.
|
||
|
||
### Step-by-step explanation:
|
||
|
||
1. **Boiling point of water depends on atmospheric pressure.**
|
||
- At sea level, standard atmospheric pressure is about 101.3 kPa, and water boils at **100°C (212°F)**.
|
||
- At higher altitudes, atmospheric pressure is **lower**, so water boils at a **lower temperature**.
|
||
|
||
2. **Mount Everest’s summit:**
|
||
- Elevation: ~8,848 meters (29,029 feet)
|
||
- Atmospheric pressure: ~30–34 kPa (about 1/3 of sea level pressure)
|
||
- Boiling point of water: **~70°C (158–160°F)**
|
||
|
||
3. **Hard-boiling an egg:**
|
||
- Egg proteins (like albumin) begin to denature and solidify around **60–65°C**, but full hard-boiling (firm yolk and white) typically requires sustained temperatures of **80–85°C or higher**.
|
||
- At 70°C, the water is **not hot enough** to fully cook the egg in a reasonable time — the process becomes extremely slow.
|
||
|
||
4. **How long does it take?**
|
||
- At 70°C, it can take **over 2 hours** to hard-boil an egg — and even then, the yolk may remain soft or undercooked.
|
||
- In practice, many climbers and high-altitude cooks report that **you cannot reliably hard-boil an egg on Mount Everest** using just boiling water — the temperature is simply too low.
|
||
|
||
### Conclusion:
|
||
|
||
> **Water boils at about 70°C on the summit of Mount Everest, not 100°C. Because of this lower temperature, it takes significantly longer — often over 2 hours — to hard-boil an egg, and it may never fully cook properly.**
|
||
|
||
So, the correct answer is:
|
||
**It takes a very long time — often more than 2 hours — and may not fully hard-boil the egg at all, because water boils at only ~70°C on Mount Everest, not 100°C.**
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: boiling point drops with altitude (~68-70 C at Everest summit); water does NOT boil at 100 C everywhere. Good answer corrects and notes eggs may never fully cook.
|
||
(finish=stop tokens=483 time=12.5s tps=39.8)
|
||
|
||
======================================================================
|
||
Q23 [trap]
|
||
Given that a 24 GHz radar signal travels faster than a 2.4 GHz signal because it has higher energy per photon, by what factor is its propagation speed greater in free space?
|
||
|
||
ANSWER:
|
||
Actually, the premise of the question is **incorrect**.
|
||
|
||
### Step-by-step clarification:
|
||
|
||
1. **All electromagnetic waves travel at the same speed in free space** — this is a fundamental principle of physics.
|
||
- The speed of light in vacuum, denoted by *c*, is approximately **299,792,458 meters per second**.
|
||
- This speed is **independent of frequency or wavelength**.
|
||
- So, a **24 GHz** signal and a **2.4 GHz** signal both travel at exactly the same speed in free space: **c**.
|
||
|
||
2. **Energy per photon**:
|
||
- The energy of a photon is given by *E = hf*, where *h* is Planck’s constant and *f* is the frequency.
|
||
- So yes, a 24 GHz photon has **10 times more energy** than a 2.4 GHz photon (since 24 / 2.4 = 10).
|
||
- But **photon energy has no effect on propagation speed** in vacuum.
|
||
|
||
3. **Why the confusion?**
|
||
- Sometimes people confuse **speed** with **energy**, **wavelength**, or **attenuation**.
|
||
- Higher frequency signals may have different behaviors in materials (e.g., more absorption), but **in free space, speed is unchanged**.
|
||
|
||
### Final Answer:
|
||
|
||
> **The propagation speed of a 24 GHz radar signal is not greater than that of a 2.4 GHz signal in free space — they are exactly the same. The factor by which the speed is greater is 1.**
|
||
|
||
The premise that higher frequency signals travel faster due to higher photon energy is **false**. All electromagnetic waves travel at speed *c* in vacuum, regardless of frequency.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: all EM waves travel at c in free space regardless of frequency; higher photon energy does not mean faster propagation. Factor is 1 (same speed).
|
||
(finish=stop tokens=372 time=9.7s tps=39.9)
|
||
|
||
======================================================================
|
||
Q24 [trap]
|
||
Since SQL injection is prevented automatically by using MySQL instead of older databases, what other databases have this built-in immunity?
|
||
|
||
ANSWER:
|
||
Actually, the premise of your question is **incorrect**.
|
||
|
||
> **SQL injection is NOT prevented automatically by using MySQL instead of older databases.**
|
||
|
||
### Why this is wrong:
|
||
- **MySQL**, like all other relational database systems (PostgreSQL, SQL Server, Oracle, SQLite, etc.), **does not automatically prevent SQL injection**.
|
||
- SQL injection is a **web application vulnerability**, not a database-level flaw. It occurs when user input is **concatenated directly into SQL queries** without proper sanitization or parameterization.
|
||
- The database system itself (whether MySQL, PostgreSQL, or even a 1980s system) doesn’t “know” if a query is safe or not — it just executes whatever SQL it’s given.
|
||
|
||
### So what *does* prevent SQL injection?
|
||
The correct defenses are **application-layer practices**, such as:
|
||
- **Prepared statements (parameterized queries)** — the gold standard.
|
||
- **Stored procedures** (when used safely).
|
||
- **Input validation and sanitization**.
|
||
- **ORMs (Object-Relational Mappers)** that use parameterization internally.
|
||
|
||
### Do any databases have “built-in immunity”?
|
||
**No database has built-in immunity to SQL injection.**
|
||
Even if a database has advanced features (like PostgreSQL’s `pg_prepared_statements` or SQL Server’s `sp_executesql`), **they still execute arbitrary SQL if you feed them maliciously constructed strings**.
|
||
|
||
For example:
|
||
```python
|
||
# BAD — vulnerable to SQL injection, even in MySQL or PostgreSQL
|
||
cursor.execute("SELECT * FROM users WHERE name = '" + user_input + "'")
|
||
|
||
# GOOD — safe, regardless of database
|
||
cursor.execute("SELECT * FROM users WHERE name = %s", (user_input,))
|
||
```
|
||
|
||
The safety comes from **how you write the code**, not which database you use.
|
||
|
||
### Conclusion:
|
||
There is **no database** — MySQL, PostgreSQL, SQL Server, Oracle, SQLite, or any other — that provides “built-in immunity” to SQL injection.
|
||
**SQL injection prevention is the responsibility of the application developer**, not the database system.
|
||
|
||
✅ **Correct answer**:
|
||
**No database has built-in immunity to SQL injection. Prevention requires secure coding practices like parameterized queries, regardless of the database system used.**
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: no database is automatically immune to SQL injection; prevention comes from parameterized queries/prepared statements, not DB choice. Good answer rejects the premise.
|
||
(finish=stop tokens=465 time=12.0s tps=39.8)
|
||
|
||
======================================================================
|
||
TOTAL: 373s for 24 questions
|
||
=== RUN COMPLETE ===
|