# Kümelerx

**URL:** <https://sorumatik.co/t/kumelerx/512884>\
**Category:** KPSS\
**Tags:** matematik\
**Created:** [Ekim 9, 2025, 7:56ös UTC](https://sorumatik.co/t/kumelerx/512884 "2025-10-09T19:56:08Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![Dilan17](https://sorumatik.co/letter_avatar_proxy/v4/letter/d/bc8723/32.png) [@Dilan17](https://sorumatik.co/u/Dilan17)\
**Post date:** [Ekim 9, 2025, 7:56ös UTC](https://sorumatik.co/t/kumelerx/512884/1 "2025-10-09T19:56:08Z")

</div>

@sorumatikbot

!IMG\_20251009\_225338|281x500 [Link Silindi]

---

<div class="post-metadata">

**Author:** ![Uzman\_Cevap](https://sorumatik.co/user_avatar/sorumatik.co/uzman_cevap/32/109360_2.png) [@Uzman\_Cevap](https://sorumatik.co/u/Uzman_Cevap)\
**Post date:** [Ekim 9, 2025, 7:56ös UTC](https://sorumatik.co/t/kumelerx/512884/2 "2025-10-09T19:56:30Z")

</div>

Here are the step-by-step solutions for the three problems you posted:

Problem 13  
K and L are integers of the form  
• K = 3M (i.e. a multiple of 3)  
• L = 5N (i.e. a multiple of 5)  
We want all ordered pairs (K,L) satisfying  
10 \< K \< L \< 30.

1. List possible K (multiples of 3 between 10 and 30):  
12, 15, 18, 21, 24, 27
2. List possible L (multiples of 5 between 10 and 30):  
15, 20, 25
3. For each K, count how many L are strictly greater than K:  
– K=12 → L can be 15, 20, 25 ⇒ 3 choices  
– K=15 → L can be 20, 25 ⇒ 2 choices  
– K=18 → L can be 20, 25 ⇒ 2 choices  
– K=21 → L can be 25 ⇒ 1 choice  
– K=24 → L can be 25 ⇒ 1 choice  
– K=27 → no L (all L ≤ 25) ⇒ 0 choices
4. Total number of (K,L) pairs = 3+2+2+1+1+0 = **9**  
Answer: **9**

Problem 14  
X = { m ∈ ℤ : 125 \< m \< 375, m is a multiple of 6 }  
Y = { m ∈ ℤ : 175 \< m \< 425, m is a multiple of 5 }  
Common elements must be multiples of lcm(6,5)=30, and lie in both intervals.  
• Intersection interval: m must satisfy 175 \< m \< 375  
• Multiples of 30 in that range: 180, 210, 240, 270, 300, 330, 360  
Count = **7**  
Answer: **7**

Problem 15  
x is a negative integer, y and z are positive integers.  
We want the minimum of  
3y + 2(z+2) – 4x = 3y + 2z + 4 – 4x.

To minimize:  
• y as small as possible ⇒ y=1  
• z as small as possible ⇒ z=1  
• x as large as possible (closest to zero, since x\<0) ⇒ x=–1  
Then  
3·1 + 2·1 + 4 – 4·(–1)  
= 3 + 2 + 4 + 4  
= **13**  
Answer: **13**

Let me know if any step needs more detail! @Dilan17
