a) From the diagram the grid has 13 steps right and 8 steps up from AAA to CCC.
The
labelled junctions are at
• [Link] 5 right, 2 up from AAA (so A→D uses 555 R and 222 U),
• [Link] 8 right, 4 up from AAA.
Number of shortest routes:
• A→D:A\to D:A→D: (75)=(72)=21\binom{7}{5}=\binom{7}{2}=21(57)=(27)=21.
• D→C:D\to C:D→C: (from DDD to CCC: 8 R and 6 U)
(148)=(146)=3003\binom{14}{8}=\binom{14}{6}=3003(814)=(614)=3003.
→ via DDD: 21×3003=63,06321\times3003=63,06321×3003=63,063.
• A→B:A\to B:A→B: (8 R, 4 U) (128)=(124)=495\binom{12}{8}=\binom{12}{4}=495(812
)=(412)=495.
• B→C:B\to C:B→C: (5 R, 4 U) (95)=(94)=126\binom{9}{5}=\binom{9}{4}=126(59)=(49
)=126.
→ via BBB: 495×126=62,370495\times126=62,370495×126=62,370.
Total via either BBB or DDD:
63,063+62,370=125,43363,063+62,370=125,43363,063+62,370=125,433.
b) Count of integers from 111 to 600060006000 divisible by 222 or 333 or 555. Inclusion–
exclusion:
⌊60002⌋+⌊60003⌋+⌊60005⌋−⌊60006⌋−⌊600010⌋−⌊600015⌋+⌊600030⌋=4400.\left\lfloor\frac{6
000}{2}\right\rfloor+\left\lfloor\frac{6000}{3}\right\rfloor+\left\lfloor\frac{6000}{5}\right\rflo
or -\left\lfloor\frac{6000}{6}\right\rfloor-\left\lfloor\frac{6000}{10}\right\rfloor-
\left\lfloor\frac{6000}{15}\right\rfloor +\left\lfloor\frac{6000}{30}\right\rfloor=4400.⌊26000
⌋+⌊36000⌋+⌊56000⌋−⌊66000⌋−⌊106000⌋−⌊156000⌋+⌊306000⌋=4400.
c) Sequences of length 8 with two A's, two C's, two T's, two G's.
• Total permutations (multiset): 8!2!2!2!2!=2520.\frac{8!}{2!2!2!2!}=2520.2!2!2!2!8!
=2520.
• Treat A's as a block: items = (AA),C,C,T,T,G,G → permutations =
7!2!2!2!=630.\frac{7!}{2!2!2!}=630.2!2!2!7!=630.
Same for T's-block: 630.
• Both A's together AND T's together: treat (AA) and (TT) blocks → items =
(AA),(TT),C,C,G,G → permutations = 6!2!2!=180.\frac{6!}{2!2!}=180.2!2!6!=180.
By inclusion–exclusion: 630+630−180=1080.630+630-180=1080.630+630−180=1080.
d) Six-letter sequences from {A,B,C,…,G}\{A,B,C,\dots,G\}{A,B,C,…,G} (7 distinct letters)
without repetition where either the substring AD or AG appears (as consecutive letters in
that order).
• Total 6-letter permutations from 7 distinct letters:
P(7,6)=7⋅6⋅5⋅4⋅3⋅2=5040P(7,6)=7\cdot6\cdot5\cdot4\cdot3\cdot2=5040P(7,6)=7⋅6⋅5
⋅4⋅3⋅2=5040 (not needed for final but useful for context).
• Count sequences containing AD: treat AD as a single block, then choose remaining
4 distinct letters from the other 5 letters and arrange the 5 items:
(54)⋅5!=5⋅120=600.\binom{5}{4}\cdot5!=5\cdot120=600.(45)⋅5!=5⋅120=600.
• Same count for AG: 600600600.
• Both AD and AG cannot both occur (would require A twice), so no overlap.
Hence 600+600=1200.600+600=1200.600+600=1200.
e) Count integers in 301,302,…,7000301,302,\dots,7000301,302,…,7000 divisible by 6 or 8.
Use inclusion–exclusion:
• multiples of 6 in range: ⌊70006⌋−⌊3006⌋=1116\left\lfloor\frac{7000}{6}\right\rfloor-
\left\lfloor\frac{300}{6}\right\rfloor=1116⌊67000⌋−⌊6300⌋=1116.
• multiples of 8: ⌊70008⌋−⌊3008⌋=838\left\lfloor\frac{7000}{8}\right\rfloor-
\left\lfloor\frac{300}{8}\right\rfloor=838⌊87000⌋−⌊8300⌋=838.
• multiples of 24 (LCM): 279279279.
So total 1116+838−279=1675.1116+838-279=1675.1116+838−279=1675.
If you want, I can (a) show the grid with the counted paths highlighted for each route, or (b)
re-run any part with more explanation or alternate interpretations (e.g. if in (d) you meant
AD or AG appearing together in either order).
