Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1986 AJHSME Problems/Problem 17"
(→‎Solution 2)
Line 26: Line 26:
  
 
We are given that <math>\text{o}\equiv 1\pmod{2}</math>, so in mod <math>2</math> we have <cmath>1^2+1(n) = n+1</cmath> which is odd only if <math>\text{n}</math> is even <math>\rightarrow \boxed{\text{E}}</math>
 
We are given that <math>\text{o}\equiv 1\pmod{2}</math>, so in mod <math>2</math> we have <cmath>1^2+1(n) = n+1</cmath> which is odd only if <math>\text{n}</math> is even <math>\rightarrow \boxed{\text{E}}</math>
 +
 +
 +
===Solution 3===
  
 
==See Also==
 
==See Also==

Revision as of 20:05, 8 July 2020

Problem

Let $\text{o}$ be an odd whole number and let $\text{n}$ be any whole number. Which of the following statements about the whole number $(\text{o}^2+\text{no})$ is always true?

$\text{(A)}\ \text{it is always odd} \qquad \text{(B)}\ \text{it is always even}$

$\text{(C)}\ \text{it is even only if n is even} \qquad \text{(D)}\ \text{it is odd only if n is odd}$

$\text{(E)}\ \text{it is odd only if n is even}$

Solution

Solution 1

We can solve this problem using logic.

Let's say that $\text{n}$ is odd. If $\text{n}$ is odd, then obviously $\text{no}$ will be odd as well, since $\text{o}$ is odd, and the product of two odd numbers is odd. Since $\text{o}$ is odd, $\text{o}^2$ will also be odd. And adding two odd numbers makes an even number, so if $\text{n}$ is odd, the entire expression is even.

Let's say that $\text{n}$ is even. If $\text{n}$ is even, then $\text{no}$ will be even as well, because the product of an odd and an even is even. $\text{o}^2$ will still be odd. That means that the entire expression will be odd, since the sum of an odd and an even is odd.

Looking at the multiple choices, we see that our second case fits choice E exactly.

$\boxed{\text{E}}$

Solution 2

We are given that $\text{o}\equiv 1\pmod{2}$, so in mod $2$ we have \[1^2+1(n) = n+1\] which is odd only if $\text{n}$ is even $\rightarrow \boxed{\text{E}}$


Solution 3

See Also

1986 AJHSME (Problems • Answer Key • Resources)
Preceded by
Problem 16 		Followed by
Problem 18
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AJHSME/AMC 8 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1986_AJHSME_Problems/Problem_17&oldid=127843"