Error
There was an error loading the page.
Find n such that σ(n) is the given number
Given m∈N, find values of n∈N such that σ(n)=m.
There are at most two such solutions in this question.
Metadata
-
England schools
-
England university
-
Scotland schools
Taxonomy: mathcentre
Taxonomy: Kind of activity
Taxonomy: Context
Feedback
From users who are members of Content created by Newcastle University :
![]() |
said | Needs to be tested | 5 years, 10 months ago |
From users who are not members of Content created by Newcastle University :
Numbas Admin | said | Doesn't work | 5 years, 10 months ago |
History
Christian Lawson-Perfect 5 years, 10 months ago
Saved a checkpoint:
Part b seemed to be just some debugging info, so I've removed it
Christian Lawson-Perfect 5 years, 10 months ago
Gave some feedback: Needs to be tested
Numbas Admin commented 5 years, 10 months ago
Automatic testing has identified a problem with this question:
Part b got 0 credit
Numbas Admin 5 years, 10 months ago
Gave some feedback: Doesn't work
Newcastle University Mathematics and Statistics 9 years, 2 months ago
Created this.There is only one version of this question that you have access to.
Name | Type | Generated Value |
---|
d12 | list |
List of 4 items
|
||||
d124 | list |
List of 4 items
|
||||
d18 | list |
List of 4 items
|
||||
d217 | list |
List of 4 items
|
||||
d24 | list |
List of 4 items
|
||||
d28 | list |
List of 4 items
|
||||
d39 | list |
List of 4 items
|
||||
d403 | list |
List of 4 items
|
||||
d42 | list |
List of 4 items
|
||||
d78 | list |
List of 4 items
|
||||
d91 | list |
List of 4 items
|
||||
d93 | list |
List of 4 items
|
Name | Type | Generated Value |
---|
biggest_prime | number |
997
|
||||
primes | list |
List of 168 items
|
||||
scenarios | list |
Nested 12×2 list
|
||||
scenario | list |
[ 13, [ 9 ] ]
|
||||
target | integer |
13
|
||||
answer | list |
[ 9 ]
|
||||
smallest_answer | integer |
0
|
||||
biggest_answer | number |
9
|
||||
target_factorisations | list |
[ [ 13 ] ]
|
||||
good_target_factorisations | list |
[ [ 13 ] ]
|
||||
target_one_more_than_a_prime | boolean |
false
|
||||
inverse_sigma_primes | list |
[ [ [ 3, 2 ] ] ]
|
||||
second_decomposition | boolean |
false
|
Name | Type | Generated Value |
---|
af1 | integer |
0
|
||||
af2 | integer |
0
|
||||
altf | string |
There are no other factorizati
|
||||
ans1 | number |
11
|
||||
ans2 | number |
6
|
||||
d | list |
Nested 12×4 list
|
||||
f1 | integer |
3
|
||||
f2 | integer |
4
|
||||
inv | string |
, forgetting those with $2$ as
|
||||
j | integer |
0
|
||||
m | integer |
12
|
||||
n1 | list |
[ 2, 1 ]
|
||||
n2 | list |
[ 3, 1 ]
|
||||
pri | string |
Note that since $\var{m}-1$ is
|
||||
v | number |
6
|
Generated value: list
This variable doesn't seem to be used anywhere.
Gap-fill
Ask the student a question, and give any hints about how they should answer this part.
Find values of n such that σ(n)={m}. There are at most 2.
If there are two values of n enter in decreasing order.
If there is only one value for n enter that value in the first answer field and enter 0 in the second field.
Largest value for n=
Smallest value for n=
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 | ||
Number entry | ||
Hasn't run yet | ||
Information only |
This question is used in the following exams:
- Michael's copy of Number theory and cryptography by Michael Foreman in Michael's workspace.
- Number theory and cryptography by Newcastle University Mathematics and Statistics in Content created by Newcastle University.
- Sean's copy of Number theory and cryptography by Sean Gardiner in Sean's workspace.