[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 1003 KB, 404x347, 860E9816-6B6A-464E-8B67-99D286B31151.gif [View same] [iqdb] [saucenao] [google]
10378604 No.10378604 [Reply] [Original]

I can’t find an arthimetic formula which gives you a modulous, and I’m sure there must be one, right?

>t. Brainlett

>> No.10378614

>>10378604
a mod n =a - n*floor(a/n)

>> No.10378616
File: 223 KB, 1440x2560, Screenshot_20190211-143947.png [View same] [iqdb] [saucenao] [google]
10378616

>>10378604

>> No.10378629

>>10378614
>>10378616
I must be too stupid to understand that.

Thanks for the quick replies

>> No.10378631

>>10378616
Because I saw that post and plugged in the numbers and didn’t get a good result

>> No.10378696

>>10378629
>>10378631
The calculation of n mod m gives you the remainder when you divide n by m. So for example 6 mod 4 = 2 , because when dividing 6 by 4 we are left with a remainder of 2.
Or 6 mod 3 = 0 , since 3 divides 6 evenly.