This channel is intended for people just starting with the Raku Programming Language ( Logs are available at
Set by lizmat on 8 June 2022.
nhail Cool, thanks 00:20
This is the full program I was working on, it's just a simple brute force checker for cases in Hensel's Lemma, finding solutions to polynomials in modular arithmetic 00:23
05:41 CIAvash joined 07:54 CIAvash left 08:58 RakuIRCLogger left 08:59 lizmat left 09:19 lizmat joined 11:40 tea3po joined 11:43 tea3po left, tea3po joined, teatwo left 11:47 tea3po left, tea3po joined 17:14 lizmat left
ab5tract_ nhail: nice! I'm not familiar with Hensel's Lemma but your code is nicely readable 19:09
antononcube Damn, Gretel’s theorem was omitted! Again... 19:13
nemokosch XDD 19:14
nhail ab5tract if you want context, it's a thing in number theory which states that if you have a solution to a polynomial mod p for a prime p, you can under certain circumstances "lift" that solution to another solution mod p^2. and if you can lift once, you can lift again. so you get a series of numbers a_1, a_2, a_3, etc. such that a_n is a solution to the polynomial for p^n. 19:22
Wikipedia might have better information 19:23
my code is just directly checking for a specific p^m, and whether any of the solutions there can be lifted to p^(m+1) 19:44
20:58 lizmat joined 23:39 teatwo joined 23:40 teatwo left 23:42 teatime joined 23:43 tea3po left