Instructions to use cs-552-2026-TopHaylin/math_model with libraries, inference providers, notebooks, and local apps. Follow these links to get started.
- Libraries
- Transformers
How to use cs-552-2026-TopHaylin/math_model with Transformers:
# Use a pipeline as a high-level helper from transformers import pipeline pipe = pipeline("text-generation", model="cs-552-2026-TopHaylin/math_model") messages = [ {"role": "user", "content": "Who are you?"}, ] pipe(messages)# Load model directly from transformers import AutoTokenizer, AutoModelForCausalLM tokenizer = AutoTokenizer.from_pretrained("cs-552-2026-TopHaylin/math_model") model = AutoModelForCausalLM.from_pretrained("cs-552-2026-TopHaylin/math_model", device_map="auto") messages = [ {"role": "user", "content": "Who are you?"}, ] inputs = tokenizer.apply_chat_template( messages, add_generation_prompt=True, tokenize=True, return_dict=True, return_tensors="pt", ).to(model.device) outputs = model.generate(**inputs, max_new_tokens=40) print(tokenizer.decode(outputs[0][inputs["input_ids"].shape[-1]:])) - Notebooks
- Google Colab
- Kaggle
- Local Apps Settings
- vLLM
How to use cs-552-2026-TopHaylin/math_model with vLLM:
Install from pip and serve model
# Install vLLM from pip: pip install vllm # Start the vLLM server: vllm serve "cs-552-2026-TopHaylin/math_model" # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:8000/v1/chat/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "cs-552-2026-TopHaylin/math_model", "messages": [ { "role": "user", "content": "What is the capital of France?" } ] }'Use Docker
docker model run hf.co/cs-552-2026-TopHaylin/math_model
- SGLang
How to use cs-552-2026-TopHaylin/math_model with SGLang:
Install from pip and serve model
# Install SGLang from pip: pip install sglang # Start the SGLang server: python3 -m sglang.launch_server \ --model-path "cs-552-2026-TopHaylin/math_model" \ --host 0.0.0.0 \ --port 30000 # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:30000/v1/chat/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "cs-552-2026-TopHaylin/math_model", "messages": [ { "role": "user", "content": "What is the capital of France?" } ] }'Use Docker images
docker run --gpus all \ --shm-size 32g \ -p 30000:30000 \ -v ~/.cache/huggingface:/root/.cache/huggingface \ --env "HF_TOKEN=<secret>" \ --ipc=host \ lmsysorg/sglang:latest \ python3 -m sglang.launch_server \ --model-path "cs-552-2026-TopHaylin/math_model" \ --host 0.0.0.0 \ --port 30000 # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:30000/v1/chat/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "cs-552-2026-TopHaylin/math_model", "messages": [ { "role": "user", "content": "What is the capital of France?" } ] }' - Docker Model Runner
How to use cs-552-2026-TopHaylin/math_model with Docker Model Runner:
docker model run hf.co/cs-552-2026-TopHaylin/math_model
Update Automated MNLP evaluation report (2026-06-09)
Browse files- EVAL_REPORT.md +59 -80
EVAL_REPORT.md
CHANGED
|
@@ -2,7 +2,7 @@
|
|
| 2 |
|
| 3 |
- **Model repo:** [`cs-552-2026-TopHaylin/math_model`](https://huggingface.co/cs-552-2026-TopHaylin/math_model)
|
| 4 |
- **Owner(s):** group **TopHaylin**
|
| 5 |
-
- **Generated at:** 2026-06-
|
| 6 |
- **Pipeline:** [mnlp-project-ci](https://github.com/eric11eca/mnlp-project-ci)
|
| 7 |
|
| 8 |
_This PR is opened automatically by the course CI. It is **non-blocking** — you do not need to merge it. The next nightly run will refresh this file._
|
|
@@ -30,141 +30,120 @@ _Prompts are intentionally omitted to avoid revealing benchmark contents. For mu
|
|
| 30 |
|
| 31 |
**Correct** (1 shown)
|
| 32 |
|
| 33 |
-
- **reference**: `
|
| 34 |
-
- **overall** (
|
| 35 |
-
- **extracted** (✓): `
|
| 36 |
- **completion**:
|
| 37 |
|
| 38 |
```text
|
| 39 |
<think>
|
| 40 |
-
Okay, so I need to
|
| 41 |
|
| 42 |
-
|
| 43 |
|
| 44 |
... [truncated 823 chars] ...
|
| 45 |
|
| 46 |
-
|
| 47 |
|
| 48 |
-
|
|
|
|
|
|
|
| 49 |
|
| 50 |
-
|
| 51 |
-
|
| 52 |
-
Therefore, everything checks out.
|
| 53 |
-
|
| 54 |
-
So, the final answer is 40_9.
|
| 55 |
-
|
| 56 |
-
**Final Answer**
|
| 57 |
-
The result of $58_9 - 18_9$ in base $9$ is \boxed{40_9}.
|
| 58 |
-
</think>
|
| 59 |
-
|
| 60 |
-
To solve the problem $58_9 - 18_9$, we follow a systematic approach by converting the base-9 numbers to base-10, performing the subtraction in base-10, and then converting the result back to base-9.
|
| 61 |
|
| 62 |
---
|
| 63 |
|
| 64 |
-
### Step
|
| 65 |
|
| 66 |
-
|
|
|
|
|
|
|
|
|
|
| 67 |
|
| 68 |
-
|
| 69 |
-
- $18_9 = 1 \times 9^1 + 8 \times 9^0 = 1 \times 9 + 8 = 9 + 8 = 17_{10}$
|
| 70 |
-
|
| 71 |
-
---
|
| 72 |
-
|
| 73 |
-
### Step 2: Perform the subtraction in base-10
|
| 74 |
-
|
| 75 |
-
Now, subtract the two base-10 numbers:
|
| 76 |
|
|
|
|
| 77 |
$$
|
| 78 |
-
|
| 79 |
$$
|
| 80 |
|
| 81 |
-
|
| 82 |
-
|
| 83 |
-
|
| 84 |
-
|
| 85 |
-
To convert $36_{10}$ to base-9, we repeatedly divide by 9 and record the remainders:
|
| 86 |
-
|
| 87 |
-
- $36 \div 9 = 4$ remainder $0$
|
| 88 |
-
- Since the remainder is $0$, we stop here.
|
| 89 |
|
| 90 |
-
Thus
|
|
|
|
|
|
|
|
|
|
| 91 |
|
| 92 |
---
|
| 93 |
|
| 94 |
### Final Answer
|
| 95 |
|
| 96 |
$$
|
| 97 |
-
|
| 98 |
$$
|
| 99 |
```
|
| 100 |
|
| 101 |
**Incorrect** (1 shown)
|
| 102 |
|
| 103 |
-
- **reference**: `
|
| 104 |
- **overall** (0/8 completions correct)
|
| 105 |
-
- **extracted** (✗): `
|
| 106 |
- **completion**:
|
| 107 |
|
| 108 |
```text
|
| 109 |
<think>
|
| 110 |
-
Okay, let's try to tackle this problem step by step.
|
| 111 |
-
|
| 112 |
-
We need to find all polynomials P with integer coefficients such that:
|
| 113 |
-
|
| 114 |
-
1. The degree of P is at most 3.
|
| 115 |
-
2. Each coefficient of P is an integer between 0 and 2012, inclusive.
|
| 116 |
-
3. For every positive integer x where x ≤ 100, the expression P(x) + P(-x) is divisible by 201
|
| 117 |
-
|
| 118 |
-
... [truncated 823 chars] ...
|
| 119 |
-
|
| 120 |
-
(x) = ax^3 + cx.
|
| 121 |
-
$$
|
| 122 |
-
|
| 123 |
-
---
|
| 124 |
-
|
| 125 |
-
### Step 2: Ensuring the Residues are Distinct
|
| 126 |
-
|
| 127 |
-
Since $ P(x) = ax^3 + cx $, and $ a = 0 $, we have:
|
| 128 |
|
| 129 |
$$
|
| 130 |
-
|
| 131 |
$$
|
| 132 |
|
| 133 |
-
|
| 134 |
|
| 135 |
-
|
| 136 |
-
P(0) = 0, \quad P(1), P(2), \ldots, P(2012) \pmod{2013}
|
| 137 |
-
$$
|
| 138 |
|
| 139 |
-
|
|
|
|
|
|
|
| 140 |
|
| 141 |
---
|
| 142 |
|
| 143 |
-
### Step
|
| 144 |
-
|
| 145 |
-
We now count how many $ c \in \{0, 1, 2, \ldots, 2012\} $ are coprime to 2013 (since $ c \not\equiv 0 \pmod{2013} $ and $ P(x) = cx $ must yield distinct residues).
|
| 146 |
-
|
| 147 |
-
Let $ p = 2013 = 3 \cdot 11 \cdot 61 $. Using the **Euler's totient function**:
|
| 148 |
-
|
| 149 |
-
$$
|
| 150 |
-
\phi(p) = p - 1 = 2012,
|
| 151 |
-
$$
|
| 152 |
|
| 153 |
-
|
| 154 |
|
|
|
|
| 155 |
$$
|
| 156 |
-
|
| 157 |
$$
|
| 158 |
|
| 159 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 160 |
|
| 161 |
---
|
| 162 |
|
| 163 |
### Conclusion
|
| 164 |
|
| 165 |
-
|
| 166 |
|
| 167 |
$$
|
| 168 |
-
\boxed{
|
| 169 |
$$
|
| 170 |
```
|
|
|
|
| 2 |
|
| 3 |
- **Model repo:** [`cs-552-2026-TopHaylin/math_model`](https://huggingface.co/cs-552-2026-TopHaylin/math_model)
|
| 4 |
- **Owner(s):** group **TopHaylin**
|
| 5 |
+
- **Generated at:** 2026-06-09T08:52:30+00:00 (UTC)
|
| 6 |
- **Pipeline:** [mnlp-project-ci](https://github.com/eric11eca/mnlp-project-ci)
|
| 7 |
|
| 8 |
_This PR is opened automatically by the course CI. It is **non-blocking** — you do not need to merge it. The next nightly run will refresh this file._
|
|
|
|
| 30 |
|
| 31 |
**Correct** (1 shown)
|
| 32 |
|
| 33 |
+
- **reference**: `15`
|
| 34 |
+
- **overall** (1/8 completions correct)
|
| 35 |
+
- **extracted** (✓): `15`
|
| 36 |
- **completion**:
|
| 37 |
|
| 38 |
```text
|
| 39 |
<think>
|
| 40 |
+
Okay, so I need to solve this geometry problem involving triangle $XYZ$, its incenter $J$, and some other points and lines. Let me try to visualize and break down the problem step by step.
|
| 41 |
|
| 42 |
+
First, let me recall that the incenter $J$ of triangle $XYZ$ is the intersection of its angle bisectors. The problem mentions that $K$ is the point where segment $XJ$ intersects the incircle. Also, $YK$
|
| 43 |
|
| 44 |
... [truncated 823 chars] ...
|
| 45 |
|
| 46 |
+
le $\triangle XYS$ is right-angled at $S$.
|
| 47 |
|
| 48 |
+
Let’s denote the following:
|
| 49 |
+
- $S$ is the point of tangency of the incircle with side $XZ$.
|
| 50 |
+
- $K$ is the touch point of the incircle with side $XZ$.
|
| 51 |
|
| 52 |
+
Since $YK$ is perpendicular to $XZ$, and $K$ is on the incircle, we conclude that $YK$ is the altitude from $Y$ to $XZ$, and thus $K$ is the foot of the perpendicular from $Y$ to $XZ$. Therefore, $YK$ is the inradius.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 53 |
|
| 54 |
---
|
| 55 |
|
| 56 |
+
### Step 4: Use Symmetry and Angle Relationships
|
| 57 |
|
| 58 |
+
From the given conditions, we conclude that:
|
| 59 |
+
- $\angle YJS = \angle YXS = 90^\circ$,
|
| 60 |
+
- $\angle TXZ = \angle JXT$,
|
| 61 |
+
- $\angle XTR = \gamma$.
|
| 62 |
|
| 63 |
+
Because $\angle TXZ$ is equal to $\angle JXT$, and both share the same segment $XT$, triangle $\triangle XJT$ is isosceles with $XJ = XT$, and $\angle XTR = \gamma = \angle XJT$.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 64 |
|
| 65 |
+
From triangle $\triangle XJT$, we deduce:
|
| 66 |
$$
|
| 67 |
+
\angle XJT = \frac{180^\circ - \angle XJT - \angle JXT}{2} = \frac{180^\circ - 2\angle XJT}{2} = 90^\circ - \angle XJT
|
| 68 |
$$
|
| 69 |
|
| 70 |
+
Since $\angle XJT = \angle XTR = \gamma$, we conclude:
|
| 71 |
+
$$
|
| 72 |
+
\gamma = 90^\circ - \gamma \implies 2\gamma = 90^\circ \implies \gamma = 45^\circ
|
| 73 |
+
$$
|
|
|
|
|
|
|
|
|
|
|
|
|
| 74 |
|
| 75 |
+
Thus:
|
| 76 |
+
$$
|
| 77 |
+
\frac{\gamma}{3} = \frac{45^\circ}{3} = 15^\circ
|
| 78 |
+
$$
|
| 79 |
|
| 80 |
---
|
| 81 |
|
| 82 |
### Final Answer
|
| 83 |
|
| 84 |
$$
|
| 85 |
+
\boxed{15}
|
| 86 |
$$
|
| 87 |
```
|
| 88 |
|
| 89 |
**Incorrect** (1 shown)
|
| 90 |
|
| 91 |
+
- **reference**: `60750, 854130, 854970`
|
| 92 |
- **overall** (0/8 completions correct)
|
| 93 |
+
- **extracted** (✗): `854130`
|
| 94 |
- **completion**:
|
| 95 |
|
| 96 |
```text
|
| 97 |
<think>
|
| 98 |
+
Okay, let's try to tackle this problem. It seems a bit complex at first glance, but I'll take it step by step. The problem is about finding all possible values that the sum of the function $ h $ over the first 2025 natural numbers can take, given that $ h(n) $ maps to $ \mathbb{N} \setminus \{1\} $ and satisfies the equation:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 99 |
|
| 100 |
$$
|
| 101 |
+
h(n) + h(n+1) = h(n+2)h(n+3) - 840
|
| 102 |
$$
|
| 103 |
|
| 104 |
+
for every natural num
|
| 105 |
|
| 106 |
+
... [truncated 822 chars] ...
|
|
|
|
|
|
|
| 107 |
|
| 108 |
+
842, \quad h(3) = 2, \quad h(4) = 842, \ldots
|
| 109 |
+
$$
|
| 110 |
+
This also satisfies the equation.
|
| 111 |
|
| 112 |
---
|
| 113 |
|
| 114 |
+
### Step 2: Calculating the Sums
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 115 |
|
| 116 |
+
We calculate the sum $ S = \sum_{i=1}^{2025} h(i) $ for each of these sequences.
|
| 117 |
|
| 118 |
+
#### Case 1: Constant Sequence $ h(n) = 30 $
|
| 119 |
$$
|
| 120 |
+
S = 2025 \times 30 = 60750
|
| 121 |
$$
|
| 122 |
|
| 123 |
+
#### Case 2: Alternating Sequence $ h(1) = 2, h(2) = 842, h(3) = 2, h(4) = 842, \ldots $
|
| 124 |
+
- Number of terms: 2025
|
| 125 |
+
- Number of 2s: $ \left\lceil \frac{2025}{2} \right\rceil = 1013 $
|
| 126 |
+
- Number of 842s: $ \left\lfloor \frac{2025}{2} \right\rfloor = 1012 $
|
| 127 |
+
- Sum:
|
| 128 |
+
$$
|
| 129 |
+
S = 1013 \times 2 + 1012 \times 842 = 2026 + 852104 = 854130
|
| 130 |
+
$$
|
| 131 |
+
|
| 132 |
+
#### Case 3: Periodic Sequence with Period 4 (2, 842, 2, 842, ...)
|
| 133 |
+
- Number of 2s: $ \left\lfloor \frac{2025}{4} \right\rfloor = 506 $
|
| 134 |
+
- Number of 842s: $ \left\lceil \frac{2025}{4} \right\rceil = 507 $
|
| 135 |
+
- Sum:
|
| 136 |
+
$$
|
| 137 |
+
S = 506 \times 2 + 507 \times 842 = 1012 + 426052 = 427066
|
| 138 |
+
$$
|
| 139 |
|
| 140 |
---
|
| 141 |
|
| 142 |
### Conclusion
|
| 143 |
|
| 144 |
+
These three cases represent the only valid sequences satisfying the given functional equation and the constraint $ h(n) > 1 $. Therefore, the possible values for $ \sum_{i=1}^{2025} h(i) $ are:
|
| 145 |
|
| 146 |
$$
|
| 147 |
+
\boxed{427066}, \quad \boxed{60750}, \quad \text{and} \quad \boxed{854130}
|
| 148 |
$$
|
| 149 |
```
|