Total no. of outcomes when two dice are rolled = 36
No. of outcome when 6 will be on both dice = 1
Probability of rolling two 6's = 1/36
Hope this helps!
You're looking for the largest number <em>x</em> such that
<em>x</em> ≡ 1 (mod 451)
<em>x</em> ≡ 4 (mod 328)
<em>x</em> ≡ 1 (mod 673)
Recall that
<em>x</em> ≡ <em>a</em> (mod <em>m</em>)
<em>x</em> ≡ <em>b</em> (mod <em>n</em>)
is solvable only when <em>a</em> ≡ <em>b</em> (mod gcd(<em>m</em>, <em>n</em>)). But this is not the case here; with <em>m</em> = 451 and <em>n</em> = 328, we have gcd(<em>m</em>, <em>n</em>) = 41, and clearly
1 ≡ 4 (mod 41)
is not true.
So there is no such number.
Answer:
24/25
Step-by-step explanation:
Cos Z = adj/hyp
= 48/50
= 25
Answer:
£67.60
Step-by-step explanation:
30% of 52 is 15.6
52 + 15.6 = 67.6
I hope this helps, please mark Brainliest, thank you!
