OG 2016 Tracker >>> OG2016 Problem Solving Video Solutions (OG Practice)



OG 2016 Numbering:
*denotes GMATPill Video Explanation provided
1 | 2 | 3 | 4* | 5* | 6* | 7* | 8* | 9* | 10* | 11 | 12* | 13 | 14 | 15 | 16* | 17 | 18 | 19* | 20* | 20 | 21 | 22* | 23* | 24* | 25 | 26* | 27 | 28* | 29* | 30 | 31 | 32* | 33 | 34* | 35* | 36* | 37* | 38 | 39 | 40* | 41* | 42* | 43 | 44 | 45 | 46* | 47* | 48* | 49* | 50* | 51* | 52* | 53* | 54* | 55 | 56 | 57 | 58* | 59 | 60 | 61 | 62* | 63 | 64* | 65* | 66 | 67 | 68 | 69 | 70 | 71* | 72* | 73 | 74* | 75* | 76 | 77* | 78* | 79* | 80* | 81* | 82 | 83 | 84* | 85 | 86 | 87 | 88 | 89 | 90* | 91 | 92* | 93* | 94* | 95* | 96* | 97 | 98* | 99 | 100* | 101* | 102* | 103* | 104* | 105* | 106* | 107 | 108 | 109* | 110* | 111 | 112* | 113* | 114 | 115* | 116* | 117 | 118* | 119* | 120* | 121* | 122 | 123* | 124 | 125 | 126 | 127 | 128 | 129 | 130 | 131 | 132 | 133 | 134 | 135 | 136 | 137 | 138 | 139 | 140 | 141 | 142 | 143 | 144 | 145 | 146 | 147 | 148 | 149 | 150 | 151 | 152 | 153 | 154 | 155 | 156 | 157 | 158 | 159 | 160 | 161 | 162 | 163 | 164 | 165 | 166 | 167 | 168 | 169 | 170 | 171 | 172 | 173 | 174 | 175 | 176 | 177 | 178 | 179 | 180 | 181 | 182 | 183 | 184 | 185 | 186 | 187 | 188 | 189 | 190 | 191 | 192 | 193 | 194 | 195 | 196 | 197 | 198 | 199 | 201 | 202 | 203 | 204 | 205 | 206 | 207 | 208 | 209 | 210 | 211 | 212 | 213* | 214* | 215* | 216* | 217* | 218* | 219* | 220* | 221* | 222* | 223* | 224* | 225* | 226* | 227 | 228* | 229* | 230*

OG2016 PS Practice #152.
A researcher plans to identify each participant in a certain medical experiment with a code consisting of either a single letter or a pair of distinct letters written in alphabetical order. What is the least number of letters that can be used if there are 12 participants, and each participant is to receive a different code?
4
5
6
7
8

Ask GMATPill



Other Comments

About us
Contact us
Privacy Policy
Terms & Conditions
GMATTM is a registered trademark of the Graduate Management Admission CouncilTM. The Graduate Management Admission CouncilTM does not endorse, nor is it affiliated in any way with the owner or any content of this web site.