Feed aggregator

----------------------------------------------------------------------- Algorithm E (Euclid's algorithm). Given two positive integers m and n, find their greatest common divisor, that is, the largest positive integer that evenly divides both m and n.

E1 [Find remained] Divide m by n and r be the remainder. (We will know that 0 <= r < n)

E2 [Is it zero?] If r = 0, the algorithm terminates, n is the answer

E3 [Reduce] Set m = n, then n = r, then go back to step E1 -----------------------------------------------------------------------

[3] Change Algorithm E so that all trivial replacement operations such as m = n are avoided. Write this new algorithm in the style of Algorithm E and call it Algorithm F.

======================================================================== Claude Sonnet 4.6 ========================================================================

Algorithm F

Given two positive integers m and n, find their greatest common divisor.

F1 [Find remainder] Divide m by n and let r be the remainder. (We will know that 0 ≤ r < n.)

F2 [Is it zero?] If r = 0, the algorithm terminates and n is the answer.

F3 [Find remainder] Divide n by r and let m be the remainder. (We will know that 0 ≤ m < r.)

F4 [Is it zero?] If m = 0, the algorithm terminates and r is the answer.

F5 [Find remainder] Divide r by m and let n be the remainder. (We will know that 0 ≤ n < m.) Go back to F2.

Explanation

The key insight is that instead of shuffling values with temporary replacements like:

m = n, n = r

we reuse the existing variables (m, n, r) in rotation, dividing and storing each new remainder directly into the variable that is no longer needed:

Step Divides Remainder stored in F1...m by n...r F3...n by r...m F5...r by m...n

Each variable naturally becomes the "oldest" value at each stage and is safely overwritten. This eliminates all trivial assignments while preserving the logic of Euclid's algorithm. □

Comments URL: https://news.ycombinator.com/item?id=47271921

Points: 3

# Comments: 0

With remote and hybrid work becoming common, managing Windows laptops outside the office network seems more challenging than before.

Traditionally many environments relied on Active Directory and on-prem management, but with distributed teams devices are often off the corporate network most of the time.

I have been looking into different approaches like Microsoft Intune and other Windows MDM tools such as Scalefusion MDM that allow admins to manage policies, push updates, and monitor devices remotely.

Curious how teams here are handling Windows device management today. Are you relying mostly on cloud MDM platforms, traditional domain setups, or a mix of both?

Comments URL: https://news.ycombinator.com/item?id=47271919

Points: 1

# Comments: 0

Article URL: https://old.reddit.com/r/programminghorror/comments/lgsd18/i_present_sleepsort/

Comments URL: https://news.ycombinator.com/item?id=47271902

Points: 1

# Comments: 0

Article URL: https://www.macrumors.com/2026/03/05/mac-studio-no-512gb-ram-upgrade/

Comments URL: https://news.ycombinator.com/item?id=47271884

Points: 1

# Comments: 0

Article URL: https://apnews.com/article/suicide-ice-detention-centers-b2d1cb0e4b579e0d89caabd00aa04e34

Comments URL: https://news.ycombinator.com/item?id=47271851

Points: 1

# Comments: 0

Article URL: https://randsinrepose.com/archives/hit-and-run/

Comments URL: https://news.ycombinator.com/item?id=47271848

Points: 1

# Comments: 0

Show HN: Reelforge – AI tool for generating TikTok & Reels ad scripts

Text

I built a small AI tool that generates short-form ad scripts for TikTok, Instagram Reels, and YouTube Shorts.

You simply enter a product name, choose the platform, and select a tone.

The system generates a hook, main script, and call-to-action.

Demo https://reelforge-ai1.vercel.app/

Built with Next.js and OpenAI.

Would love feedback from the community.

Comments URL: https://news.ycombinator.com/item?id=47271847

Points: 1

# Comments: 0

Comments URL: https://news.ycombinator.com/item?id=47271843

Points: 1

# Comments: 0

We just launched a free tier for Plexicus.

Previously, it was only available through paid plans, but many individual engineers and small teams wanted to try it without going through sales. So we decided to add a freemium option.

Would love to hear feedback from you guys

Comments URL: https://news.ycombinator.com/item?id=47271838

Points: 1

# Comments: 0

Each day, a new unusual word with four possible meanings. Pick the right meaning to win. You have 3 tries per day.

A game I built to expand my own vocabulary, hopefully you find it fun too.

Comments URL: https://news.ycombinator.com/item?id=47271833

Points: 1

# Comments: 0

Knuth Tests using Claude Sonnet 4.6 problem 1.1.2

Knuth Art Of Computer Programming V1 p9 ----------------------------------------------------------------------- Algorithm E (Euclid's algorithm). Given two positive integers m and n, find their greatest common divisor, that is, the largest positive integer that evenly divides both m and n.

E1 [Find remained] Divide m by n and r be the remainder. (We will know that 0 <= r < n)

E2 [Is it zero?] If r = 0, the algorithm terminates, n is the answer

E3 [Reduce] Set m = n, then n = r, then go back to step E1 -----------------------------------------------------------------------

Prove that m is always greater than n at the beginning of step E1, except possibly the first time this step occurs.

======================================================================== Claude Sonnet 4.6 ========================================================================

Proof

We want to show that m > n at the start of E1, for every iteration except possibly the first.

First Execution of E1

When E1 is executed the first time, m and n are simply whatever positive integers were given as input. There is no guarantee that m > n, which is why the exception exists. For example, with m = 2166 and n = 6099, we have m < n on the first call.

All Subsequent Executions of E1

After the first execution of E1, we reach E3 only if r ≠ 0 (checked at E2). At E3, the replacements are:

m = n n = r

Then we return to E1. So at the start of the next E1, the new values are:

m_new = n_old and n_new = r_old

From E1, we know r is the remainder when m is divided by n, so by definition:

0 ≤ r < n

Since E3 is only reached when r ≠ 0 (E2 would have terminated otherwise), we tighten this to:

0 < r < n

Therefore:

n_new = r_old < n_old = m_new

Which gives us:

m_new > n_new

Conclusion

After the first iteration, the new m is always the old n, and the new n is always the remainder r, which is strictly less than the old n. Therefore m > n holds at the beginning of every execution of E1 except possibly the first, which is what we wanted to prove. □

Comments URL: https://news.ycombinator.com/item?id=47271831

Points: 1

# Comments: 0

Article URL: https://twitter.com/awnihannun/status/2029672507448643706

Comments URL: https://news.ycombinator.com/item?id=47271817

Points: 1

# Comments: 0

Hey HN,

I want to introduce you to Cardrooms.app : a free, guest-friendly, competitive platform for shithead (with plans to expand into other card games).

I based the main game on shithead because it is the best game that combines strategy, memorization, luck, and complexity. If you're not familiar with the rules there is a play through tutorial as well as documentation on how to play on the app,

It's still a really new project (1.5 weeks old at the time of writing) so I suggest trying it out with friends as its really hard to get an open room. It's great to play with your card game buddies especially when you're separated by distance or have no physical cards on you.

If you decide to make an account, there is a robust ELO system to help you track your performance against other players, with a global ranking system and some ingame cosmetics to reflect your progress through the ranks.

Any feedback is much appreciated. I'd also love to hear any ideas you have for promoting it - Discord servers, Facebook groups etc. Not really sure where the big online communities hang out (apart from here).

If you enjoy it, tell your friends!

Comments URL: https://news.ycombinator.com/item?id=47271803

Points: 1

# Comments: 0

We run an open startup and believe in sharing numbers publicly. But our setup was a mess: metrics lived in Stripe and PostHog, we'd pull them manually, paste into our CMS, and embed that on the site. Every update was a chore. Every number was stale. Openboard connects directly to your data sources and generates a live public metrics page. No CMS middleman, no manual updates. Currently supports Stripe (MRR, churn, active subscribers) and PostHog (visitors, signups, retention). Adding more integrations based on what people actually need. The base version is free — sharing should be frictionless. Paid plans unlock more integrations and custom domains. Would love feedback, especially from founders who already run an open page and know how annoying this problem is. openboard.fyi

Comments URL: https://news.ycombinator.com/item?id=47271798

Points: 1

# Comments: 0

Article URL: https://securityboulevard.com/2026/03/shinyhunters-claims-woflow-breach-what-it-means-for-saas-supply-chain-security/

Comments URL: https://news.ycombinator.com/item?id=47271790

Points: 1

# Comments: 0

I built EV Mapping to answer the question EV owners actually ask: "Can I get there and back without charging?"

You pick your car, drop a start pin, set your current charge %, and hit Compute Reach. You get two circles — outer for one-way range, inner for round-trip — plus all charging stations within reach as pins. Click any pin to open navigation in Google Maps.

Stack: vanilla JS + Leaflet, no build step, hosted on Vercel. Charger data merges OpenChargeMap and OpenStreetMap Overpass with deduplication. 700+ EV presets across 20+ markets (US, EU, India, China, AU, etc.) synced every 12h via a Python pipeline on GitHub Actions.

The catalog pipeline ingests fueleconomy.gov, afdc.energy.gov, cardekho.com, and greenvehicleguide.gov.au, plus region-native seed files. It has anti-regression guardrails and a canary→stable promotion workflow so bad syncs don't silently ship.

https://ev-mapping.vercel.app Source: https://github.com/novelmartis/ev-mapping

Feedback welcome — especially on range accuracy and charger pin coverage in non-US markets.

Comments URL: https://news.ycombinator.com/item?id=47271786

Points: 1

# Comments: 0

Article URL: https://www.bbc.com/news/articles/cddnn261n60o

Comments URL: https://news.ycombinator.com/item?id=47271783

Points: 2

# Comments: 0

Article URL: https://sitandr.github.io/typst-examples-book/book/

Comments URL: https://news.ycombinator.com/item?id=47271769

Points: 1

# Comments: 0

Article URL: https://electrek.co/2026/03/05/floating-wind-turbines-could-soon-power-ai-data-centers-at-sea/

Comments URL: https://news.ycombinator.com/item?id=47271509

Points: 1

# Comments: 0

Article URL: https://techcommunity.microsoft.com/blog/azure-ai-foundry-blog/introducing-gpt-5-4-in-microsoft-foundry/4499785

Comments URL: https://news.ycombinator.com/item?id=47271502

Points: 1

# Comments: 0