Challenge: Filtering Numbers in a Loop
Uppgift
Swipe to start coding
Find the sum of all numbers from 1 to n
, excluding those that are divisible by 3 or 5.
- Create a method called
sumNotDivisibleBy3Or5(int n)
that returns anint
. - Inside this method, create a
for
loop that iterates from 1 ton
(inclusive). - In each iteration, check if the number is not divisible by 3 and not divisible by 5.
- If the number passes the condition, add it to a running total
sum
. - Return the total
sum
after the loop ends.
Lösning
solution.java
Var allt tydligt?
Tack för dina kommentarer!
Avsnitt 3. Kapitel 8
single
Fråga AI
Fråga AI
Fråga vad du vill eller prova någon av de föreslagna frågorna för att starta vårt samtal
Awesome!
Completion rate improved to 2.7
Challenge: Filtering Numbers in a Loop
Svep för att visa menyn
Uppgift
Swipe to start coding
Find the sum of all numbers from 1 to n
, excluding those that are divisible by 3 or 5.
- Create a method called
sumNotDivisibleBy3Or5(int n)
that returns anint
. - Inside this method, create a
for
loop that iterates from 1 ton
(inclusive). - In each iteration, check if the number is not divisible by 3 and not divisible by 5.
- If the number passes the condition, add it to a running total
sum
. - Return the total
sum
after the loop ends.
Lösning
solution.java
Var allt tydligt?
Tack för dina kommentarer!
Awesome!
Completion rate improved to 2.7Avsnitt 3. Kapitel 8
single