{"id":92777,"date":"2025-06-01T11:32:23","date_gmt":"2025-06-01T11:32:23","guid":{"rendered":"https:\/\/exam.pscnotes.com\/mcq\/?p=92777"},"modified":"2025-06-01T11:32:23","modified_gmt":"2025-06-01T11:32:23","slug":"suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is","status":"publish","type":"post","link":"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/","title":{"rendered":"Suppose x is the smallest integer greater than 3 such that when it is"},"content":{"rendered":"<p>Suppose x is the smallest integer greater than 3 such that when it is divided by 6 or 8, the remainder is 3. y is the smallest integer greater than 2 such that when it is divided by 6 or 8, the remainder is 2. What is x \u2013 y ?<\/p>\n<p>[amp_mcq option1=&#8221;1&#8243; option2=&#8221;2&#8243; option3=&#8221;3&#8243; option4=&#8221;4&#8243; correct=&#8221;option1&#8243;]<\/p>\n<div class=\"psc-box-pyq-exam-year-detail\">\n<div class=\"pyq-exam\">\n<div class=\"psc-heading\">This question was previously asked in<\/div>\n<div class=\"psc-title line-ellipsis\">UPSC CISF-AC-EXE &#8211; 2020<\/div>\n<\/div>\n<div class=\"pyq-exam-psc-buttons\"><a href=\"\/pyq\/pyq-upsc-cisf-ac-exe-2020.pdf\" target=\"_blank\" class=\"psc-pdf-button\" rel=\"noopener\">Download PDF<\/a><a href=\"\/pyq-upsc-cisf-ac-exe-2020\" target=\"_blank\" class=\"psc-attempt-button\" rel=\"noopener\">Attempt Online<\/a><\/div>\n<\/div>\n<section id=\"pyq-correct-answer\">\nFor x:<br \/>\nx is the smallest integer greater than 3.<br \/>\nWhen x is divided by 6, the remainder is 3. This can be written as $x \\equiv 3 \\pmod 6$, or $x &#8211; 3$ is divisible by 6.<br \/>\nWhen x is divided by 8, the remainder is 3. This can be written as $x \\equiv 3 \\pmod 8$, or $x &#8211; 3$ is divisible by 8.<br \/>\nSo, $x &#8211; 3$ is a common multiple of 6 and 8.<br \/>\nTo find the smallest such integer x, $x-3$ must be the smallest positive common multiple of 6 and 8. This is the Least Common Multiple (LCM) of 6 and 8.<br \/>\nPrime factorization of 6 = $2 \\times 3$.<br \/>\nPrime factorization of 8 = $2^3$.<br \/>\nLCM(6, 8) = $2^3 \\times 3 = 8 \\times 3 = 24$.<br \/>\nSo, $x &#8211; 3$ must be a multiple of 24. $x &#8211; 3 = 24k$ for some integer k.<br \/>\n$x = 24k + 3$.<br \/>\nWe need the smallest integer x greater than 3.<br \/>\nIf k=0, $x = 24(0) + 3 = 3$. This is not greater than 3.<br \/>\nIf k=1, $x = 24(1) + 3 = 27$. This is greater than 3 and is the smallest value of x satisfying the condition. So, $x=27$.<\/p>\n<p>For y:<br \/>\ny is the smallest integer greater than 2.<br \/>\nWhen y is divided by 6, the remainder is 2. This can be written as $y \\equiv 2 \\pmod 6$, or $y &#8211; 2$ is divisible by 6.<br \/>\nWhen y is divided by 8, the remainder is 2. This can be written as $y \\equiv 2 \\pmod 8$, or $y &#8211; 2$ is divisible by 8.<br \/>\nSo, $y &#8211; 2$ is a common multiple of 6 and 8.<br \/>\nTo find the smallest such integer y, $y-2$ must be the smallest positive common multiple of 6 and 8. This is the LCM(6, 8).<br \/>\nLCM(6, 8) = 24.<br \/>\nSo, $y &#8211; 2$ must be a multiple of 24. $y &#8211; 2 = 24j$ for some integer j.<br \/>\n$y = 24j + 2$.<br \/>\nWe need the smallest integer y greater than 2.<br \/>\nIf j=0, $y = 24(0) + 2 = 2$. This is not greater than 2.<br \/>\nIf j=1, $y = 24(1) + 2 = 26$. This is greater than 2 and is the smallest value of y satisfying the condition. So, $y=26$.<\/p>\n<p>The question asks for the value of $x &#8211; y$.<br \/>\n$x &#8211; y = 27 &#8211; 26 = 1$.<br \/>\n<\/section>\n<section id=\"pyq-key-points\">\n&#8211; Understanding the concept of remainder and modular arithmetic.<br \/>\n&#8211; If a number gives the same remainder when divided by several numbers, then the number minus the remainder is divisible by the LCM of those numbers.<br \/>\n&#8211; Finding the smallest integer greater than a given value that satisfies the property.<br \/>\n<\/section>\n<section id=\"pyq-additional-information\">\nThe general form of numbers satisfying $N \\equiv r \\pmod a$ and $N \\equiv r \\pmod b$ is $N \\equiv r \\pmod{LCM(a, b)}$.<br \/>\n<\/section>\n","protected":false},"excerpt":{"rendered":"<p>Suppose x is the smallest integer greater than 3 such that when it is divided by 6 or 8, the remainder is 3. y is the smallest integer greater than 2 such that when it is divided by 6 or 8, the remainder is 2. What is x \u2013 y ? [amp_mcq option1=&#8221;1&#8243; option2=&#8221;2&#8243; option3=&#8221;3&#8243; &#8230; <\/p>\n<p class=\"read-more-container\"><a title=\"Suppose x is the smallest integer greater than 3 such that when it is\" class=\"read-more button\" href=\"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/#more-92777\">Detailed Solution<span class=\"screen-reader-text\">Suppose x is the smallest integer greater than 3 such that when it is<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1089],"tags":[1288,1102],"class_list":["post-92777","post","type-post","status-publish","format-standard","hentry","category-upsc-cisf-ac-exe","tag-1288","tag-quantitative-aptitude-and-reasoning","no-featured-image-padding"],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v22.2 (Yoast SEO v23.3) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Suppose x is the smallest integer greater than 3 such that when it is<\/title>\n<meta name=\"description\" content=\"For x: x is the smallest integer greater than 3. When x is divided by 6, the remainder is 3. This can be written as $x equiv 3 pmod 6$, or $x - 3$ is divisible by 6. When x is divided by 8, the remainder is 3. This can be written as $x equiv 3 pmod 8$, or $x - 3$ is divisible by 8. So, $x - 3$ is a common multiple of 6 and 8. To find the smallest such integer x, $x-3$ must be the smallest positive common multiple of 6 and 8. This is the Least Common Multiple (LCM) of 6 and 8. Prime factorization of 6 = $2 times 3$. Prime factorization of 8 = $2^3$. LCM(6, 8) = $2^3 times 3 = 8 times 3 = 24$. So, $x - 3$ must be a multiple of 24. $x - 3 = 24k$ for some integer k. $x = 24k + 3$. We need the smallest integer x greater than 3. If k=0, $x = 24(0) + 3 = 3$. This is not greater than 3. If k=1, $x = 24(1) + 3 = 27$. This is greater than 3 and is the smallest value of x satisfying the condition. So, $x=27$. For y: y is the smallest integer greater than 2. When y is divided by 6, the remainder is 2. This can be written as $y equiv 2 pmod 6$, or $y - 2$ is divisible by 6. When y is divided by 8, the remainder is 2. This can be written as $y equiv 2 pmod 8$, or $y - 2$ is divisible by 8. So, $y - 2$ is a common multiple of 6 and 8. To find the smallest such integer y, $y-2$ must be the smallest positive common multiple of 6 and 8. This is the LCM(6, 8). LCM(6, 8) = 24. So, $y - 2$ must be a multiple of 24. $y - 2 = 24j$ for some integer j. $y = 24j + 2$. We need the smallest integer y greater than 2. If j=0, $y = 24(0) + 2 = 2$. This is not greater than 2. If j=1, $y = 24(1) + 2 = 26$. This is greater than 2 and is the smallest value of y satisfying the condition. So, $y=26$. The question asks for the value of $x - y$. $x - y = 27 - 26 = 1$. - Understanding the concept of remainder and modular arithmetic. - If a number gives the same remainder when divided by several numbers, then the number minus the remainder is divisible by the LCM of those numbers. - Finding the smallest integer greater than a given value that satisfies the property.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Suppose x is the smallest integer greater than 3 such that when it is\" \/>\n<meta property=\"og:description\" content=\"For x: x is the smallest integer greater than 3. When x is divided by 6, the remainder is 3. This can be written as $x equiv 3 pmod 6$, or $x - 3$ is divisible by 6. When x is divided by 8, the remainder is 3. This can be written as $x equiv 3 pmod 8$, or $x - 3$ is divisible by 8. So, $x - 3$ is a common multiple of 6 and 8. To find the smallest such integer x, $x-3$ must be the smallest positive common multiple of 6 and 8. This is the Least Common Multiple (LCM) of 6 and 8. Prime factorization of 6 = $2 times 3$. Prime factorization of 8 = $2^3$. LCM(6, 8) = $2^3 times 3 = 8 times 3 = 24$. So, $x - 3$ must be a multiple of 24. $x - 3 = 24k$ for some integer k. $x = 24k + 3$. We need the smallest integer x greater than 3. If k=0, $x = 24(0) + 3 = 3$. This is not greater than 3. If k=1, $x = 24(1) + 3 = 27$. This is greater than 3 and is the smallest value of x satisfying the condition. So, $x=27$. For y: y is the smallest integer greater than 2. When y is divided by 6, the remainder is 2. This can be written as $y equiv 2 pmod 6$, or $y - 2$ is divisible by 6. When y is divided by 8, the remainder is 2. This can be written as $y equiv 2 pmod 8$, or $y - 2$ is divisible by 8. So, $y - 2$ is a common multiple of 6 and 8. To find the smallest such integer y, $y-2$ must be the smallest positive common multiple of 6 and 8. This is the LCM(6, 8). LCM(6, 8) = 24. So, $y - 2$ must be a multiple of 24. $y - 2 = 24j$ for some integer j. $y = 24j + 2$. We need the smallest integer y greater than 2. If j=0, $y = 24(0) + 2 = 2$. This is not greater than 2. If j=1, $y = 24(1) + 2 = 26$. This is greater than 2 and is the smallest value of y satisfying the condition. So, $y=26$. The question asks for the value of $x - y$. $x - y = 27 - 26 = 1$. - Understanding the concept of remainder and modular arithmetic. - If a number gives the same remainder when divided by several numbers, then the number minus the remainder is divisible by the LCM of those numbers. - Finding the smallest integer greater than a given value that satisfies the property.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/\" \/>\n<meta property=\"og:site_name\" content=\"MCQ and Quiz for Exams\" \/>\n<meta property=\"article:published_time\" content=\"2025-06-01T11:32:23+00:00\" \/>\n<meta name=\"author\" content=\"rawan239\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"rawan239\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Suppose x is the smallest integer greater than 3 such that when it is","description":"For x: x is the smallest integer greater than 3. When x is divided by 6, the remainder is 3. This can be written as $x equiv 3 pmod 6$, or $x - 3$ is divisible by 6. When x is divided by 8, the remainder is 3. This can be written as $x equiv 3 pmod 8$, or $x - 3$ is divisible by 8. So, $x - 3$ is a common multiple of 6 and 8. To find the smallest such integer x, $x-3$ must be the smallest positive common multiple of 6 and 8. This is the Least Common Multiple (LCM) of 6 and 8. Prime factorization of 6 = $2 times 3$. Prime factorization of 8 = $2^3$. LCM(6, 8) = $2^3 times 3 = 8 times 3 = 24$. So, $x - 3$ must be a multiple of 24. $x - 3 = 24k$ for some integer k. $x = 24k + 3$. We need the smallest integer x greater than 3. If k=0, $x = 24(0) + 3 = 3$. This is not greater than 3. If k=1, $x = 24(1) + 3 = 27$. This is greater than 3 and is the smallest value of x satisfying the condition. So, $x=27$. For y: y is the smallest integer greater than 2. When y is divided by 6, the remainder is 2. This can be written as $y equiv 2 pmod 6$, or $y - 2$ is divisible by 6. When y is divided by 8, the remainder is 2. This can be written as $y equiv 2 pmod 8$, or $y - 2$ is divisible by 8. So, $y - 2$ is a common multiple of 6 and 8. To find the smallest such integer y, $y-2$ must be the smallest positive common multiple of 6 and 8. This is the LCM(6, 8). LCM(6, 8) = 24. So, $y - 2$ must be a multiple of 24. $y - 2 = 24j$ for some integer j. $y = 24j + 2$. We need the smallest integer y greater than 2. If j=0, $y = 24(0) + 2 = 2$. This is not greater than 2. If j=1, $y = 24(1) + 2 = 26$. This is greater than 2 and is the smallest value of y satisfying the condition. So, $y=26$. The question asks for the value of $x - y$. $x - y = 27 - 26 = 1$. - Understanding the concept of remainder and modular arithmetic. - If a number gives the same remainder when divided by several numbers, then the number minus the remainder is divisible by the LCM of those numbers. - Finding the smallest integer greater than a given value that satisfies the property.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/","og_locale":"en_US","og_type":"article","og_title":"Suppose x is the smallest integer greater than 3 such that when it is","og_description":"For x: x is the smallest integer greater than 3. When x is divided by 6, the remainder is 3. This can be written as $x equiv 3 pmod 6$, or $x - 3$ is divisible by 6. When x is divided by 8, the remainder is 3. This can be written as $x equiv 3 pmod 8$, or $x - 3$ is divisible by 8. So, $x - 3$ is a common multiple of 6 and 8. To find the smallest such integer x, $x-3$ must be the smallest positive common multiple of 6 and 8. This is the Least Common Multiple (LCM) of 6 and 8. Prime factorization of 6 = $2 times 3$. Prime factorization of 8 = $2^3$. LCM(6, 8) = $2^3 times 3 = 8 times 3 = 24$. So, $x - 3$ must be a multiple of 24. $x - 3 = 24k$ for some integer k. $x = 24k + 3$. We need the smallest integer x greater than 3. If k=0, $x = 24(0) + 3 = 3$. This is not greater than 3. If k=1, $x = 24(1) + 3 = 27$. This is greater than 3 and is the smallest value of x satisfying the condition. So, $x=27$. For y: y is the smallest integer greater than 2. When y is divided by 6, the remainder is 2. This can be written as $y equiv 2 pmod 6$, or $y - 2$ is divisible by 6. When y is divided by 8, the remainder is 2. This can be written as $y equiv 2 pmod 8$, or $y - 2$ is divisible by 8. So, $y - 2$ is a common multiple of 6 and 8. To find the smallest such integer y, $y-2$ must be the smallest positive common multiple of 6 and 8. This is the LCM(6, 8). LCM(6, 8) = 24. So, $y - 2$ must be a multiple of 24. $y - 2 = 24j$ for some integer j. $y = 24j + 2$. We need the smallest integer y greater than 2. If j=0, $y = 24(0) + 2 = 2$. This is not greater than 2. If j=1, $y = 24(1) + 2 = 26$. This is greater than 2 and is the smallest value of y satisfying the condition. So, $y=26$. The question asks for the value of $x - y$. $x - y = 27 - 26 = 1$. - Understanding the concept of remainder and modular arithmetic. - If a number gives the same remainder when divided by several numbers, then the number minus the remainder is divisible by the LCM of those numbers. - Finding the smallest integer greater than a given value that satisfies the property.","og_url":"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/","og_site_name":"MCQ and Quiz for Exams","article_published_time":"2025-06-01T11:32:23+00:00","author":"rawan239","twitter_card":"summary_large_image","twitter_misc":{"Written by":"rawan239","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/","url":"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/","name":"Suppose x is the smallest integer greater than 3 such that when it is","isPartOf":{"@id":"https:\/\/exam.pscnotes.com\/mcq\/#website"},"datePublished":"2025-06-01T11:32:23+00:00","dateModified":"2025-06-01T11:32:23+00:00","author":{"@id":"https:\/\/exam.pscnotes.com\/mcq\/#\/schema\/person\/5807dafeb27d2ec82344d6cbd6c3d209"},"description":"For x: x is the smallest integer greater than 3. When x is divided by 6, the remainder is 3. This can be written as $x \\equiv 3 \\pmod 6$, or $x - 3$ is divisible by 6. When x is divided by 8, the remainder is 3. This can be written as $x \\equiv 3 \\pmod 8$, or $x - 3$ is divisible by 8. So, $x - 3$ is a common multiple of 6 and 8. To find the smallest such integer x, $x-3$ must be the smallest positive common multiple of 6 and 8. This is the Least Common Multiple (LCM) of 6 and 8. Prime factorization of 6 = $2 \\times 3$. Prime factorization of 8 = $2^3$. LCM(6, 8) = $2^3 \\times 3 = 8 \\times 3 = 24$. So, $x - 3$ must be a multiple of 24. $x - 3 = 24k$ for some integer k. $x = 24k + 3$. We need the smallest integer x greater than 3. If k=0, $x = 24(0) + 3 = 3$. This is not greater than 3. If k=1, $x = 24(1) + 3 = 27$. This is greater than 3 and is the smallest value of x satisfying the condition. So, $x=27$. For y: y is the smallest integer greater than 2. When y is divided by 6, the remainder is 2. This can be written as $y \\equiv 2 \\pmod 6$, or $y - 2$ is divisible by 6. When y is divided by 8, the remainder is 2. This can be written as $y \\equiv 2 \\pmod 8$, or $y - 2$ is divisible by 8. So, $y - 2$ is a common multiple of 6 and 8. To find the smallest such integer y, $y-2$ must be the smallest positive common multiple of 6 and 8. This is the LCM(6, 8). LCM(6, 8) = 24. So, $y - 2$ must be a multiple of 24. $y - 2 = 24j$ for some integer j. $y = 24j + 2$. We need the smallest integer y greater than 2. If j=0, $y = 24(0) + 2 = 2$. This is not greater than 2. If j=1, $y = 24(1) + 2 = 26$. This is greater than 2 and is the smallest value of y satisfying the condition. So, $y=26$. The question asks for the value of $x - y$. $x - y = 27 - 26 = 1$. - Understanding the concept of remainder and modular arithmetic. - If a number gives the same remainder when divided by several numbers, then the number minus the remainder is divisible by the LCM of those numbers. - Finding the smallest integer greater than a given value that satisfies the property.","breadcrumb":{"@id":"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/exam.pscnotes.com\/mcq\/suppose-x-is-the-smallest-integer-greater-than-3-such-that-when-it-is\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/exam.pscnotes.com\/mcq\/"},{"@type":"ListItem","position":2,"name":"UPSC CISF-AC-EXE","item":"https:\/\/exam.pscnotes.com\/mcq\/category\/upsc-cisf-ac-exe\/"},{"@type":"ListItem","position":3,"name":"Suppose x is the smallest integer greater than 3 such that when it is"}]},{"@type":"WebSite","@id":"https:\/\/exam.pscnotes.com\/mcq\/#website","url":"https:\/\/exam.pscnotes.com\/mcq\/","name":"MCQ and Quiz for Exams","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/exam.pscnotes.com\/mcq\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/exam.pscnotes.com\/mcq\/#\/schema\/person\/5807dafeb27d2ec82344d6cbd6c3d209","name":"rawan239","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/exam.pscnotes.com\/mcq\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/761a7274f9cce048fa5b921221e7934820d74514df93ef195a9d22af0c1c9001?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/761a7274f9cce048fa5b921221e7934820d74514df93ef195a9d22af0c1c9001?s=96&d=mm&r=g","caption":"rawan239"},"sameAs":["https:\/\/exam.pscnotes.com"],"url":"https:\/\/exam.pscnotes.com\/mcq\/author\/rawan239\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/posts\/92777","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/comments?post=92777"}],"version-history":[{"count":0,"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/posts\/92777\/revisions"}],"wp:attachment":[{"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/media?parent=92777"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/categories?post=92777"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/exam.pscnotes.com\/mcq\/wp-json\/wp\/v2\/tags?post=92777"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}