Skip to content

Instantly share code, notes, and snippets.

@BillFoster
Created February 24, 2012 21:41
Show Gist options
  • Save BillFoster/1903943 to your computer and use it in GitHub Desktop.
Save BillFoster/1903943 to your computer and use it in GitHub Desktop.
Example of bad display with Multiple Response Part which has Steps
{
notes: ""
name: MAS3214 20122013 CBA2_5
percentPass: 50
shuffleQuestions: false
extensions:[stats]
rulesets:{
std:[all,fractionNumbers, !collectNumbers,!noLeadingMinus]
}
navigation: {
allowregen: true
showfrontpage: false
reverse: true
browse: true
}
feedback: {
showtotalmark: true
}
questions: [
{
name: MAS3214 20122013 CBA2_5
variables: {
p:"[2,3,5,7,11,13,17,19,23,29,31,37,41,43]"
q:"p[0..8]"
dp:"deal(14)"
dq:"deal(8)"
qd:"map(p[dq[x]],x,0..abs(dq)-1)"
pd:"map(p[dp[x]],x,0..abs(dp)-1)"
b:"pd[0]*pd[1]*pd[2]"
t:"(pd[0]-1)*(pd[1]-1)*(pd[2]-1)"
gc: "gcd(b,t)"
bf:"max(pd[0],max(pd[1],pd[2]))"
u:"switch(gc=pd[0],0, gc=pd[1],1,2)"
chkm:"map(if(x=dp[0] or x=dp[1] or x=dp[2],1,0),x,0..abs(p)-1)"
}
parts: [
{
type: gapfill
prompt: """
Find all natural numbers $n$ such that $\phi(n)=\simplify[std]{{t}/{b}}n$
You are given that the general form of $n$ is \[n = p_1^{\alpha_1} p_2^{\alpha_2}\cdots p_s^{\alpha_s}\]
for a fixed set of primes $p_1,\;p_2,\ldots,p_s$ where $\alpha_j \ge 1\;\;j=1,\ldots,\;s$.
Select the primes involved from these choices:
[[0]]
"""
steps:[
{type: information
prompt:""" Factorize $\var{b/gc}$ into the product of one, two or three prime factors. You are given that $\var{bf}$ is a prime factor.
"""
}
]
gaps: [
{type: m_n_2
choices:["2","3","5","7","11","13","17","19","23","29","31","37","41","43"]
matrix: ["chkm[0]","chkm[1]","chkm[2]","chkm[3]","chkm[4]","chkm[5]","chkm[6]","chkm[7]","chkm[8]","chkm[9]","chkm[10]","chkm[11]","chkm[12]","chkm[13]"]
shufflechoices:false
displaycolumns: 7
}
]
}
]
advice: """
"""
}
]
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment