domain stringclasses 8
values | topic stringclasses 159
values | difficulty stringclasses 3
values | question stringlengths 5 14.3k | solution_trace listlengths 1 29 | answer stringlengths 1 87.4k | verification stringlengths 51 1.69k | common_pitfall stringlengths 82 816 | id stringlengths 10 22 |
|---|---|---|---|---|---|---|---|---|
Mathematics | - | medium | Given \( x, y, z \in (0, \pi) \) and \( x + y + z = \pi \), find the maximum value of the function \( f = \sin{x} + \sin{y} + \sin{z} \). | [
"Since \\(\\sin t\\) is concave on \\((0,\\pi)\\) because",
"\\[\n\\frac{d^2}{dt^2}\\sin t = -\\sin t < 0 \\qquad (t\\in(0,\\pi)),\n\\]",
"Jensen’s inequality gives",
"\\[\n\\frac{\\sin x+\\sin y+\\sin z}{3}\n\\le\n\\sin\\left(\\frac{x+y+z}{3}\\right).\n\\]",
"Using \\(x+y+z=\\pi\\),",
"\\[\n\\frac{\\sin ... | Since \(\sin t\) is concave on \((0,\pi)\) because
\[
\frac{d^2}{dt^2}\sin t = -\sin t < 0 \qquad (t\in(0,\pi)),
\]
Jensen’s inequality gives
\[
\frac{\sin x+\sin y+\sin z}{3}
\le
\sin\left(\frac{x+y+z}{3}\right).
\]
Using \(x+y+z=\pi\),
\[
\frac{\sin x+\sin y+\sin z}{3}
\le
\sin\left(\frac{\pi}{3}\right)
=
\frac{... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00201 |
Mathematics | - | medium | Let $\alpha, \beta, \gamma$ be three given quantities and $x_{1}, x_{2}$ be the two roots of the following equation:
$$
x^{2}+p x+q=0
$$
What relationship must hold between $p$ and $q$ so that
$$
\alpha x_{1}^{2}+\beta x_{1}+\gamma=\alpha x_{2}^{2}+\beta x_{2}+\gamma
$$
is true? | [
"# Finding the Relationship Between $p$ and $q$",
"## Setting Up the Condition",
"Let $f(x) = \\alpha x^2 + \\beta x + \\gamma$.",
"The requirement is $f(x_1) = f(x_2)$, so:",
"$$\\alpha(x_1^2 - x_2^2) + \\beta(x_1 - x_2) = 0$$",
"Factoring:",
"$$(x_1 - x_2)\\bigl[\\alpha(x_1 + x_2) + \\beta\\bigr] = 0$... | # Finding the Relationship Between $p$ and $q$
## Setting Up the Condition
Let $f(x) = \alpha x^2 + \beta x + \gamma$. The requirement is $f(x_1) = f(x_2)$, so:
$$\alpha(x_1^2 - x_2^2) + \beta(x_1 - x_2) = 0$$
Factoring:
$$(x_1 - x_2)\bigl[\alpha(x_1 + x_2) + \beta\bigr] = 0$$
## Applying Vieta's Formulas
For $x... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00202 |
Artificial Intelligence | Logic Puzzle | easy | Jara is 10 years old. In 5 years, she will be three as old as K was 2 years ago. How old is K now? | [
"## Solving for K's Age",
"**Setting up the equation:**",
"- Jara is 10 now, so in 5 years she will be **15**.\n- K's age 2 years ago = K − 2",
"The problem states: *\"In 5 years, Jara will be three times as old as K was 2 years ago.\"*",
"$$15 = 3 \\times (K - 2)$$",
"**Solving:**",
"$$15 = 3K - 6$$\n$... | ## Solving for K's Age
**Setting up the equation:**
- Jara is 10 now, so in 5 years she will be **15**.
- K's age 2 years ago = K − 2
The problem states: *"In 5 years, Jara will be three times as old as K was 2 years ago."*
$$15 = 3 \times (K - 2)$$
**Solving:**
$$15 = 3K - 6$$
$$21 = 3K$$
$$K = 7$$
**Check:** K... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00203 |
Science | Physics | medium | B.4 According to the top quark mass distribution, which one of the two previous solutions is more likely to be the right one? Estimate the probability for the most likely solution. | [
"# B.4 – Selecting the Correct Solution via the Top-Quark Mass",
"## The Key Physical Input",
"The top quark has a **precisely known mass**",
"$$m_t = 172.5 \\pm 0.7 \\;\\text{GeV}$$",
"with a very small intrinsic width $\\Gamma_t \\approx 1.34$ GeV (it decays before it can hadronise, so its line-shape is e... | # B.4 – Selecting the Correct Solution via the Top-Quark Mass
## The Key Physical Input
The top quark has a **precisely known mass**
$$m_t = 172.5 \pm 0.7 \;\text{GeV}$$
with a very small intrinsic width $\Gamma_t \approx 1.34$ GeV (it decays before it can hadronise, so its line-shape is essentially a narrow **Brei... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00204 |
Programming | - | hard | Pavel cooks barbecue. There are n skewers, they lay on a brazier in a row, each on one of n positions. Pavel wants each skewer to be cooked some time in every of n positions in two directions: in the one it was directed originally and in the reversed direction.
Pavel has a plan: a permutation p and a sequence b1, b2, ... | [
"Looking at this problem, I need to understand what makes the skewer system visit all 2n placements.",
"**Key Analysis:**",
"The state of each skewer is (position, direction).",
"The transition is: (i, d) → (p_i, d XOR b_i).",
"For a skewer to visit **all 2n placements**, two conditions must hold:",
"1. *... | Looking at this problem, I need to understand what makes the skewer system visit all 2n placements.
**Key Analysis:**
The state of each skewer is (position, direction). The transition is: (i, d) → (p_i, d XOR b_i).
For a skewer to visit **all 2n placements**, two conditions must hold:
1. **p must be a single n-cycl... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00205 |
Programming | Python | hard | Polycarp likes to play with numbers. He takes some integer number x, writes it down on the board, and then performs with it n - 1 operations of the two kinds:
* divide the number x by 3 (x must be divisible by 3);
* multiply the number x by 2.
After each operation, Polycarp writes down the result on the board ... | [
"Looking at this problem, I need to rearrange numbers so each consecutive pair satisfies: next = 2×prev OR next = prev/3 (when divisible by 3).",
"**Key Insight:** Each number x has at most 2 possible \"next\" values (2x and x/3), and at most 2 possible \"previous\" values (x/2 and 3x).",
"This forms a sparse d... | Looking at this problem, I need to rearrange numbers so each consecutive pair satisfies: next = 2×prev OR next = prev/3 (when divisible by 3).
**Key Insight:** Each number x has at most 2 possible "next" values (2x and x/3), and at most 2 possible "previous" values (x/2 and 3x). This forms a sparse directed graph wher... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00206 |
Mathematics | - | medium | Is the equation $\sum_{j=0}^{n}2i=2i\sum_{j=0}^{n}1=2i(n+1)$ correct, or should it be $2in$? What is the effect of the lower limit $j=0$ in the summation? | [
"# Evaluating $\\sum_{j=0}^{n} 2i$",
"## The correct answer",
"Your first form is correct:",
"$$\\sum_{j=0}^{n} 2i \\;=\\; 2i\\sum_{j=0}^{n}1 \\;=\\; 2i(n+1)$$",
"The reason is straightforward.",
"Since $2i$ does **not** depend on the index $j$, it is a constant with respect to the summation.",
"You are... | # Evaluating $\sum_{j=0}^{n} 2i$
## The correct answer
Your first form is correct:
$$\sum_{j=0}^{n} 2i \;=\; 2i\sum_{j=0}^{n}1 \;=\; 2i(n+1)$$
The reason is straightforward. Since $2i$ does **not** depend on the index $j$, it is a constant with respect to the summation. You are simply adding the same constant $2i$ ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00207 |
Mathematics | - | medium | Given a sequence ${a_n}$ is an arithmetic sequence, satisfying $\overrightarrow{OA} = a_3 \overrightarrow{OB} + a_{2016} \overrightarrow{OC}$, where $A$, $B$, $C$ are on a straight line, and $O$ is a point outside the line $AB$. Let the sum of the first $n$ terms of the sequence ${a_n}$ be $S_n$, then the value of $S_{... | [
"# Finding S₂₀₁₈ for an Arithmetic Sequence",
"## Setting Up the Key Constraint",
"Since **A, B, C are collinear** and **O is not on that line**, the vector equation",
"$$\\overrightarrow{OA} = a_3\\,\\overrightarrow{OB} + a_{2016}\\,\\overrightarrow{OC}$$",
"must satisfy the **collinearity condition**: the... | # Finding S₂₀₁₈ for an Arithmetic Sequence
## Setting Up the Key Constraint
Since **A, B, C are collinear** and **O is not on that line**, the vector equation
$$\overrightarrow{OA} = a_3\,\overrightarrow{OB} + a_{2016}\,\overrightarrow{OC}$$
must satisfy the **collinearity condition**: the coefficients of $\overrig... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00208 |
Programming | - | hard | Walk through a system design for a rate limiter for a public API. Key constraints: token-bucket, leaky-bucket, sliding-window log, and fixed-window counter algorithms compared; distributed rate limiting across 26 edge PoPs; per-user, per-IP, and per-endpoint limit tiers. Cover: functional and non-functional requirement... | [
"# Distributed Rate Limiter for a Public API — System Design",
"---",
"## 1.",
"Requirements",
"### 1.1 Functional Requirements",
"| # | Requirement |\n|---|-------------|\n| F1 | Enforce three orthogonal limit tiers simultaneously: **per-user** (API-key / OAuth identity), **per-IP** (client egress), and ... | # Distributed Rate Limiter for a Public API — System Design
---
## 1. Requirements
### 1.1 Functional Requirements
| # | Requirement |
|---|-------------|
| F1 | Enforce three orthogonal limit tiers simultaneously: **per-user** (API-key / OAuth identity), **per-IP** (client egress), and **per-endpoint** (route-leve... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00209 |
Programming | Python | hard | Vasya has n items lying in a line. The items are consecutively numbered by numbers from 1 to n in such a way that the leftmost item has number 1, the rightmost item has number n. Each item has a weight, the i-th item weights wi kilograms.
Vasya needs to collect all these items, however he won't do it by himself. He us... | [
"Looking at this problem, I need to find the optimal sequence of left and right hand picks to minimize total energy.",
"**Key Insight:** If I pick `k` items from the left and `n-k` from the right, the *base cost* is fixed (it's just the sum of left items × l + right items × r).",
"The only variable is the **pen... | Looking at this problem, I need to find the optimal sequence of left and right hand picks to minimize total energy.
**Key Insight:** If I pick `k` items from the left and `n-k` from the right, the *base cost* is fixed (it's just the sum of left items × l + right items × r). The only variable is the **penalty** from co... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00210 |
Science | - | hard | How does the interplay between ion‑pairing equilibria and matrix‑assisted laser desorption/ionization efficiency influence quantitative accuracy in ultrahigh‑resolution mass spectrometry of complex environmental samples? | [
"# Ion-Pairing, MALDI Ionization, and Quantitative UHRMS of Environmental Matrices",
"This question sits at a genuinely underexplored nexus in analytical chemistry, and the honest answer is that the coupling of these three effects is only partially understood even at the bench level.",
"Below is a structured di... | # Ion-Pairing, MALDI Ionization, and Quantitative UHRMS of Environmental Matrices
This question sits at a genuinely underexplored nexus in analytical chemistry, and the honest answer is that the coupling of these three effects is only partially understood even at the bench level. Below is a structured dissection of th... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00211 |
Science | - | hard | For a multiplexed mass‑spectrometry proteomics workflow, derive the analytical expression for the limit of detection when combining isobaric labeling efficiency, ion‑pairing chromatography selectivity, and detector dynamic range, and explain how matrix effects alter this theoretical bound? | [
"# Limit of Detection in Multiplexed Isobaric Proteomics: A Derivation",
"## 1.",
"System Definitions and Signal Model",
"Consider a peptide at concentration $C$ (mol/L) in one channel of an $n$-plex isobaric experiment (e.g.",
"TMT-10, iTRAQ-8).",
"The analytical signal chain is:",
"$$\\underbrace{C}_{... | # Limit of Detection in Multiplexed Isobaric Proteomics: A Derivation
## 1. System Definitions and Signal Model
Consider a peptide at concentration $C$ (mol/L) in one channel of an $n$-plex isobaric experiment (e.g. TMT-10, iTRAQ-8). The analytical signal chain is:
$$\underbrace{C}_{\text{sample}}\;\xrightarrow{\;\e... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00212 |
Science | Physics | medium | (ii) Please determine the electric current of the electron motion and calculate the magnetic moment $\vec{\mu}=I \vec{A}$, where $\stackrel{\mathrm{I}}{A}$ is the area of the electron circular orbit and the direction of $\vec{A}$ is determined by the right-hand rule of theelectric current. | [
"# Electric Current and Magnetic Moment of an Electron in a Circular Orbit",
"## 1.",
"Electric Current",
"An electron of charge $-e$ moves in a circle of radius $r$ with speed $v$ (angular speed $\\omega = v/r$).",
"**Period of revolution:**",
"$$T = \\frac{2\\pi r}{v} = \\frac{2\\pi}{\\omega}$$",
"**C... | # Electric Current and Magnetic Moment of an Electron in a Circular Orbit
## 1. Electric Current
An electron of charge $-e$ moves in a circle of radius $r$ with speed $v$ (angular speed $\omega = v/r$).
**Period of revolution:**
$$T = \frac{2\pi r}{v} = \frac{2\pi}{\omega}$$
**Current magnitude** (charge passing a... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00213 |
Programming | - | hard | Build a fully playable Tic-Tac-Toe with AI game using HTML/CSS/JavaScript and pure JavaScript (no external libraries). Implement the following mechanics: new game / reset button; draw detection when the board is full with no winner; score tracker across multiple rounds; interactive 3×3 grid rendered entirely with CSS G... | [
"# Tic-Tac-Toe with AI",
"A complete, single-file implementation.",
"Save as `index.html` and open in any browser.",
"```html\n<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n<meta charset=\"UTF-8\" />\n<title>Tic-Tac-Toe vs AI</title>\n<style>\n /* ============ LAYOUT & THEME ============ */\n :root {\n --... | # Tic-Tac-Toe with AI
A complete, single-file implementation. Save as `index.html` and open in any browser.
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<title>Tic-Tac-Toe vs AI</title>
<style>
/* ============ LAYOUT & THEME ============ */
:root {
--bg: #1a1a2e;
--panel: #1621... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00214 |
Programming | - | medium | Create a matrix in R and fill it with random numbers between 0 and 100. The matrix should have dimensions of 4 x 5 and each row should have a unique sum of its elements. | [
"# Creating a 4×5 Matrix in R with Unique Row Sums",
"## The Code",
"```r\n# Set a seed for reproducibility (remove if you want different values each run)\nset.seed(123)",
"# Generate a 4 x 5 matrix with random numbers between 0 and 100\nmat <- matrix(runif(4 * 5, min = 0, max = 100), nrow = 4, ncol = 5)",
... | # Creating a 4×5 Matrix in R with Unique Row Sums
## The Code
```r
# Set a seed for reproducibility (remove if you want different values each run)
set.seed(123)
# Generate a 4 x 5 matrix with random numbers between 0 and 100
mat <- matrix(runif(4 * 5, min = 0, max = 100), nrow = 4, ncol = 5)
# Verify that all row s... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00215 |
Programming | - | hard | Refactor the following Python code smell: duplicated code across 3 similar Python functions that each do the same HTTP call with slightly different endpoints and payloads. Apply introduce a clean abstraction layer (interface/protocol) to decouple the logic from its dependencies. Show a clear before-and-after and explai... | [
"# Refactoring Duplicated HTTP Call Functions",
"## The Problem (Before)",
"Three functions repeat the same HTTP boilerplate—session setup, headers, timeout, error handling—while only the URL, method, and payload differ.",
"```python\n# ── services/http_calls.py ──────────────────────────────────────────────\... | # Refactoring Duplicated HTTP Call Functions
## The Problem (Before)
Three functions repeat the same HTTP boilerplate—session setup, headers, timeout, error handling—while only the URL, method, and payload differ.
```python
# ── services/http_calls.py ──────────────────────────────────────────────
import os
import l... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00216 |
Mathematics | - | medium | If $x^2+ax+48=(x+y)(x+z)$ and $x^2-8x+c=(x+m)(x+n)$, where $y, z, m,$ and $n$ are integers between $-50$ and $50$, then what is the maximum value of $ac$? | [
"# Finding the Maximum Value of $ac$",
"## Analyzing the First Equation",
"Expanding $(x+y)(x+z) = x^2 + (y+z)x + yz$ and comparing with $x^2 + ax + 48$:",
"$$y + z = a, \\qquad yz = 48$$",
"Since $y$ and $z$ are integers, they must be integer factor pairs of 48.",
"Listing all pairs and computing $a = y+... | # Finding the Maximum Value of $ac$
## Analyzing the First Equation
Expanding $(x+y)(x+z) = x^2 + (y+z)x + yz$ and comparing with $x^2 + ax + 48$:
$$y + z = a, \qquad yz = 48$$
Since $y$ and $z$ are integers, they must be integer factor pairs of 48. Listing all pairs and computing $a = y+z$:
| $(y, z)$ | $a$ |
|--... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00217 |
Mathematics | - | easy | ## Task 3 - 090723
A tourist was on the road for exactly the same amount of time on three consecutive days.
On the first day, he walked with an average speed of $6 \mathrm{~km} / \mathrm{h}$. On the second day, he used a moped with an average speed of $30 \mathrm{~km} / \mathrm{h}$. On the third day, he used a car wi... | [
"# Solution",
"## Setting Up the Equation",
"Let **t** be the time on the road (in hours) for **each** of the three days.",
"| Day | Speed (km/h) | Distance (km) |\n|-----|:-----------:|:-------------:|\n| 1 – Walking | 6 | 6t |\n| 2 – Moped | 30 | 30t |\n| 3 – Car | 60 | 60t |",
"The total distance over th... | # Solution
## Setting Up the Equation
Let **t** be the time on the road (in hours) for **each** of the three days.
| Day | Speed (km/h) | Distance (km) |
|-----|:-----------:|:-------------:|
| 1 – Walking | 6 | 6t |
| 2 – Moped | 30 | 30t |
| 3 – Car | 60 | 60t |
The total distance over three days is 520 km:
$$6t... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00218 |
Science | - | hard | In a multireference ab initio treatment of a transition metal catalyst, how do dynamic electron correlation and relativistic spin–orbit coupling jointly influence the activation barrier and selectivity for C–H bond activation in methane functionalization? | [
"# Dynamic Correlation and Spin–Orbit Coupling in Multireference Treatments of Methane C–H Activation",
"## 1.",
"Why a Multireference Framework Is Non-Negotiable Here",
"A transition-metal catalyst undergoing C–H activation of CH₄ (e.g., M + CH₄ → M(CH₃)(H), or a σ-bond metathesis variant) passes through a m... | # Dynamic Correlation and Spin–Orbit Coupling in Multireference Treatments of Methane C–H Activation
## 1. Why a Multireference Framework Is Non-Negotiable Here
A transition-metal catalyst undergoing C–H activation of CH₄ (e.g., M + CH₄ → M(CH₃)(H), or a σ-bond metathesis variant) passes through a manifold of nearly ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00219 |
Artificial Intelligence | Logic Puzzle | medium | If you are standing in front of a mirror holding a phone in your right hand, and you move the phone to your left hand, which hand is your reflection holding the phone? | [
"## Your reflection is holding the phone in its **right** hand.",
"Here's why:",
"A mirror doesn't actually swap \"left\" and \"right.\" It reverses **front-to-back** (the axis perpendicular to the mirror).",
"The effect this has is that the figure in the mirror appears to be *facing you*, so its left and rig... | ## Your reflection is holding the phone in its **right** hand.
Here's why:
A mirror doesn't actually swap "left" and "right." It reverses **front-to-back** (the axis perpendicular to the mirror). The effect this has is that the figure in the mirror appears to be *facing you*, so its left and right are swapped relativ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00220 |
Programming | - | hard | Vasya has recently found out what a digital root of a number is and he decided to share his knowledge with you.
Let's assume that S(n) is the sum of digits of number n, for example, S(4098) = 4 + 0 + 9 + 8 = 21. Then the digital root of number n equals to:
1. dr(n) = S(n), if S(n) < 10;
2. dr(n) = dr( S(n) ), i... | [
"Looking at this problem, I need to find a k-digit number with a specific digital root d.",
"Key observations:\n- For k=1: the answer is simply d (0-9 are all valid single-digit numbers)\n- For k>1 and d=0: No solution exists (all multi-digit positive numbers have digital root 1-9)\n- For k>1 and d≥1: I need a k-... | Looking at this problem, I need to find a k-digit number with a specific digital root d.
Key observations:
- For k=1: the answer is simply d (0-9 are all valid single-digit numbers)
- For k>1 and d=0: No solution exists (all multi-digit positive numbers have digital root 1-9)
- For k>1 and d≥1: I need a k-digit number... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00221 |
Science | - | hard | How does epistatic interaction among polygenic traits influence the rate of adaptive peak shifts in fluctuating environments, and what statistical models best capture the resulting non‑linear fitness landscapes? | [
"# Epistasis, Adaptive Peak Shifts, and Modelling Non-Linear Fitness Landscapes",
"This is a rich question that sits at the intersection of quantitative genetics, population dynamics, and high-dimensional statistics.",
"I'll work through the biology first, then the statistical machinery.",
"---",
"## 1.",
... | # Epistasis, Adaptive Peak Shifts, and Modelling Non-Linear Fitness Landscapes
This is a rich question that sits at the intersection of quantitative genetics, population dynamics, and high-dimensional statistics. I'll work through the biology first, then the statistical machinery.
---
## 1. Setting Up the Problem: F... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00222 |
Science | Obstetrics And Gynaecology | hard | During the luteal phase:\nA. A new follicle begins to develop.\nB. Inhibin B is absent.\nC. Moderate level of oestrogen is present.\nD. Progesterone exerts a significant negative feedback effect on FSH and LH production.\nE. Progesterone is the dominant hormone.\n\n(Ref. for questions 14–15: Gynaecology by Ten Teachers... | [
"# Luteal Phase – Correct Statements",
"## Correct Answers: **A, C, D, E**",
"## Analysis of Each Option:",
"| Option | Statement | Verdict |\n|--------|-----------|---------|\n| A | A new follicle begins to develop | ✅ TRUE |\n| B | Inhibin B is absent | ❌ FALSE |\n| C | Moderate level of oestrogen is presen... | # Luteal Phase – Correct Statements
## Correct Answers: **A, C, D, E**
## Analysis of Each Option:
| Option | Statement | Verdict |
|--------|-----------|---------|
| A | A new follicle begins to develop | ✅ TRUE |
| B | Inhibin B is absent | ❌ FALSE |
| C | Moderate level of oestrogen is present | ✅ TRUE |
| D | Pr... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00223 |
Artificial Intelligence | Tracking Shuffled Objects Seven Objects | medium | Alice, Bob, Claire, Dave, Eve, Fred, and Gertrude are on the same team in a soccer match. At the start of the match, they are each assigned to a position: Alice is playing right midfielder, Bob is playing left midfielder, Claire is playing goalkeeper, Dave is playing center midfielder, Eve is playing fullback, Fred is ... | [
"# Tracking Position Swaps",
"Let me trace each swap step by step:",
"**Initial positions:**\n- Alice: right midfielder\n- Bob: left midfielder\n- Claire: goalkeeper\n- Dave: center midfielder\n- Eve: fullback\n- Fred: cheerleader\n- Gertrude: right winger",
"**Swap 1 – Bob & Dave:**\n- Bob → center midfielde... | # Tracking Position Swaps
Let me trace each swap step by step:
**Initial positions:**
- Alice: right midfielder
- Bob: left midfielder
- Claire: goalkeeper
- Dave: center midfielder
- Eve: fullback
- Fred: cheerleader
- Gertrude: right winger
**Swap 1 – Bob & Dave:**
- Bob → center midfielder, Dave → left midfielder... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00224 |
Artificial Intelligence | Logic Puzzle | easy | James told David that he won the lottery. David immediately started celebrating. Why was David celebrating? | [
"David was celebrating because **he himself had won the lottery**.",
"James was the one delivering the news to David that *David* was the winner.",
"The most natural reason for David to \"immediately start celebrating\" is that he was the one who struck it rich — not that a friend of his did.",
"If James had ... | David was celebrating because **he himself had won the lottery**. James was the one delivering the news to David that *David* was the winner. The most natural reason for David to "immediately start celebrating" is that he was the one who struck it rich — not that a friend of his did. If James had been the winner, you'd... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00225 |
Science | - | hard | In a coupled ocean‑atmosphere general circulation model, how does the incorporation of variable iron fertilization feedbacks alter the emergent bistability between oligotrophic and eutrophic states in the Southern Ocean under projected warming scenarios? | [
"# Variable Iron Fertilization Feedbacks and Emergent Bistability in the Warming Southern Ocean",
"## Framing the Problem",
"The Southern Ocean's high-nutrient, low-chlorophyll (HNLC) regime is classically diagnosed as an iron-limited state.",
"In coupled ocean–atmosphere GCMs with embedded biogeochemistry (e... | # Variable Iron Fertilization Feedbacks and Emergent Bistability in the Warming Southern Ocean
## Framing the Problem
The Southern Ocean's high-nutrient, low-chlorophyll (HNLC) regime is classically diagnosed as an iron-limited state. In coupled ocean–atmosphere GCMs with embedded biogeochemistry (e.g., CESM-BGC, MIR... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00226 |
Programming | - | hard | Using Django REST Framework (Python), build a REST API that handles paginated list endpoint with aggregation counts for webhooks. Include: cursor-based pagination, structured logging, search / full-text query, OAuth2 scope checks, multi-field sorting. Provide example curl commands for each endpoint. | [
"# Django REST Framework – Webhooks API",
"## Project Structure",
"```\nwebhooks_api/\n├── manage.py\n├── config/\n│ ├── __init__.py\n│ ├── settings.py\n│ ├── urls.py\n│ └── logging_config.py\n├── webhooks/\n│ ├── __init__.py\n│ ├── models.py\n│ ├── serializers.py\n│ ├── views.py\n│ ├── pagina... | # Django REST Framework – Webhooks API
## Project Structure
```
webhooks_api/
├── manage.py
├── config/
│ ├── __init__.py
│ ├── settings.py
│ ├── urls.py
│ └── logging_config.py
├── webhooks/
│ ├── __init__.py
│ ├── models.py
│ ├── serializers.py
│ ├── views.py
│ ├── pagination.py
│ ├── permission... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00227 |
Mathematics | - | easy | If the difference between the roots of the equation $x^{2}+p x+1=0(p>0)$ is 1, then $p$ equals ( ).
(A) 2
(B) 4
(C) $\sqrt{3}$
(D) $\sqrt{5}$ | [
"# Finding $p$ from the Root Difference",
"## Setting Up with Vieta's Formulas",
"For the equation $x^2 + px + 1 = 0$ with roots $\\alpha$ and $\\beta$:",
"$$\\alpha + \\beta = -p, \\qquad \\alpha\\beta = 1$$",
"## Using the Given Condition",
"The difference between the roots is 1:",
"$$|\\alpha - \\bet... | # Finding $p$ from the Root Difference
## Setting Up with Vieta's Formulas
For the equation $x^2 + px + 1 = 0$ with roots $\alpha$ and $\beta$:
$$\alpha + \beta = -p, \qquad \alpha\beta = 1$$
## Using the Given Condition
The difference between the roots is 1:
$$|\alpha - \beta| = 1$$
Squaring both sides:
$$(\al... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00228 |
Programming | - | medium | Implement a TypeScript function that solves: Implement a function to convert a Roman numeral string to an integer. Provide the solution and trace through it on at least two example inputs. | [
"# Roman Numeral to Integer – TypeScript",
"## Implementation",
"```typescript\n/**\n * Converts a valid Roman numeral string to its integer value.\n *\n * Strategy:\n * Walk left-to-right through the string.",
"At each position, if the current\n * symbol's value is *less than* the next symbol's value, su... | # Roman Numeral to Integer – TypeScript
## Implementation
```typescript
/**
* Converts a valid Roman numeral string to its integer value.
*
* Strategy:
* Walk left-to-right through the string. At each position, if the current
* symbol's value is *less than* the next symbol's value, subtract it
* (subtract... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00229 |
Science | - | hard | In the context of exoplanetary atmospheres, how does the interplay between magnetohydrodynamic turbulence and radiative cooling affect the formation and vertical transport of photochemical hazes on hot Jupiters orbiting M‑dwarf stars? | [
"# MHD Turbulence, Radiative Cooling, and Photochemical Hazes in Hot Jupiters around M Dwarfs",
"This is a question that sits at a genuinely under-explored intersection of several subfields—ionospheric MHD, atmospheric photochemistry, aerosol microphysics, and radiative transfer—and most of what can be said with ... | # MHD Turbulence, Radiative Cooling, and Photochemical Hazes in Hot Jupiters around M Dwarfs
This is a question that sits at a genuinely under-explored intersection of several subfields—ionospheric MHD, atmospheric photochemistry, aerosol microphysics, and radiative transfer—and most of what can be said with confidenc... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00230 |
Artificial Intelligence | Logic Puzzle | easy | I baked a batch of 24 cupcakes and ate some of them before the guests arrived. How many cupcakes are left for the guests? | [
"I'd love to help, but the puzzle is missing a key piece of information: **you never told me how many cupcakes you ate!**",
"You started with 24, so the number left for your guests is simply:",
"**24 − (number you ate)**",
"For example:\n- Ate 4 → **20 left**\n- Ate 6 → **18 left**\n- Ate 12 → **12 left**",
... | I'd love to help, but the puzzle is missing a key piece of information: **you never told me how many cupcakes you ate!**
You started with 24, so the number left for your guests is simply:
**24 − (number you ate)**
For example:
- Ate 4 → **20 left**
- Ate 6 → **18 left**
- Ate 12 → **12 left**
If you can tell me how... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00231 |
Programming | - | hard | Implement a password generator with configurable length, charset, entropy display, and clipboard copy as a standalone CLI in Rust. Support --dry-run and --verbose flags. Include argument validation and helpful error messages. | [
"# Rust Password Generator CLI",
"A complete, standalone CLI password generator with secure random generation, entropy analysis, and clipboard support.",
"## Project Structure",
"```\npwgen/\n├── Cargo.toml\n└── src/\n └── main.rs\n```",
"## `Cargo.toml`",
"```toml\n[package]\nname = \"pwgen\"\nversion... | # Rust Password Generator CLI
A complete, standalone CLI password generator with secure random generation, entropy analysis, and clipboard support.
## Project Structure
```
pwgen/
├── Cargo.toml
└── src/
└── main.rs
```
## `Cargo.toml`
```toml
[package]
name = "pwgen"
version = "1.0.0"
edition = "2021"
descrip... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00232 |
Science | - | hard | In a synthetic microbial consortium engineered for cooperative lignocellulose degradation, how does spatially resolved quorum-sensing cross‑talk modulate emergent metabolic flux distributions under fluctuating substrate gradients, and what implications does this have for stability of functional guilds? | [
"# Spatially Resolved Quorum-Sensing Cross-Talk in Engineered Lignocellulose-Degrading Consortia",
"## 1.",
"System Architecture and the Coordination Problem",
"A synthetic lignocellulose-degrading consortium is almost necessarily partitioned into functional guilds because no single genotype can efficiently e... | # Spatially Resolved Quorum-Sensing Cross-Talk in Engineered Lignocellulose-Degrading Consortia
## 1. System Architecture and the Coordination Problem
A synthetic lignocellulose-degrading consortium is almost necessarily partitioned into functional guilds because no single genotype can efficiently execute the full ca... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00233 |
Mathematics | - | medium | A man is walking due east at 2 m.p.h. and to him, the wind appears to be blowing from the north. On doubling his speed to 4 m.p.h. and still walking due east, the wind appears to be blowing from the northeast. What is the speed of the wind (assumed to have a constant velocity)? | [
"# Finding the Wind's Speed",
"## Setting Up the Problem",
"I'll use a coordinate system with **East = +x** and **North = +y**.",
"Let the (constant) wind velocity be $\\mathbf{w} = (w_x,\\, w_y)$.",
"The wind as *perceived* by a moving observer is:",
"$$\\mathbf{w}_{\\text{app}} = \\mathbf{w} - \\mathbf{... | # Finding the Wind's Speed
## Setting Up the Problem
I'll use a coordinate system with **East = +x** and **North = +y**. Let the (constant) wind velocity be $\mathbf{w} = (w_x,\, w_y)$.
The wind as *perceived* by a moving observer is:
$$\mathbf{w}_{\text{app}} = \mathbf{w} - \mathbf{v}_{\text{man}}$$
## Case 1: Ma... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00234 |
Programming | - | medium | For a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.
Constraints
* $1 \leq n \leq 10,000$
* $0 \leq c_i \leq 100,000$
* $|E| < 500,000$
* All vertices are reachable from vertex $0... | [
"```python\nimport sys\nimport heapq",
"def main():\n data = sys.stdin.buffer.read().split()\n idx = 0\n n = int(data[idx]); idx += 1",
"adj = [[] for _ in range(n)]\n for _ in range(n):\n u = int(data[idx]); idx += 1\n k = int(data[idx]); idx += 1\n for _ in range(k):\n ... | ```python
import sys
import heapq
def main():
data = sys.stdin.buffer.read().split()
idx = 0
n = int(data[idx]); idx += 1
adj = [[] for _ in range(n)]
for _ in range(n):
u = int(data[idx]); idx += 1
k = int(data[idx]); idx += 1
for _ in range(k):
v = int(dat... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00235 |
Mathematics | - | easy | Among the following events, the ones that are random events are ( )
(1) Tossing a coin twice in a row and getting heads both times. (2) Opposite charges attract each other.
(3) Water freezes at 1℃ under standard atmospheric pressure. (4) Rolling a die and getting an even number on top.
A: (1) (2)
B: (2) (3)
... | [
"# Identifying Random Events",
"A **random event** (probable event) is one that may or may not occur under given conditions.",
"Let me analyze each event:",
"| Event | Analysis | Classification |\n|-------|----------|---------------|\n| (1) Tossing a coin twice, getting heads both times | Possible outcomes: H... | # Identifying Random Events
A **random event** (probable event) is one that may or may not occur under given conditions. Let me analyze each event:
| Event | Analysis | Classification |
|-------|----------|---------------|
| (1) Tossing a coin twice, getting heads both times | Possible outcomes: HH, HT, TH, TT. Heads... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00236 |
Science | - | hard | How does multi-omics integration across transcriptomic, proteomic, and metabolomic layers quantitatively predict emergent phenotypic robustness in synthetic gene circuits under stochastic environmental fluctuations? | [
"# Multi-Omics Integration for Quantitative Prediction of Robustness in Synthetic Gene Circuits",
"This question sits at the very frontier where synthetic biology meets systems-level quantitative prediction.",
"The honest short answer is that no single framework currently delivers a closed-form, predictive mapp... | # Multi-Omics Integration for Quantitative Prediction of Robustness in Synthetic Gene Circuits
This question sits at the very frontier where synthetic biology meets systems-level quantitative prediction. The honest short answer is that no single framework currently delivers a closed-form, predictive mapping from multi... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00237 |
Science | - | hard | What are the mechanistic links between dendritic spine nanostructure remodeling, activity‑dependent transcriptional programs, and emergent network oscillations that underlie the consolidation of episodic memory across hippocampal subfields? | [
"# From Spine Nanostructure to Hippocampal Oscillations: A Multi-Scale Mechanistic Account of Episodic Memory Consolidation",
"This question sits at the intersection of several research fronts that are only now being stitched together.",
"What follows is a mechanistic chain traced from the ~100 nm scale of the ... | # From Spine Nanostructure to Hippocampal Oscillations: A Multi-Scale Mechanistic Account of Episodic Memory Consolidation
This question sits at the intersection of several research fronts that are only now being stitched together. What follows is a mechanistic chain traced from the ~100 nm scale of the dendritic spin... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00238 |
Mathematics | - | medium | Let \((r_n)\) and \((s_n)\) be sequences of positive real numbers. Suppose that for every \(\epsilon>0\), the inequality \(r_{n}^{1+\epsilon}<s_n^{\epsilon}\) holds for all \(n\) sufficiently large. If for every \(\epsilon>0\), \(\lim_{n\to\infty}s_{n}^{\epsilon}=0\), determine whether \(\lim_{n\to\infty}r_{n}=0\). | [
"# Proving $\\displaystyle\\lim_{n\\to\\infty} r_n = 0$",
"## Setting Up the Key Inequality",
"Fix an arbitrary $\\varepsilon > 0$.",
"By hypothesis, there exists $N_1$ such that for all $n \\ge N_1$:",
"$$r_n^{\\,1+\\varepsilon} < s_n^{\\,\\varepsilon}.$$",
"Raising both sides to the power $\\frac{1}{1+\... | # Proving $\displaystyle\lim_{n\to\infty} r_n = 0$
## Setting Up the Key Inequality
Fix an arbitrary $\varepsilon > 0$. By hypothesis, there exists $N_1$ such that for all $n \ge N_1$:
$$r_n^{\,1+\varepsilon} < s_n^{\,\varepsilon}.$$
Raising both sides to the power $\frac{1}{1+\varepsilon}$ (which is monotone on $(... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00239 |
Programming | Python | hard | Inna is fed up with jokes about female logic. So she started using binary logic instead.
Inna has an array of n elements a1[1], a1[2], ..., a1[n]. Girl likes to train in her binary logic, so she does an exercise consisting of n stages: on the first stage Inna writes out all numbers from array a1, on the i-th (i ≥ 2) s... | [
"Looking at this problem, I need to find the sum of all elements in a triangle built by repeatedly applying bitwise AND.",
"**Key Insight:** Since AND is bitwise, I can handle each bit independently.",
"For bit `b`, define `c[i] = 1` if bit `b` is set in `a[i]`, else `0`.",
"The AND of a contiguous subarray e... | Looking at this problem, I need to find the sum of all elements in a triangle built by repeatedly applying bitwise AND.
**Key Insight:** Since AND is bitwise, I can handle each bit independently. For bit `b`, define `c[i] = 1` if bit `b` is set in `a[i]`, else `0`. The AND of a contiguous subarray equals 1 iff ALL ele... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00240 |
Artificial Intelligence | Logic Puzzle | medium | A boat is floating in a small pool with a heavy rock resting on the deck. If the rock is thrown into the water and sinks to the bottom, will the water level of the pool rise or fall? | [
"# The Water Level **Falls**",
"## Setting Up the Comparison",
"The key is to compare how much water the rock displaces in each situation.",
"**Rock in the boat (floating):**\nThe rock is part of the boat's load.",
"By Archimedes' principle, the boat displaces water equal to the *weight* of everything on bo... | # The Water Level **Falls**
## Setting Up the Comparison
The key is to compare how much water the rock displaces in each situation.
**Rock in the boat (floating):**
The rock is part of the boat's load. By Archimedes' principle, the boat displaces water equal to the *weight* of everything on board. The rock's contrib... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00241 |
Programming | Python | hard | A fashion tour consists of $$$m$$$ identical runway shows in different cities. There are $$$n$$$ models willing to participate in the tour, numbered from $$$1$$$ to $$$n$$$. People in different cities have different views on the fashion industry, so they rate each model differently. In particular, people in city $$$i$$... | [
"Looking at this problem, I need to find the maximum-weight chain in a partial order where model $a$ can precede model $b$ iff $r_{i,a} < r_{i,b}$ for **all** cities $i$.",
"**Key Insight:** Each model $b$ has a set of valid predecessors $\\text{pred}(b) = \\{a : r_{i,a} < r_{i,b} \\;\\forall\\, i\\}$.",
"I can... | Looking at this problem, I need to find the maximum-weight chain in a partial order where model $a$ can precede model $b$ iff $r_{i,a} < r_{i,b}$ for **all** cities $i$.
**Key Insight:** Each model $b$ has a set of valid predecessors $\text{pred}(b) = \{a : r_{i,a} < r_{i,b} \;\forall\, i\}$. I can compute this using ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00242 |
Artificial Intelligence | Logic Puzzle | easy | If I had $500 in my pocket and spent $200 on a jacket, how much money would I have in my pocket now? | [
"You would have **$300** left in your pocket.",
"($500 − $200 = $300)"
] | You would have **$300** left in your pocket.
($500 − $200 = $300) | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00243 |
Programming | - | hard | Write a Node.js script that backs up files older than 38 days to a dated archive folder, sends a summary email on completion, and logs each operation. Write clean, well-commented code with error handling and a usage example. | [
"# Node.js File Backup & Archive Script",
"Below is a complete, production-ready script.",
"It scans a target directory, archives files older than a configurable threshold into a dated folder, emails a summary, and logs every step.",
"## Project Setup",
"```bash\nmkdir file-backup-tool && cd file-backup-too... | # Node.js File Backup & Archive Script
Below is a complete, production-ready script. It scans a target directory, archives files older than a configurable threshold into a dated folder, emails a summary, and logs every step.
## Project Setup
```bash
mkdir file-backup-tool && cd file-backup-tool
npm init -y
npm insta... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00244 |
Programming | - | medium | Write a function to check if a number can be rearranged to form a power of 2.
Given a positive integer N, return true if and only if the number can be rearranged to form a power of 2. In other words, determine if the digits of N can be rearranged to form a number that is a power of 2.
Solve the problem starting with ... | [
"```python\nclass Solution:\n def can_rearrange_to_power_of_2(self, n: int) -> bool:\n target = sorted(str(n))",
"for k in range(0, 63):\n p = 1 << k\n if sorted(str(p)) == target:\n return True\n return False\n```",
"**How it works:**",
"1. **Compute the ... | ```python
class Solution:
def can_rearrange_to_power_of_2(self, n: int) -> bool:
target = sorted(str(n))
for k in range(0, 63):
p = 1 << k
if sorted(str(p)) == target:
return True
return False
```
**How it works:**
1. **Compute the sorted di... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00245 |
Mathematics | - | easy | The sum of three five-digit numbers of the form $\overline{\text { mat31 }}, \overline{\text { mat41 }}, \overline{\text { mat51 }}$ is 202023. What is $m+a+t$? | [
"# Finding $m + a + t$",
"## Setting Up the Equation",
"The three five-digit numbers are:\n$$\\overline{mat31},\\quad \\overline{mat41},\\quad \\overline{mat51}$$",
"where $m$, $a$, $t$ are single digits.",
"I can express them as:",
"$$\\overline{mat31} = 10000m + 1000a + 100t + 31$$\n$$\\overline{mat41} ... | # Finding $m + a + t$
## Setting Up the Equation
The three five-digit numbers are:
$$\overline{mat31},\quad \overline{mat41},\quad \overline{mat51}$$
where $m$, $a$, $t$ are single digits. I can express them as:
$$\overline{mat31} = 10000m + 1000a + 100t + 31$$
$$\overline{mat41} = 10000m + 1000a + 100t + 41$$
$$\o... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00246 |
Programming | - | medium | Given two values N and M. Give the value when N is halved M-1 times. Example 1: Input: N = 100, M = 4 Output: 12 Explaination: The sequence of numbers is 100, 50, 25, 12. Example 2: Input: N = 10, M = 5 Output: 0 Explaination: The sequence is 10, 5, 2, 1 and 0. Your Task: You do not need to read input or print anything... | [
"Looking at this problem, I need to halve N exactly M-1 times using integer division.",
"**Key Insight:** Repeatedly dividing by 2 (floor division) is equivalent to right-shifting by (M-1) bits, which is the same as `N // (2^(M-1))`.",
"Let me verify with the examples:\n- N=100, M=4: 100 >> 3 = 12 ✓ (100→50→25→... | Looking at this problem, I need to halve N exactly M-1 times using integer division.
**Key Insight:** Repeatedly dividing by 2 (floor division) is equivalent to right-shifting by (M-1) bits, which is the same as `N // (2^(M-1))`.
Let me verify with the examples:
- N=100, M=4: 100 >> 3 = 12 ✓ (100→50→25→12)
- N=10, M=... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00247 |
Artificial Intelligence | Tracking Shuffled Objects Five Objects | medium | Alice, Bob, Claire, Dave, and Eve are friends and avid readers who occasionally trade books. At the start of the semester, they each buy one new book: Alice gets Catch-22, Bob gets Moby Dick, Claire gets Hound of the Baskervilles, Dave gets Lolita, and Eve gets The Odyssey.
As the semester proceeds, they start trading ... | [
"## Tracking the Books Through Each Swap",
"**Initial state:**\n| Person | Book |\n|--------|------|\n| Alice | Catch-22 |\n| Bob | Moby Dick |\n| Claire | Hound of the Baskervilles |\n| Dave | Lolita |\n| Eve | The Odyssey |",
"**Swap 1 – Eve ↔ Bob:**\n| Person | Book |\n|--------|------|\n| Alice | Catch-22 |... | ## Tracking the Books Through Each Swap
**Initial state:**
| Person | Book |
|--------|------|
| Alice | Catch-22 |
| Bob | Moby Dick |
| Claire | Hound of the Baskervilles |
| Dave | Lolita |
| Eve | The Odyssey |
**Swap 1 – Eve ↔ Bob:**
| Person | Book |
|--------|------|
| Alice | Catch-22 |
| Bob | The Odyssey |
... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00248 |
Programming | Python | hard | Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types of geometric figures. The number of figures of type ki and figure cost ci is kno... | [
"Looking at this problem, I need to maximize points by strategically ordering which figures to destroy at which factor level.",
"**Key Insight:** To maximize total points, I should assign the most expensive figures (highest `ci`) to the highest factor levels.",
"This follows from the rearrangement inequality.",... | Looking at this problem, I need to maximize points by strategically ordering which figures to destroy at which factor level.
**Key Insight:** To maximize total points, I should assign the most expensive figures (highest `ci`) to the highest factor levels. This follows from the rearrangement inequality.
**Algorithm:**... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00249 |
Programming | Cpp | medium | You have a sequence A composed of N positive integers: A_{1}, A_{2}, \cdots, A_{N}.
You will now successively do the following Q operations:
* In the i-th operation, you replace every element whose value is B_{i} with C_{i}.
For each i (1 \leq i \leq Q), find S_{i}: the sum of all elements in A just after the i-th o... | [
"Looking at this problem, I need to efficiently track the sum after each batch replacement operation.",
"**Key Insight:** Instead of modifying individual elements, I track the **frequency count** of each value and maintain the **total sum**.",
"When replacing all `B` with `C`:\n- The sum changes by `count[B] × ... | Looking at this problem, I need to efficiently track the sum after each batch replacement operation.
**Key Insight:** Instead of modifying individual elements, I track the **frequency count** of each value and maintain the **total sum**. When replacing all `B` with `C`:
- The sum changes by `count[B] × (C - B)`
- Then... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00250 |
Science | - | hard | How does epistatic interaction among polygenic traits influence the rate of adaptive peak shifts in fluctuating environments, considering both genetic drift and gene flow across heterogeneous landscapes? | [
"# Epistasis, Drift, Gene Flow, and Adaptive Peak Shifting in Fluctuating, Heterogeneous Landscapes",
"This question sits at the confluence of quantitative genetics, population genetics, and landscape evolution.",
"The answer is not a single trajectory but a set of interacting, sometimes opposing, forces whose ... | # Epistasis, Drift, Gene Flow, and Adaptive Peak Shifting in Fluctuating, Heterogeneous Landscapes
This question sits at the confluence of quantitative genetics, population genetics, and landscape evolution. The answer is not a single trajectory but a set of interacting, sometimes opposing, forces whose net effect is ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00251 |
Mathematics | - | easy | [Coordinate method on the plane $]$
Form the equation of the line passing through the point $M(-3 ; 2)$ parallel to the line $2 x-3 y+4=0$.
# | [
"# Equation of a Parallel Line",
"## Key Idea",
"A line **parallel** to $2x - 3y + 4 = 0$ has the **same** coefficients of $x$ and $y$, so it takes the form:",
"$$2x - 3y + C = 0$$",
"## Finding $C$",
"Substitute the point $M(-3,\\,2)$:",
"$$2(-3) - 3(2) + C = 0$$\n$$-6 - 6 + C = 0$$\n$$C = 12$$",
"##... | # Equation of a Parallel Line
## Key Idea
A line **parallel** to $2x - 3y + 4 = 0$ has the **same** coefficients of $x$ and $y$, so it takes the form:
$$2x - 3y + C = 0$$
## Finding $C$
Substitute the point $M(-3,\,2)$:
$$2(-3) - 3(2) + C = 0$$
$$-6 - 6 + C = 0$$
$$C = 12$$
## Result
$$\boxed{2x - 3y + 12 = 0}$... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00252 |
Artificial Intelligence | Logic Puzzle | medium | A flagpole is standing in a field. At 10 AM, its shadow points exactly toward the Northeast. In which direction is the sun located? | [
"## The Sun is in the **Southwest**.",
"A shadow is always cast in the direction **opposite** the light source.",
"Since the flagpole's shadow points **Northeast**, the sun must be located in the exact opposite direction: **Southwest**.",
"You can verify this with a simple compass: Northeast (NE) and Southwes... | ## The Sun is in the **Southwest**.
A shadow is always cast in the direction **opposite** the light source. Since the flagpole's shadow points **Northeast**, the sun must be located in the exact opposite direction: **Southwest**.
You can verify this with a simple compass: Northeast (NE) and Southwest (SW) are directl... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00253 |
Mathematics | - | hard | Find the number of sets $(a, b, c, d, e, f)$ taken from the set ${0, 1, 2, \ldots, p-1}$ such that $a^2 + b^2 + c^2 \equiv d^2 + e^2 + f^2 \pmod{p}$, where $p$ is an odd prime number. | [
"# Counting Solutions to $a^2+b^2+c^2 \\equiv d^2+e^2+f^2 \\pmod{p}$",
"## Setting Up the Count",
"Let $r_3(n)$ denote the number of ordered triples $(a,b,c) \\in (\\mathbb{Z}/p\\mathbb{Z})^3$ satisfying $a^2+b^2+c^2 \\equiv n \\pmod{p}$.",
"The desired count is:",
"$$N = \\sum_{n=0}^{p-1} r_3(n)^2$$",
"#... | # Counting Solutions to $a^2+b^2+c^2 \equiv d^2+e^2+f^2 \pmod{p}$
## Setting Up the Count
Let $r_3(n)$ denote the number of ordered triples $(a,b,c) \in (\mathbb{Z}/p\mathbb{Z})^3$ satisfying $a^2+b^2+c^2 \equiv n \pmod{p}$. The desired count is:
$$N = \sum_{n=0}^{p-1} r_3(n)^2$$
## Computing $r_3(n)$ via Character... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00254 |
Programming | Python | medium | Polycarp plays "Game 23". Initially he has a number $n$ and his goal is to transform it to $m$. In one move, he can multiply $n$ by $2$ or multiply $n$ by $3$. He can perform any number of moves.
Print the number of moves needed to transform $n$ to $m$. Print -1 if it is impossible to do so.
It is easy to prove that ... | [
"We need to transform `n` into `m` using only multiplications by `2` and `3`.",
"If it is possible, then:",
"\\[\nm = n \\cdot 2^a \\cdot 3^b\n\\]",
"So:",
"\\[\n\\frac{m}{n} = 2^a \\cdot 3^b\n\\]",
"Therefore:",
"1. `m` must be divisible by `n`.\n2.",
"The ratio `m / n` must contain only prime factor... | We need to transform `n` into `m` using only multiplications by `2` and `3`.
If it is possible, then:
\[
m = n \cdot 2^a \cdot 3^b
\]
So:
\[
\frac{m}{n} = 2^a \cdot 3^b
\]
Therefore:
1. `m` must be divisible by `n`.
2. The ratio `m / n` must contain only prime factors `2` and `3`.
3. The number of moves is the to... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00255 |
Programming | - | medium | Given an array of n distinct elements. Find the minimum number of swaps required to sort the array in strictly increasing order. Example 1: Input: nums = {2, 8, 5, 4} Output: 1 Explaination: swap 8 with 4. Example 2: Input: nums = {10, 19, 6, 3, 5} Output: 2 Explaination: swap 10 with 3 and swap 19 with 5. Your Task: Y... | [
"Looking at this problem, I need to find the minimum number of swaps to sort an array of distinct elements.",
"**Key Insight:** The minimum number of swaps equals the sum of (cycle_length - 1) for all cycles in the permutation that maps each element to its correct sorted position.",
"**Approach:**\n1.",
"Sort... | Looking at this problem, I need to find the minimum number of swaps to sort an array of distinct elements.
**Key Insight:** The minimum number of swaps equals the sum of (cycle_length - 1) for all cycles in the permutation that maps each element to its correct sorted position.
**Approach:**
1. Sort the array to deter... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00256 |
Mathematics | - | medium | Given the sequence defined by \( c_{n+1} = c_n \left(1 - \frac{1}{n}\right) + \beta_n \), where \(\beta_n\) is any function satisfying \(\lim_{n \to \infty} \beta_n n^2 = 0\), find the limit of \( c_n \). | [
"# Finding the Limit of the Sequence $c_n$",
"## Setting Up the Recurrence",
"The recurrence is:\n$$c_{n+1} = c_n\\left(1 - \\frac{1}{n}\\right) + \\beta_n = \\frac{n-1}{n}\\,c_n + \\beta_n, \\qquad n \\ge 2.$$",
"This is a **first-order linear (non-homogeneous) recurrence**.",
"I'll solve it explicitly.",
... | # Finding the Limit of the Sequence $c_n$
## Setting Up the Recurrence
The recurrence is:
$$c_{n+1} = c_n\left(1 - \frac{1}{n}\right) + \beta_n = \frac{n-1}{n}\,c_n + \beta_n, \qquad n \ge 2.$$
This is a **first-order linear (non-homogeneous) recurrence**. I'll solve it explicitly.
## Solving the Recurrence
The ho... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00257 |
Programming | - | hard | Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it's impossible to get from some snow drifts to some other by any sequence of moves... | [
"Looking at this problem, I need to understand the movement: Bajtek slides from a snow drift in a cardinal direction until hitting another snow drift.",
"This means two drifts are connected if they share an x-coordinate (same column) and are adjacent when sorted by y, or share a y-coordinate (same row) and are ad... | Looking at this problem, I need to understand the movement: Bajtek slides from a snow drift in a cardinal direction until hitting another snow drift. This means two drifts are connected if they share an x-coordinate (same column) and are adjacent when sorted by y, or share a y-coordinate (same row) and are adjacent whe... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00258 |
Programming | - | hard | Build a read-heavy endpoints (list + detail) with write support REST API for blog articles using Express.js (Node.js). Include: filtering by field, soft delete, rate limiting per IP, bulk delete endpoint. Add middleware for request logging and correlation IDs. | [
"# Blog Articles REST API — Express.js",
"A production-grade, read-optimized REST API with full CRUD, soft deletes, per-IP rate limiting, correlation tracing, and structured logging.",
"## Project Structure",
"```\nblog-api/\n├── package.json\n├── server.js\n├── app.js\n├── config/\n│ └── index.js\n├── midd... | # Blog Articles REST API — Express.js
A production-grade, read-optimized REST API with full CRUD, soft deletes, per-IP rate limiting, correlation tracing, and structured logging.
## Project Structure
```
blog-api/
├── package.json
├── server.js
├── app.js
├── config/
│ └── index.js
├── middleware/
│ ├── correlat... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00259 |
Artificial Intelligence | Logic Puzzle | easy | If the day before tomorrow is Friday, what day was the day after yesterday? | [
"Let's work through it step by step:",
"1. **\"The day before tomorrow is Friday.\"**\n The day before tomorrow is *today*.",
"So **today is Friday**.",
"2. **\"What day was the day after yesterday?\"**\n If today is Friday, then yesterday was **Thursday**.",
"The day *after* yesterday is **Friday**.",
"*... | Let's work through it step by step:
1. **"The day before tomorrow is Friday."**
The day before tomorrow is *today*. So **today is Friday**.
2. **"What day was the day after yesterday?"**
If today is Friday, then yesterday was **Thursday**. The day *after* yesterday is **Friday**.
**The answer is Friday.** | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00260 |
Mathematics | - | hard | How many three-digit positive integers $x$ are there with the property that $x$ and $2 x$ have only even digits? (One such number is $x=420$, since $2 x=840$ and each of $x$ and $2 x$ has only even digits.)
(A) 64
(B) 18
(C) 16
(D) 125
(E) 100 | [
"# Finding Three-Digit Integers Where Both $x$ and $2x$ Have Only Even Digits",
"## Setting Up Constraints",
"Since $x$ is three-digit, $2x \\leq 2(999) = 1998$.",
"If $2x$ were four-digit, its thousands digit would be **1** (odd), violating the even-digit requirement.",
"Therefore, **$2x$ must be three-dig... | # Finding Three-Digit Integers Where Both $x$ and $2x$ Have Only Even Digits
## Setting Up Constraints
Since $x$ is three-digit, $2x \leq 2(999) = 1998$. If $2x$ were four-digit, its thousands digit would be **1** (odd), violating the even-digit requirement. Therefore, **$2x$ must be three-digit**, meaning $x \leq 49... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00261 |
Mathematics | - | hard | Let \( E \) be a finite-dimensional vector space over \( \mathbb{C} \). Find the set of \( f \in L(E) \) such that for all \( x \in E \), the set \( { f^k(x) \mid k \geq 0 } \) is finite. | [
"Let \n\\[\n\\mathcal O_f(x)=\\{f^k(x)\\mid k\\ge 0\\}.\n\\]\nWe want the endomorphisms \\(f\\in L(E)\\) such that \\(\\mathcal O_f(x)\\) is finite for every \\(x\\in E\\).",
"The answer is:",
"\\[\n\\boxed{\\{\\,f\\in L(E)\\mid \\exists\\, n\\ge 1\\text{ such that }f^n \\text{ is a projection (idempotent)}\\,... | Let
\[
\mathcal O_f(x)=\{f^k(x)\mid k\ge 0\}.
\]
We want the endomorphisms \(f\in L(E)\) such that \(\mathcal O_f(x)\) is finite for every \(x\in E\).
The answer is:
\[
\boxed{\{\,f\in L(E)\mid \exists\, n\ge 1\text{ such that }f^n \text{ is a projection (idempotent)}\,\}}
\]
i.e.
\[
\boxed{\{\,f\in L(E)\mid \exist... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00262 |
Mathematics | - | medium | Solve the equation $x! + y! = z!$ where $x, y, z$ are natural numbers. | [
"# Solving $x! + y! = z!$ in Natural Numbers",
"## Setup and Symmetry",
"The equation is symmetric in $x$ and $y$, so assume **WLOG that $x \\leq y$**.",
"Since $x! + y! > y!$, we must have $z! > y!$, which forces",
"$$z > y \\quad\\Longrightarrow\\quad z \\geq y+1.$$",
"## Bounding $z!$",
"**Lower boun... | # Solving $x! + y! = z!$ in Natural Numbers
## Setup and Symmetry
The equation is symmetric in $x$ and $y$, so assume **WLOG that $x \leq y$**.
Since $x! + y! > y!$, we must have $z! > y!$, which forces
$$z > y \quad\Longrightarrow\quad z \geq y+1.$$
## Bounding $z!$
**Lower bound.** From $z \geq y+1$:
$$z! \geq... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00263 |
Mathematics | - | medium | Find the values of the parameter \( a \) for which the inequality \( a \cdot 9^x + 4(a - 1) \cdot 3^x + a > 1 \) is satisfied for all real values of \( x \). | [
"# Finding Parameter Values for a Quadratic Inequality in $3^x$",
"## Substitution",
"Let $t = 3^x$.",
"Since $x \\in \\mathbb{R}$, we have $t \\in (0,\\,+\\infty)$, and $9^x = t^2$.",
"The inequality becomes:",
"$$at^2 + 4(a-1)\\,t + (a-1) > 0 \\quad \\text{for all } t > 0.$$",
"Define $f(t) = at^2 + 4... | # Finding Parameter Values for a Quadratic Inequality in $3^x$
## Substitution
Let $t = 3^x$. Since $x \in \mathbb{R}$, we have $t \in (0,\,+\infty)$, and $9^x = t^2$. The inequality becomes:
$$at^2 + 4(a-1)\,t + (a-1) > 0 \quad \text{for all } t > 0.$$
Define $f(t) = at^2 + 4(a-1)\,t + (a-1)$ and analyze when $f(t... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00264 |
Science | - | hard | What are the mechanistic pathways by which activity‑dependent synaptic remodeling integrates calcium‑mediated transcriptional programs and microRNA‑driven local translation to modulate dendritic spine nanostructure during long‑term potentiation in vivo? | [
"# Activity-Dependent Synaptic Remodeling: Calcium, Transcription, and miRNA-Mediated Local Translation in LTP",
"This question sits at the intersection of at least four mechanistic layers that must be temporally and spatially coordinated.",
"Below is an integrated account of the known and emerging pathways, or... | # Activity-Dependent Synaptic Remodeling: Calcium, Transcription, and miRNA-Mediated Local Translation in LTP
This question sits at the intersection of at least four mechanistic layers that must be temporally and spatially coordinated. Below is an integrated account of the known and emerging pathways, organized from t... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00265 |
Programming | - | hard | Build a fully playable Asteroids clone game using HTML5 Canvas and pure JavaScript (no external libraries). Implement the following mechanics: collision detection between bullets/ship and asteroids; progressive difficulty increasing asteroid speed per level; score incrementing based on asteroid size; shooting bullets w... | [
"# Asteroids Clone",
"Here's a complete, fully playable Asteroids game in a single HTML file.",
"Save it as `asteroids.html` and open in any browser.",
"```html\n<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n<meta charset=\"UTF-8\">\n<title>Asteroids</title>\n<style>\n /* Full-screen dark canvas, no scrollbar... | # Asteroids Clone
Here's a complete, fully playable Asteroids game in a single HTML file. Save it as `asteroids.html` and open in any browser.
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>Asteroids</title>
<style>
/* Full-screen dark canvas, no scrollbars */
html, body {
margi... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00266 |
Programming | Cpp | hard | A wise man told Kerem "Different is good" once, so Kerem wants all things in his life to be different.
Kerem recently got a string s consisting of lowercase English letters. Since Kerem likes it when things are different, he wants all substrings of his string s to be distinct. Substring is a string formed by some num... | [
"Looking at this problem, I need to find the minimum changes to make all substrings distinct.",
"**Key Insight:** For all substrings to be distinct, all length-1 substrings (individual characters) must be distinct.",
"This is the tightest constraint since we only have 26 letters.",
"**Proof that distinct char... | Looking at this problem, I need to find the minimum changes to make all substrings distinct.
**Key Insight:** For all substrings to be distinct, all length-1 substrings (individual characters) must be distinct. This is the tightest constraint since we only have 26 letters.
**Proof that distinct characters suffice:** ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00267 |
Programming | - | hard | Build a complete, single-page tech startup landing page website using only HTML, CSS, and vanilla JavaScript (no frameworks). The design should be bold and colorful. Include: split-screen hero with form on one side; lazy-loading images using the loading='lazy' attribute; full-width parallax scrolling sections; CSS tran... | [
"# Tech Startup Landing Page",
"Here's a complete, production-ready single-file landing page.",
"Just save it as `index.html` and open it in a browser.",
"```html\n<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <meta charset=\"UTF-8\">\n <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0... | # Tech Startup Landing Page
Here's a complete, production-ready single-file landing page. Just save it as `index.html` and open it in a browser.
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta name="description" ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00268 |
Mathematics | - | medium | For what values of $x$ is the following expression defined
$$
\log _{3}\left(1-\log _{0,5}\left(x^{2}-2 x-2.5\right)\right) ?
$$ | [
"# Domain of $\\log_3\\!\\bigl(1 - \\log_{0.5}(x^2 - 2x - 2.5)\\bigr)$",
"## Setting Up the Constraints",
"For the expression to be defined, two conditions must hold simultaneously:",
"1. **Inner logarithm** requires its argument to be positive:\n$$x^2 - 2x - 2.5 > 0$$",
"2. **Outer logarithm** requires its... | # Domain of $\log_3\!\bigl(1 - \log_{0.5}(x^2 - 2x - 2.5)\bigr)$
## Setting Up the Constraints
For the expression to be defined, two conditions must hold simultaneously:
1. **Inner logarithm** requires its argument to be positive:
$$x^2 - 2x - 2.5 > 0$$
2. **Outer logarithm** requires its argument to be positive:
$... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00269 |
Programming | - | hard | problem
AOR Co., Ltd. is a $ N $ story building. There is no basement floor.
AOR Ika-chan is a squid, so she can go down the stairs, but not up.
I decided to install $ M $ elevators in the building because it would be inconvenient if I couldn't climb upstairs.
It takes time to install the elevator, and the $ i $ th e... | [
"Looking at this problem, I need to determine if a squid (who can only go DOWN stairs, not up) can travel between floors using stairs and available elevators.",
"**Key observations:**\n1.",
"The squid can go down freely via stairs (any number of floors)\n2.",
"To go UP, the squid needs elevators\n3.",
"Elev... | Looking at this problem, I need to determine if a squid (who can only go DOWN stairs, not up) can travel between floors using stairs and available elevators.
**Key observations:**
1. The squid can go down freely via stairs (any number of floors)
2. To go UP, the squid needs elevators
3. Elevator `i` is available at no... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00270 |
Mathematics | - | medium | Given that $a b c d e$ are real numbers such that
$$
a+b+c+d+e=8
$$
and
$$
a^{2}+b^{2}+c^{2}+d^{2}+e^{2}=16
$$
Determine the maximum value of $\lfloor e\rfloor$. | [
"# Finding the Maximum Value of ⌊e⌋",
"## Setting Up the Constraint on *e*",
"Let me isolate *e* from the two equations.",
"Define:",
"$$s = a + b + c + d = 8 - e, \\qquad Q = a^2 + b^2 + c^2 + d^2 = 16 - e^2$$",
"**Applying Cauchy–Schwarz** to the four numbers $a,b,c,d$:",
"$$a^2 + b^2 + c^2 + d^2 \\;\... | # Finding the Maximum Value of ⌊e⌋
## Setting Up the Constraint on *e*
Let me isolate *e* from the two equations. Define:
$$s = a + b + c + d = 8 - e, \qquad Q = a^2 + b^2 + c^2 + d^2 = 16 - e^2$$
**Applying Cauchy–Schwarz** to the four numbers $a,b,c,d$:
$$a^2 + b^2 + c^2 + d^2 \;\geq\; \frac{(a+b+c+d)^2}{4}$$
$... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00271 |
Artificial Intelligence | Logic Puzzle | easy | If you have a liter of pure alcohol and replace 100ml with water, then replace another 100ml of that mixture with water, what is the final concentration of alcohol in the bottle? | [
"## Final Concentration: **81%**",
"Here's the step-by-step breakdown:",
"### Start\n- 1000 ml of pure alcohol (100%)",
"### Step 1 – Remove 100 ml, add 100 ml water\nYou remove 100 ml of pure alcohol, leaving:\n- Alcohol: 1000 − 100 = **900 ml**\n- Water: **100 ml**\n- Total: 1000 ml → concentration = 900/10... | ## Final Concentration: **81%**
Here's the step-by-step breakdown:
### Start
- 1000 ml of pure alcohol (100%)
### Step 1 – Remove 100 ml, add 100 ml water
You remove 100 ml of pure alcohol, leaving:
- Alcohol: 1000 − 100 = **900 ml**
- Water: **100 ml**
- Total: 1000 ml → concentration = 900/1000 = **90%**
### Step... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00272 |
Artificial Intelligence | Logic Puzzle | easy | If a stock price drops by 50% on Monday and then rises by 50% on Tuesday, is the price higher, lower, or the same as Sunday morning? | [
"## The price is **lower**.",
"Here's why, with a concrete example.",
"Say the stock is **$100** on Sunday morning.",
"| Day | What happens | Price |\n|---|---|---|\n| Sunday | Starting price | **$100** |\n| Monday | Drops 50% → 100 × 0.50 | **$50** |\n| Tuesday | Rises 50% → 50 × 1.50 | **$75** |",
"You en... | ## The price is **lower**.
Here's why, with a concrete example. Say the stock is **$100** on Sunday morning.
| Day | What happens | Price |
|---|---|---|
| Sunday | Starting price | **$100** |
| Monday | Drops 50% → 100 × 0.50 | **$50** |
| Tuesday | Rises 50% → 50 × 1.50 | **$75** |
You end up at **$75**, which is ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00273 |
Science | - | hard | In a multipartite quantum network employing high‑dimensional entangled photonic qudits, what are the necessary and sufficient conditions on the channel capacities and error‑correcting code structures to achieve fault‑tolerant distributed quantum computation under realistic loss and dephasing models? | [
"# Fault-Tolerant Distributed Quantum Computation with High-Dimensional Entangled Qudits",
"## Preliminary framing",
"A single, closed-form theorem that simultaneously characterises *necessary and sufficient* conditions for the full problem as stated — multipartite network, qudit dimension $d>2$, photonic loss ... | # Fault-Tolerant Distributed Quantum Computation with High-Dimensional Entangled Qudits
## Preliminary framing
A single, closed-form theorem that simultaneously characterises *necessary and sufficient* conditions for the full problem as stated — multipartite network, qudit dimension $d>2$, photonic loss + dephasing, ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00274 |
Programming | - | hard | Statistics claims that students sleep no more than three hours a day. But even in the world of their dreams, while they are snoring peacefully, the sense of impending doom is still upon them.
A poor student is dreaming that he is sitting the mathematical analysis exam. And he is examined by the most formidable profess... | [
"Looking at this problem, I need to determine if the fingers of the girl and boy can be interleaved such that:\n- No two girl's fingers are adjacent (need at least one boy's finger between them)\n- No three boy's fingers are adjacent (at most two boy's fingers in a row)",
"**Key Insight:** When they hold hands, i... | Looking at this problem, I need to determine if the fingers of the girl and boy can be interleaved such that:
- No two girl's fingers are adjacent (need at least one boy's finger between them)
- No three boy's fingers are adjacent (at most two boy's fingers in a row)
**Key Insight:** When they hold hands, it's a seque... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00275 |
Programming | - | hard | Construct a convolutional neural network for the purpose of identifying handwritten numerals using the MNIST datastore that is readily accessible within the keras.datasets.mnist module in Python. Subsequently, illustrate the evolution of model precision and error rate throughout the training epochs. | [
"# CNN for MNIST Handwritten Digit Recognition",
"Below is a complete, self-contained Python script that builds a Convolutional Neural Network, trains it on the MNIST dataset, and visualizes the training/validation accuracy and loss curves across epochs.",
"## Full Implementation",
"```python\nimport numpy as... | # CNN for MNIST Handwritten Digit Recognition
Below is a complete, self-contained Python script that builds a Convolutional Neural Network, trains it on the MNIST dataset, and visualizes the training/validation accuracy and loss curves across epochs.
## Full Implementation
```python
import numpy as np
import matplot... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00276 |
Science | - | hard | In the context of quantum gravity, how does the emergence of spacetime geometry from entanglement entropy in holographic tensor network models reconcile with the renormalization group flow of non‑perturbative gauge theories at strong coupling? | [
"# Spacetime from Entanglement vs.",
"Strong-Coupling RG Flow: The Holographic Reconciliation",
"This is one of the deepest structural questions in modern theoretical physics, and the short answer is that the two frameworks are not merely compatible—they are *the same physics seen from dual vantage points*.",
... | # Spacetime from Entanglement vs. Strong-Coupling RG Flow: The Holographic Reconciliation
This is one of the deepest structural questions in modern theoretical physics, and the short answer is that the two frameworks are not merely compatible—they are *the same physics seen from dual vantage points*. The tensor networ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00277 |
Programming | - | medium | The Rebel fleet is on the run. It consists of m ships currently gathered around a single planet. Just a few seconds ago, the vastly more powerful Empire fleet has appeared in the same solar system, and the Rebels will need to escape into hyperspace. In order to spread the fleet, the captain of each ship has independent... | [
"Looking at this problem, I need to:\n1.",
"Parse each expression `(a+b)/c`\n2.",
"Reduce the fraction `(a+b)/c` to its simplest form (divide by GCD)\n3.",
"Count how many ships share the same reduced fraction\n4.",
"Output the count for each ship",
"**Key insight:** Two fractions are equal if and only if... | Looking at this problem, I need to:
1. Parse each expression `(a+b)/c`
2. Reduce the fraction `(a+b)/c` to its simplest form (divide by GCD)
3. Count how many ships share the same reduced fraction
4. Output the count for each ship
**Key insight:** Two fractions are equal if and only if they reduce to the same `num/den... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00278 |
Programming | - | hard | Build a fully playable Space Invaders clone game using HTML5 Canvas and pure JavaScript (no external libraries). Implement the following mechanics: victory screen when all aliens are cleared; bonus UFO crossing the top of the screen periodically; player ship with left/right movement and shooting (spacebar); grid format... | [
"# Space Invaders Clone",
"A complete, single-file implementation.",
"Save as `space-invaders.html` and open in any browser.",
"**Controls:** `←`/`→` (or `A`/`D`) to move, `Space` to shoot, `Enter` to start/restart.",
"```html\n<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n<meta charset=\"UTF-8\">\n<title>Sp... | # Space Invaders Clone
A complete, single-file implementation. Save as `space-invaders.html` and open in any browser.
**Controls:** `←`/`→` (or `A`/`D`) to move, `Space` to shoot, `Enter` to start/restart.
```html
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title>Space Invaders</title>
<style>
... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00279 |
Science | - | hard | What are the implications of observed anisotropic seismic attenuation patterns in the lowermost mantle for the coupling between mantle convection and core‑generated magnetic field variations, and how can inverse modeling reconcile these observations with geodynamo simulations? | [
"# Anisotropic Seismic Attenuation in D″, Mantle–Core Coupling, and Geodynamo Reconciliation",
"## 1.",
"What the Lowermost-Mantle Attenuation Anisotropy Actually Encodes",
"The transition zone commonly called **D″** (roughly 2700–2891 km) is where shear-wave quality factor Q_s drops to values of 50–200 (vers... | # Anisotropic Seismic Attenuation in D″, Mantle–Core Coupling, and Geodynamo Reconciliation
## 1. What the Lowermost-Mantle Attenuation Anisotropy Actually Encodes
The transition zone commonly called **D″** (roughly 2700–2891 km) is where shear-wave quality factor Q_s drops to values of 50–200 (versus ~200–400 in the... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00280 |
Mathematics | - | easy | Which of the following sets of numbers can be the lengths of the sides of a right triangle?
A: $2$, $3$, $4$
B: $3$, $4$, $5$
C: $4$, $5$, $6$
D: $5$, $6$, $7$ | [
"# Right Triangle Side Lengths",
"To determine which set forms a right triangle, I need to check whether the sides satisfy the **Pythagorean theorem**: $a^2 + b^2 = c^2$, where $c$ is the longest side.",
"## Checking Each Option",
"| Option | $a^2 + b^2$ | $c^2$ | Right Triangle? |\n|--------|-------------|--... | # Right Triangle Side Lengths
To determine which set forms a right triangle, I need to check whether the sides satisfy the **Pythagorean theorem**: $a^2 + b^2 = c^2$, where $c$ is the longest side.
## Checking Each Option
| Option | $a^2 + b^2$ | $c^2$ | Right Triangle? |
|--------|-------------|--------|-----------... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00281 |
Programming | - | hard | Use dynamic programming in Go to solve the longest common subsequence of two strings (return length and the subsequence itself). Reconstruct the optimal solution (not just its value) and trace through the backtracking. | [
"# Longest Common Subsequence in Go — Full DP + Backtracking Trace",
"## The Algorithm",
"The classic DP recurrence:",
"```\ndp[i][j] = dp[i-1][j-1] + 1 if s1[i-1] == s2[j-1]\n max(dp[i-1][j], dp[i][j-1]) otherwise\n```",
"After filling the table, we **backtrack** from `dp[m][n]` to `dp[0... | # Longest Common Subsequence in Go — Full DP + Backtracking Trace
## The Algorithm
The classic DP recurrence:
```
dp[i][j] = dp[i-1][j-1] + 1 if s1[i-1] == s2[j-1]
max(dp[i-1][j], dp[i][j-1]) otherwise
```
After filling the table, we **backtrack** from `dp[m][n]` to `dp[0][0]` to recover the act... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00282 |
Programming | - | medium | Sasha grew up and went to first grade. To celebrate this event her mother bought her a multiplication table M with n rows and n columns such that M_{ij}=a_i ⋅ a_j where a_1, ..., a_n is some sequence of positive integers.
Of course, the girl decided to take it to school with her. But while she was having lunch, hoolig... | [
"Looking at this problem, I need to reconstruct array `a` from a multiplication table where `M[i][j] = a[i] * a[j]` for `i ≠ j`.",
"**Key Insight:** For any three distinct indices `i, j, k`:\n- `M[i][j] * M[i][k] / M[j][k] = (a[i]*a[j]) * (a[i]*a[k]) / (a[j]*a[k]) = a[i]²`",
"So for each index `i`, I can pick a... | Looking at this problem, I need to reconstruct array `a` from a multiplication table where `M[i][j] = a[i] * a[j]` for `i ≠ j`.
**Key Insight:** For any three distinct indices `i, j, k`:
- `M[i][j] * M[i][k] / M[j][k] = (a[i]*a[j]) * (a[i]*a[k]) / (a[j]*a[k]) = a[i]²`
So for each index `i`, I can pick any two other i... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00283 |
Mathematics | - | medium | Evaluate the integral \(\int_{0}^{2\pi}\frac{d\theta}{3+\sin\theta+\cos\theta}\) using the substitution \(z = e^{i\theta}\), \(d\theta = \frac{dz}{iz}\), \(\sin\theta = \frac{1}{2i}\left(z - \frac{1}{z}\right)\), and \(\cos\theta = \frac{1}{2}\left(z + \frac{1}{z}\right)\). | [
"# Evaluating $\\displaystyle\\int_{0}^{2\\pi}\\frac{d\\theta}{3+\\sin\\theta+\\cos\\theta}$ via $z = e^{i\\theta}$",
"## Setting Up the Contour Integral",
"With $z = e^{i\\theta}$, the unit circle $|z|=1$ is traversed counterclockwise once.",
"Substituting:",
"$$3 + \\sin\\theta + \\cos\\theta = 3 + \\frac... | # Evaluating $\displaystyle\int_{0}^{2\pi}\frac{d\theta}{3+\sin\theta+\cos\theta}$ via $z = e^{i\theta}$
## Setting Up the Contour Integral
With $z = e^{i\theta}$, the unit circle $|z|=1$ is traversed counterclockwise once. Substituting:
$$3 + \sin\theta + \cos\theta = 3 + \frac{1}{2i}\!\left(z - \frac{1}{z}\right) ... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00284 |
Science | - | hard | In a population of asexual organisms undergoing clonal interference, formulate a stochastic differential equation that captures the coupled dynamics of beneficial mutation accumulation and epistatic fitness landscapes, and determine the asymptotic fixation probability under fluctuating environmental selection pressures... | [
"# Stochastic Dynamics of Clonal Interference on Epistatic Landscapes with Fluctuating Selection",
"## 1.",
"Setup and Notation",
"Consider an asexual population of constant size $N \\gg 1$ evolving on a finite landscape of $L$ potentially beneficial mutation sites.",
"A genotype is a subset $\\mathcal{S} \... | # Stochastic Dynamics of Clonal Interference on Epistatic Landscapes with Fluctuating Selection
## 1. Setup and Notation
Consider an asexual population of constant size $N \gg 1$ evolving on a finite landscape of $L$ potentially beneficial mutation sites. A genotype is a subset $\mathcal{S} \subseteq \{1,\dots,L\}$ o... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00285 |
Programming | Python | medium | Ankit has a set of numbers and has recently studied set theory. He has created a power set of this set and is writing a program to compute sum of all elements of all the subsets in power set.
Power set of a set S is defined as set of all possible subsets of S.
Set S consist of all the number from 1 to N.
You need to... | [
"# Solution",
"## Analysis",
"For a set S = {1, 2, ..., N}, the power set has 2^N subsets.",
"Each element x in S appears in exactly **2^(N-1)** subsets (in half of all subsets, x is present, in the other half it's absent).",
"So the total sum of all elements across all subsets is:",
"$$\\text{Answer} = \... | # Solution
## Analysis
For a set S = {1, 2, ..., N}, the power set has 2^N subsets. Each element x in S appears in exactly **2^(N-1)** subsets (in half of all subsets, x is present, in the other half it's absent).
So the total sum of all elements across all subsets is:
$$\text{Answer} = \left(\sum_{i=1}^{N} i\right... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00286 |
Programming | - | medium | Write a python function to find the second largest and second smallest number in a given list.
Solve the problem starting with the provided function header.
Function header:
```
def find_second_largest_smallest(lst):
```
Please place the solution code in the following format:
```python
# Your solution code here
``` | [
"```python\ndef find_second_largest_smallest(lst):\n \"\"\"\n Find the second largest and second smallest numbers in a given list.",
"Args:\n lst: A list of numbers.",
"Returns:\n A tuple containing (second_largest, second_smallest).",
"Raises:\n ValueError: If the list contains few... | ```python
def find_second_largest_smallest(lst):
"""
Find the second largest and second smallest numbers in a given list.
Args:
lst: A list of numbers.
Returns:
A tuple containing (second_largest, second_smallest).
Raises:
ValueError: If the list contai... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00287 |
Programming | Cpp | hard | Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them is as follows:
* Increment the number written at each edge along the... | [
"Looking at this problem, I need to determine if there exists a tree where every edge has an even count after all path-increment queries.",
"## Key Insight",
"For a tree edge $e$ that partitions vertices into sets $S$ and $V \\setminus S$, the edge is incremented once per query $(a_i, b_i)$ where exactly one en... | Looking at this problem, I need to determine if there exists a tree where every edge has an even count after all path-increment queries.
## Key Insight
For a tree edge $e$ that partitions vertices into sets $S$ and $V \setminus S$, the edge is incremented once per query $(a_i, b_i)$ where exactly one endpoint lies in... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00288 |
Programming | - | hard | Build a complete, single-page local business directory page website using only HTML, CSS, and vanilla JavaScript (no frameworks). The design should be retro-inspired. Include: responsive mobile-first layout using CSS Grid; accessible ARIA labels and semantic HTML5 landmark elements; sticky navigation bar with smooth-sc... | [
"# Retro Local Business Directory",
"A complete single-page website in one file.",
"Save as `index.html` and open in any browser.",
"```html\n<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <!-- ============================================\n RETRO LOCALS — Business Directory\n Single-file page: HTM... | # Retro Local Business Directory
A complete single-page website in one file. Save as `index.html` and open in any browser.
```html
<!DOCTYPE html>
<html lang="en">
<head>
<!-- ============================================
RETRO LOCALS — Business Directory
Single-file page: HTML + CSS + vanilla JS
... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00289 |
Science | - | hard | How does the interplay between mantle convection patterns and core-mantle boundary topography influence the temporal variability of Earth’s geomagnetic reversal frequency over multimillion-year timescales? | [
"# Mantle Convection, CMB Topography, and Geomagnetic Reversal Modulation",
"This sits at one of the most intricate couplings in Earth system science, and the honest answer is that a complete mechanistic chain is still under active investigation.",
"What follows is a synthesis of the leading hypotheses, the sup... | # Mantle Convection, CMB Topography, and Geomagnetic Reversal Modulation
This sits at one of the most intricate couplings in Earth system science, and the honest answer is that a complete mechanistic chain is still under active investigation. What follows is a synthesis of the leading hypotheses, the supporting (and c... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00290 |
Artificial Intelligence | Logic Puzzle | medium | A large boat is anchored in a lake with a heavy lead anchor sitting on the deck. If the anchor is thrown into the lake and it sinks to the bottom, will the water level of the lake rise, fall, or stay the same? | [
"# The Water Level Falls",
"This is a classic Archimedes' principle puzzle, and the answer is counterintuitive for many people.",
"## The Key: How the Anchor Displaces Water in Each Case",
"**Anchor on the deck (on the boat):**\nThe boat floats, so it displaces water equal to the *total weight* of everything ... | # The Water Level Falls
This is a classic Archimedes' principle puzzle, and the answer is counterintuitive for many people.
## The Key: How the Anchor Displaces Water in Each Case
**Anchor on the deck (on the boat):**
The boat floats, so it displaces water equal to the *total weight* of everything aboard. The anchor... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00291 |
Artificial Intelligence | Logic Puzzle | easy | In a race, Elena finished faster than Maya but slower than Sarah. Jax finished ahead of Maya but slower than Elena. Who came in last place? | [
"Let's sort out the finishing order:",
"- **Sarah > Elena > Maya** (from the first statement)\n- **Elena > Jax > Maya** (from the second statement)",
"Combining these:",
"**Sarah → Elena → Jax → Maya**",
"**Maya** came in last place."
] | Let's sort out the finishing order:
- **Sarah > Elena > Maya** (from the first statement)
- **Elena > Jax > Maya** (from the second statement)
Combining these:
**Sarah → Elena → Jax → Maya**
**Maya** came in last place. | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00292 |
Science | - | hard | What mechanistic pathways link heterogeneous catalyst surface site distributions, governed by nanoscale roughness and electronic structure, to the selectivity and turnover frequency in tandem oxidation–reduction reactions under non‑isothermal, high‑pressure reactor conditions? | [
"# Mechanistic Linkage of Nanoscale Site Heterogeneity to Selectivity and TOF in Tandem Oxidation–Reduction Catalysis",
"This is a genuinely multi-scale problem, and no single equation captures it.",
"The linkage unfolds through several coupled mechanistic layers, which I will trace from the atomic to the react... | # Mechanistic Linkage of Nanoscale Site Heterogeneity to Selectivity and TOF in Tandem Oxidation–Reduction Catalysis
This is a genuinely multi-scale problem, and no single equation captures it. The linkage unfolds through several coupled mechanistic layers, which I will trace from the atomic to the reactor scale, then... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00293 |
Mathematics | - | hard | Find the function \( f: \mathbb{R} \rightarrow \mathbb{R} \) that satisfies the equation:
\[ x^2 f(y) + y^2 f(x) = xy f(x + y) \] | [
"The solutions are exactly the linear functions",
"\\[\n\\boxed{f(x)=cx\\qquad (c\\in\\mathbb R)}.\n\\]",
"Proof:",
"Let the given equation be \\(P(x,y)\\).",
"1.",
"Put \\(x=0\\):",
"\\[\ny^2 f(0)=0 \\quad\\text{for all }y,\n\\]",
"so",
"\\[\nf(0)=0.\n\\]",
"2.",
"Let",
"\\[\nc=f(1).\n\\]",
... | The solutions are exactly the linear functions
\[
\boxed{f(x)=cx\qquad (c\in\mathbb R)}.
\]
Proof:
Let the given equation be \(P(x,y)\).
1. Put \(x=0\):
\[
y^2 f(0)=0 \quad\text{for all }y,
\]
so
\[
f(0)=0.
\]
2. Let
\[
c=f(1).
\]
From \(P(1,1)\),
\[
f(1)+f(1)=f(2),
\]
hence
\[
f(2)=2c.
\]
From \(P(2,-2)\... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00294 |
Programming | - | hard | Write a python function to find the maximum width ramp in a given array. A width ramp is defined as a pair of indices (i, j) where i <= j and nums[i] <= nums[j].
Solve the problem starting with the provided function header.
Function header:
```
class Solution:
def maxWidthRamp(self, nums):
```
Please place the solu... | [
"```python\nclass Solution:\n def maxWidthRamp(self, nums):\n n = len(nums)",
"# Step 1: Build a stack of candidate left indices.\n # Only indices where nums[i] is a new minimum are useful as left endpoints.\n # If nums[i] >= nums[stack[-1]], then stack[-1] is always a better left\n ... | ```python
class Solution:
def maxWidthRamp(self, nums):
n = len(nums)
# Step 1: Build a stack of candidate left indices.
# Only indices where nums[i] is a new minimum are useful as left endpoints.
# If nums[i] >= nums[stack[-1]], then stack[-1] is always a better left
... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00295 |
Science | - | hard | In what ways can quantum error‑correcting codes be adapted to protect continuous‑variable cluster states against non‑Gaussian noise, and how does the resulting fault‑tolerance threshold scale with squeezing resources and measurement imperfections? | [
"# Quantum Error Correction for Continuous-Variable Cluster States under Non-Gaussian Noise",
"## 1.",
"Setting the Stage: CV Cluster States and Their Vulnerabilities",
"A continuous-variable (CV) cluster state is a multi-mode graph state in which each node is a single oscillator (qumode) and each edge repres... | # Quantum Error Correction for Continuous-Variable Cluster States under Non-Gaussian Noise
## 1. Setting the Stage: CV Cluster States and Their Vulnerabilities
A continuous-variable (CV) cluster state is a multi-mode graph state in which each node is a single oscillator (qumode) and each edge represents two-mode enta... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00296 |
Mathematics | - | medium | The solution set of the equation $x^{2}+x-1=x \pi^{x^{2}-1}+\left(x^{2}-1\right) \pi^{x}$ is $A$ (where $\pi$ is an irrational number, $\pi=3.141 \cdots$, and $x$ is a real number), then the sum of the squares of all elements in $A$ is ( ).
A. 0
B. 1
C. 2
D. 4 | [
"# Finding the Sum of Squares of All Solutions",
"## Setting Up the Equation",
"Starting with: $x^2 + x - 1 = x\\pi^{x^2-1} + (x^2 - 1)\\pi^x$",
"Moving everything to the left side and regrouping:\n$$x^2 - (x^2-1)\\pi^x + x - x\\pi^{x^2-1} - 1 = 0$$\n$$x^2(1-\\pi^x) + x(1-\\pi^{x^2-1}) - (1-\\pi^x) = 0$$\n$$(... | # Finding the Sum of Squares of All Solutions
## Setting Up the Equation
Starting with: $x^2 + x - 1 = x\pi^{x^2-1} + (x^2 - 1)\pi^x$
Moving everything to the left side and regrouping:
$$x^2 - (x^2-1)\pi^x + x - x\pi^{x^2-1} - 1 = 0$$
$$x^2(1-\pi^x) + x(1-\pi^{x^2-1}) - (1-\pi^x) = 0$$
$$(x^2 - 1)(1 - \pi^x) + x(1 -... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00297 |
Artificial Intelligence | Logic Puzzle | easy | How many 's's are in the phrase 'the assessment was surprisingly successful'? | [
"Looking at the phrase **\"the assessment was surprisingly successful\"**, let me count the 's' in each word:",
"- **the** → 0\n- **a**s**s**e**ss**ment** → 4\n- **was** → 1\n- **s**urpr i**s**ingly → 2\n- **s**ucce**ss**ful → 3",
"**Total: 10**"
] | Looking at the phrase **"the assessment was surprisingly successful"**, let me count the 's' in each word:
- **the** → 0
- **a**s**s**e**ss**ment** → 4
- **was** → 1
- **s**urpr i**s**ingly → 2
- **s**ucce**ss**ful → 3
**Total: 10** | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00298 |
Artificial Intelligence | Logic Puzzle | easy | I currently have 15 books on my shelf. If I were to donate 7 of them tomorrow, how many books would I have right now? | [
"You would still have **15 books** right now.",
"The donation is hypothetical (\"*if* I were to\") and wouldn't happen until *tomorrow*.",
"Neither of those change what's on your shelf today."
] | You would still have **15 books** right now.
The donation is hypothetical ("*if* I were to") and wouldn't happen until *tomorrow*. Neither of those change what's on your shelf today. | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00299 |
Artificial Intelligence | Logic Puzzle | easy | A drone flies from point A to point B at 100 mph. It immediately turns around and flies back to A at 50 mph. What was the drone's average speed for the entire round trip? | [
"## Average Speed for the Round Trip",
"A common mistake is to average the two speeds: (100 + 50) / 2 = **75 mph**.",
"But that's wrong, because the drone spends *more time* flying at the slower speed.",
"**Average speed = Total Distance ÷ Total Time**",
"Let the one-way distance be *d*.",
"| Leg | Distan... | ## Average Speed for the Round Trip
A common mistake is to average the two speeds: (100 + 50) / 2 = **75 mph**. But that's wrong, because the drone spends *more time* flying at the slower speed.
**Average speed = Total Distance ÷ Total Time**
Let the one-way distance be *d*.
| Leg | Distance | Speed | Time |
|---|-... | Review the intermediate steps and independently check the final result against the question. | Skipping an assumption or accepting the final result without an independent check. | forge-ext-faunix-00300 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.