<![CDATA[Everus Lainus]]>https://everus.substack.comhttps://substackcdn.com/image/fetch/$s_!RVlg!,w_256,c_limit,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Feverus.substack.com%2Fimg%2Fsubstack.pngEverus Lainushttps://everus.substack.comSubstackTue, 28 Jul 2026 01:22:08 GMT<![CDATA[Divisibility Problems]]>https://everus.substack.com/p/divisibility-problems-d4dhttps://everus.substack.com/p/divisibility-problems-d4dSat, 13 Jun 2026 14:44:30 GMTSection 2.1

Problem 2:

Solution:

First we find the greatest common divisor of 1819 and 3587 using euclidean algorithm

3587 = 1819 (1) + 1768

1819 = 1768 (1) + 51

1768 = 51 (34) + 34

51 = 34 (1) + 17

34 = 17 (2) + 0

=> greatest common divisor of 1819 and 3587 is 17

Now we find the values of x and y from 1819 x + 3587 y = g.

choose x = 0 and y = 1

1819 (0) + 3587 (1) = 3587 → equation 1.

choose x = 1 and y = 0

1819 (1) + 3587 (0) = 1819 → equation 2

multiply with the first quotient from the steps of euclidean algorithm to equation 2 and subtract it from equation 1. r_0 = 1

1819 (-1) + 3587 (1) = 1768 → equation 3

multiply r_1 = 1 to equation 3 and subract it from equation 2

1819 (2) + 3587 (-1) = 51 → equation 4

multiply r_2 = 34 to equation 4 and subract it from equation 3

1819 (-69) + 3587 (35) = 34 → equation 5

multiply r_3 = 1 to equation 5 and subract it from equation 4

1819 (71) + 3587 (-36) = 17

=> x = 71 and y = -36.

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[Divisibility Problems]]>https://everus.substack.com/p/divisibility-problemshttps://everus.substack.com/p/divisibility-problemsThu, 11 Jun 2026 14:30:15 GMTSection 1.2

Problem 1:

Thanks for reading! Subscribe for free to receive new posts and support my work.

Solution:

We use Euclidean Algorithm,

a. (7469, 2464) = ?

7469 = 2464 (3) + 77

2464 = 77(32) + 0

=> g.c.d of 7469 and 2464 is 32

b. (2689, 4001) = ?

4001 = 2689 (1) + 1312

2689 = 1312 (2) + 65

1312 = 64 (20) + 12

64 = 12 (5) + 5

12 = 5(2) + 2

5 = 2 (2) + 1

2 = 1 (2) + 0

=> g.c.d of 7469 and 2464 is 1

c. (2947, 3997) = ?

3997 = 2947(1) + 1050

2947 = 1050 (2) + 847

1050 = 847 (1) + 203

847 = 203 (2) + 35

203 = 35 (5) + 28

35 = 28 (1) + 7

28 = 7 (4) + 0

=> g.c.d of 2947 and 3997 is 7

d. (1109, 4999) = ?

4999 = 1109 (4) + 563

1109 = 563 (1) + 546

563 = 546 (1) + 17

546 = 17 (20) + 6

17 = 6 (2) + 5

6 = 5 (1) + 1

5 = 1(5) + 0

=> g.c.d of 1109 and 4999 is 1

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[Limit Problem]]>https://everus.substack.com/p/limit-problemhttps://everus.substack.com/p/limit-problemSat, 09 May 2026 05:02:50 GMTProblem
Solution

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[Linear Independency Problem]]>https://everus.substack.com/p/linear-independency-problemhttps://everus.substack.com/p/linear-independency-problemWed, 29 Apr 2026 05:23:37 GMTProblem
Solution

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[A Real Analysis Problem]]>https://everus.substack.com/p/a-real-analysis-problemhttps://everus.substack.com/p/a-real-analysis-problemThu, 23 Apr 2026 09:43:39 GMTProblem
Solution

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[A Topology Problem]]>https://everus.substack.com/p/a-topology-problemhttps://everus.substack.com/p/a-topology-problemMon, 13 Apr 2026 13:00:26 GMTProblem
Solution

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[A Complex Analysis Problem]]>https://everus.substack.com/p/a-complex-analysis-problem-b37https://everus.substack.com/p/a-complex-analysis-problem-b37Mon, 13 Apr 2026 12:43:39 GMTProblem
Solution

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[A Complex Analysis Problem ]]>https://everus.substack.com/p/a-complex-analysis-problemhttps://everus.substack.com/p/a-complex-analysis-problemSun, 12 Apr 2026 07:51:20 GMTProblem:
Solution

Answer : option 2.

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[A Linear Algebra Problem]]>https://everus.substack.com/p/a-linear-algebra-problemhttps://everus.substack.com/p/a-linear-algebra-problemFri, 10 Apr 2026 16:09:36 GMTProblem:

Solution:

Thanks for reading! Subscribe for free to receive new posts and support my work.

]]><![CDATA[Visualising Addition]]>https://everus.substack.com/p/visualising-additionhttps://everus.substack.com/p/visualising-additionThu, 22 Jan 2026 12:03:53 GMT

  • Real Objects (Concrete)

    • Best for beginners. Use Balls, beads, stones, buttons, etc,.

    Example: 3 + 2

    Thanks for reading! Subscribe for free to receive new posts and support my work.

    Put 3 balls, then add 2 more → count total = 5

    1. Fingers (Body-based)

    Very natural for early learners.

    Example: 4 + 3

    Show 4 fingers, then add 3 more. Count all.

    1. Pictures / Drawings

    Draw circles, stars, fruits, etc.

    Example: 3 + 2
    🍎🍎🍎 + 🍎🍎 → count total apples

    1. Number Line (Movement Model)

    Used after Number Line has been introduced to students.

    Example: 3 + 4

    • Start at 3

    • Jump 4 steps right

    • Land on 7

    This shows: Addition = moving forward

    Keep Learning.

    If you have any questions or doubts, feel free to reply. I’d be happy to help. Subscribe to stay connected and receive more learning resources.

    Thanks for reading! Subscribe for free to receive new posts and support my work.

    ]]>    <![CDATA[A Lesson the Cosmos Doesn’t Say Out Loud]]>https://everus.substack.com/p/a-lesson-the-cosmos-doesnt-say-outhttps://everus.substack.com/p/a-lesson-the-cosmos-doesnt-say-outTue, 25 Nov 2025 08:07:43 GMT
    I always thought that in many paths of work, 
doors open through delicate human arts
the practiced politeness of meetings, the quiet negotiations in hallways,
the subtle choreography of favours, timing, and well-chosen words.

But the realm of science answers to none of these.
You cannot charm the sky, nor befriend the cosmos
to reveal the next step of truth.

For the truths of the universe demand a heart so pure
that even a whisper of greed, or lust, or hunger for power
blurs the way forward, turning light to fog.
Only the honest seeker can walk that path,
where the universe unveils itself in silence.

    Subscribe now

    ]]>