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! While you're at it, check out some resources Treehouse students have shared here.
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![](https://ecs-static.teamtreehouse.com/assets/views/marketing/shared/community-banner-white-47072046c51352fe6a69f5e691ff5700b28bb11d45197d7bdf066d9ea3f72d0c.webp)
![kask](https://uploads.teamtreehouse.com/production/profile-photos/366302/micro_543287458473298.jpg)
kask
7,509 PointsHow would you write this and a explanation on how you got the answer?
I am not sure how to complete the challenge?
1 Answer
![Damien Watson](https://secure.gravatar.com/avatar/6ded20c936623938e538e66e64686b54?s=96&d=https%3A%2F%2Fecs-static.teamtreehouse.com%2Fassets%2Fcontent%2Fdefault_avatar-445fbbabfc8dc9188fb5967fe43322ee0c3e0dd1e10f378bf8343784af5a13eb.webp&r=pg)
Damien Watson
27,419 PointsHey, in swift you can use the 'modulo' or 'modulus' operator '%'. This returns a remainder.
In the example below, first it checks how many 'a' fit into 'b' and then returns the left over (not how many fit).
let a = 2
let b = 7
let c = b % a
// c = 7 % 2
// 2 fits 3 times into 7, leaving a 1 remainder, so:
// c = 1
The result being, check if the remainder of 2 is 1 (therefore an odd number) and 7 is 0 (meaning the number is divisible by 7, leaving no remainder).
var results: [Int] = []
for n in 1...100 {
if (n%2==1 && n%7==0) {
results.append(n)
}
}
kask
7,509 Pointskask
7,509 PointsThanks for the help