Return
Styles:
Pseud0ch
,
Terminal
,
Valhalla
,
NES
,
Geocities
,
Blue Moon
.
Entire thread
Find X such that...
1
Name:
Anonymous
2017-06-03 19:31
Find x, such that it is less than the product of integers a*b*...*z, and dividing x by a,b,...,z produces corresponding remainders a',b',...,z'. In other words, write a program, that takes list {{a,a'},{b,b'},...,{z, z'}} and calculates matching x.
2
Name:
Anonymous
2017-06-03 21:22
>>1
list
What's a ``list'' and why is it written with set brackets?
3
Name:
Anonymous
2017-06-03 21:42
Why would I want to do that?
4
Name:
Anonymous
2017-06-04 0:50
>>3
Mental exercise
5
Name:
Anonymous
2017-06-04 7:34
findX() ->
x = e*f+g (0<e,f,g<101)
[79, 64, 29, 76, 21, 91, 56, 92, 57, 37]
[25, 62, 24, 58, 12, 75, 54, 66, 39, 6]
6
Name:
Anonymous
2017-06-04 10:14
>>3
to help me with my homework.
Newer Posts
Don't change these.
Name:
Email:
Entire Thread
Thread List