Error
There was an error loading the page.
Blathnaid's copy of Solve three congruences using Chinese Remainder Theorem
Draft
Solving three simultaneous congruences using the Chinese Remainder Theorem:
x≡b1modn1x≡b2modn2x≡b3modn3
where gcd(n1,n2,n3)=1
Metadata
Solve three congruences using Chinese Remainder Theorem
by
Newcastle University Mathematics and Statistics
-
England schools
-
England university
-
Scotland schools
Taxonomy: mathcentre
Taxonomy: Kind of activity
Taxonomy: Context
Contributors
History
Blathnaid Sheridan 6 years, 10 months ago
Created this as a copy of Solve three congruences using Chinese Remainder Theorem.Name | Status | Author | Last Modified | |
---|---|---|---|---|
Solve three congruences using Chinese Remainder Theorem | draft | Newcastle University Mathematics and Statistics | 20/11/2019 14:51 | |
Blathnaid's copy of Solve three congruences using Chinese Remainder Theorem | draft | Blathnaid Sheridan | 11/05/2018 12:11 | |
Blathnaid's copy of Solve three congruences using Chinese Remainder Theorem | draft | Blathnaid Sheridan | 18/11/2019 13:17 |
There is one other version that you do not have access to.
Name | Type | Generated Value |
---|
pans | number |
305
|
||||
na | number |
30
|
||||
nb | number |
26
|
||||
nc | number |
195
|
||||
ea | number |
-90
|
||||
rc | integer |
1
|
||||
ec | number |
195
|
||||
n | number |
390
|
||||
ra | integer |
6
|
||||
rb | integer |
5
|
||||
ans | number |
305
|
||||
sc | number |
2
|
||||
sb | integer |
15
|
||||
sa | number |
13
|
||||
eb | number |
-104
|
Generated value: number
305
← Depends on:
- ea
- eb
- ec
- n
- ra
- rb
- rc
→ Used by:
- ans
This variable doesn't seem to be used anywhere.
Parts
Use this tab to check that this question works as expected.
Part | Test | Passed? |
---|---|---|
Gap-fill | ||
Hasn't run yet | ||
Number entry | ||
Hasn't run yet |
This question is used in the following exams: