Welcome to the Treehouse Community
Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community!
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.
Start your free trial
Ryan Maneo
4,342 PointsUnknown
I'm not sure where to go from here. I rematched the previous video, but it doesn't say anything about determining odd numbers. I imagine to determine a multiple you just do number * 7 = true or something?
var results: [Int] = []
for n in 1...100 {
// Enter your code below
// End code
}
1 Answer

Dylan Shine
17,565 Pointsvar results: [Int] = []
for n in 1...100 { if n % 7 == 0 && n % 2 != 0 { results.append(n) } }
Given two positive numbers, a (the dividend) and n (the divisor), the modulo operator gives us the remainder of the Euclidean division of a by n.