Project Euler #1: Sum of Multiples of 3 and 5 below 1000 Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30 pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Project Euler problem 1 in Python - Multiples of 3 and 5Finding the sum of all the multiples of 3 or 5 below 1000, using list comprehensionProject Euler 1 (sum of multiples of 3 or 5 under 1000)Project Euler 38: Pandigital MultiplesProject Euler #1 Sum of all the multiples of 3 or 5 below 1000Project Euler 25 - 1000-digit Fibonacci NumberProject Euler Problem 52: Permuted multiplesProject Euler #1 Sum of multiples of 3 and 5Sum of all multiples of 3 or 5 below 1000 (Project Euler #1 - typical)Sum of multiples of 3 or 5 using functional programmingAdd multiples of 3 or 5 below 1000, Can this code be optimised. Project Euler #1

Writing a T-SQL stored procedure to receive 4 numbers and insert them into a table

How to begin with a paragraph in latex

When speaking, how do you change your mind mid-sentence?

What *exactly* is electrical current, voltage, and resistance?

What does the black goddess statue do and what is it?

How was Lagrange appointed professor of mathematics so early?

How do I deal with an erroneously large refund?

What is ls Largest Number Formed by only moving two sticks in 508?

What is the purpose of the side handle on a hand ("eggbeater") drill?

Like totally amazing interchangeable sister outfit accessory swapping or whatever

How can I wire a 9-position switch so that each position turns on one more LED than the one before?

How to keep bees out of canned beverages?

Raising a bilingual kid. When should we introduce the majority language?

Will I lose my paid in full property

How to compute a Jacobian using polar coordinates?

What's called a person who works as someone who puts products on shelves in stores?

Is there a way to fake a method response using Mock or Stubs?

/bin/ls sorts differently than just ls

false 'Security alert' from Google - every login generates mails from 'no-reply@accounts.google.com'

France's Public Holidays' Puzzle

How to translate "red flag" into Spanish?

Determinant of a matrix with 2 equal rows

Does using the Inspiration rules for character defects encourage My Guy Syndrome?

Why is water being consumed when my shutoff valve is closed?



Project Euler #1: Sum of Multiples of 3 and 5 below 1000



Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30 pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Project Euler problem 1 in Python - Multiples of 3 and 5Finding the sum of all the multiples of 3 or 5 below 1000, using list comprehensionProject Euler 1 (sum of multiples of 3 or 5 under 1000)Project Euler 38: Pandigital MultiplesProject Euler #1 Sum of all the multiples of 3 or 5 below 1000Project Euler 25 - 1000-digit Fibonacci NumberProject Euler Problem 52: Permuted multiplesProject Euler #1 Sum of multiples of 3 and 5Sum of all multiples of 3 or 5 below 1000 (Project Euler #1 - typical)Sum of multiples of 3 or 5 using functional programmingAdd multiples of 3 or 5 below 1000, Can this code be optimised. Project Euler #1



.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








3












$begingroup$


def prob_1():
sum_mult=[] #Create an empty list which will take sum of multiples of 3 and 5
check_sum=0
for i in range(1,1000): #Take numbers till 1000
#if(i)
if( (i%3)==0 or (i%5)==0 ): #divisor condition
sum_mult.append(i)

return sum(sum_mult) #return sum of list


I am just starting out my journey as a programmer, here is my code and I would love to see any critical feedback and other alternative solutions maybe using some clever hack of using lambda function's etc.










share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$











  • $begingroup$
    To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:05










  • $begingroup$
    I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:18






  • 2




    $begingroup$
    Is i % 35 really the condition you would like to check?
    $endgroup$
    – Alex
    Apr 17 at 7:00

















3












$begingroup$


def prob_1():
sum_mult=[] #Create an empty list which will take sum of multiples of 3 and 5
check_sum=0
for i in range(1,1000): #Take numbers till 1000
#if(i)
if( (i%3)==0 or (i%5)==0 ): #divisor condition
sum_mult.append(i)

return sum(sum_mult) #return sum of list


I am just starting out my journey as a programmer, here is my code and I would love to see any critical feedback and other alternative solutions maybe using some clever hack of using lambda function's etc.










share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$











  • $begingroup$
    To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:05










  • $begingroup$
    I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:18






  • 2




    $begingroup$
    Is i % 35 really the condition you would like to check?
    $endgroup$
    – Alex
    Apr 17 at 7:00













3












3








3





$begingroup$


def prob_1():
sum_mult=[] #Create an empty list which will take sum of multiples of 3 and 5
check_sum=0
for i in range(1,1000): #Take numbers till 1000
#if(i)
if( (i%3)==0 or (i%5)==0 ): #divisor condition
sum_mult.append(i)

return sum(sum_mult) #return sum of list


I am just starting out my journey as a programmer, here is my code and I would love to see any critical feedback and other alternative solutions maybe using some clever hack of using lambda function's etc.










share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




def prob_1():
sum_mult=[] #Create an empty list which will take sum of multiples of 3 and 5
check_sum=0
for i in range(1,1000): #Take numbers till 1000
#if(i)
if( (i%3)==0 or (i%5)==0 ): #divisor condition
sum_mult.append(i)

return sum(sum_mult) #return sum of list


I am just starting out my journey as a programmer, here is my code and I would love to see any critical feedback and other alternative solutions maybe using some clever hack of using lambda function's etc.







python performance python-3.x programming-challenge






share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited Apr 18 at 6:15







DjVasu













New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Apr 17 at 4:20









DjVasuDjVasu

163




163




New contributor




DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






DjVasu is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











  • $begingroup$
    To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:05










  • $begingroup$
    I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:18






  • 2




    $begingroup$
    Is i % 35 really the condition you would like to check?
    $endgroup$
    – Alex
    Apr 17 at 7:00
















  • $begingroup$
    To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:05










  • $begingroup$
    I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
    $endgroup$
    – Roland Illig
    Apr 17 at 6:18






  • 2




    $begingroup$
    Is i % 35 really the condition you would like to check?
    $endgroup$
    – Alex
    Apr 17 at 7:00















$begingroup$
To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
$endgroup$
– Roland Illig
Apr 17 at 6:05




$begingroup$
To make this program really fast, look at any other review on this site that is also about Project Euler #1. The programming language doesn't matter, it's basically the same in all languages.
$endgroup$
– Roland Illig
Apr 17 at 6:05












$begingroup$
I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
$endgroup$
– Roland Illig
Apr 17 at 6:18




$begingroup$
I'm especially thinking about codereview.stackexchange.com/a/280, which is really fast.
$endgroup$
– Roland Illig
Apr 17 at 6:18




2




2




$begingroup$
Is i % 35 really the condition you would like to check?
$endgroup$
– Alex
Apr 17 at 7:00




$begingroup$
Is i % 35 really the condition you would like to check?
$endgroup$
– Alex
Apr 17 at 7:00










1 Answer
1






active

oldest

votes


















8












$begingroup$

I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.






share|improve this answer











$endgroup$












  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17











Your Answer






StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);






DjVasu is a new contributor. Be nice, and check out our Code of Conduct.









draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217598%2fproject-euler-1-sum-of-multiples-of-3-and-5-below-1000%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









8












$begingroup$

I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.






share|improve this answer











$endgroup$












  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17















8












$begingroup$

I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.






share|improve this answer











$endgroup$












  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17













8












8








8





$begingroup$

I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.






share|improve this answer











$endgroup$



I expect you made a typo. You don't want (i%35)==0, you want (i%5)==0.




The PEP-8 style guide for Python requires 1 space before and after operators, and after commas. Use PyLint or equivalent tool to ensure you follow all of the PEP-8 guidelines.




check_sum is unused, and can be omitted.




The brackets around the if( ... ): condition are unnecessary. This is Python, not C, C++ or Java:



 if (i % 3) == 0 or (i % 5) == 0: #divisor condition



There is no need to create a list just to add up all the numbers after the fact. You are only using each value once, so you could simply add the numbers up as you find them:



def prob_1():

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You should add """doc_strings""" to your functions:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

sum_of_multiples = 0

for i in range(1, 1000): # Take numbers up to but not including 1000
if (i % 3) == 0 or (i % 5) == 0: #divisor condition
sum_of_multiples += i

return sum_of_multiples



You can use list comprehension a generator expression (thanks @Graipher) and the sum(...) function to compute the result, without ever creating the list in memory:



def prob_1():
"""
Compute the sum of all the multiples of 3 or 5 below 1000.

Returns:
The sum of the multiples of 3 or 5, below 1000.
"""

return sum(i for i in range(1000) if i % 3 == 0 or i % 5 == 0)



You can also solve this problem by hand with a pen, a sheet of paper, a calculator and about 1 minute of your time. A program is entirely unnecessary.







share|improve this answer














share|improve this answer



share|improve this answer








edited Apr 17 at 13:29

























answered Apr 17 at 5:05









AJNeufeldAJNeufeld

7,1391723




7,1391723











  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17
















  • $begingroup$
    You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
    $endgroup$
    – Bailey Parker
    Apr 17 at 21:00










  • $begingroup$
    Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
    $endgroup$
    – Sigur
    Apr 17 at 23:21











  • $begingroup$
    @Sigur yeah you can take two sets and apply union also.
    $endgroup$
    – DjVasu
    Apr 18 at 6:17















$begingroup$
You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
$endgroup$
– Bailey Parker
Apr 17 at 21:00




$begingroup$
You eventually arrive at it, but I'd also add that it is not common to parenthesize the modulo operator (or most other infix operators) like that. i % 3 == 0 is preferred to (i % 3) == 0.
$endgroup$
– Bailey Parker
Apr 17 at 21:00












$begingroup$
Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
$endgroup$
– Sigur
Apr 17 at 23:21





$begingroup$
Should be and instead of or, I think. OP wants multiple of 3 and 5. So, 3,6,9,12,15,... intersects 5,10,15,20,...
$endgroup$
– Sigur
Apr 17 at 23:21













$begingroup$
@Sigur yeah you can take two sets and apply union also.
$endgroup$
– DjVasu
Apr 18 at 6:17




$begingroup$
@Sigur yeah you can take two sets and apply union also.
$endgroup$
– DjVasu
Apr 18 at 6:17










DjVasu is a new contributor. Be nice, and check out our Code of Conduct.









draft saved

draft discarded


















DjVasu is a new contributor. Be nice, and check out our Code of Conduct.












DjVasu is a new contributor. Be nice, and check out our Code of Conduct.











DjVasu is a new contributor. Be nice, and check out our Code of Conduct.














Thanks for contributing an answer to Code Review Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217598%2fproject-euler-1-sum-of-multiples-of-3-and-5-below-1000%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Club Baloncesto Breogán Índice Historia | Pavillón | Nome | O Breogán na cultura popular | Xogadores | Adestradores | Presidentes | Palmarés | Historial | Líderes | Notas | Véxase tamén | Menú de navegacióncbbreogan.galCadroGuía oficial da ACB 2009-10, páxina 201Guía oficial ACB 1992, páxina 183. Editorial DB.É de 6.500 espectadores sentados axeitándose á última normativa"Estudiantes Junior, entre as mellores canteiras"o orixinalHemeroteca El Mundo Deportivo, 16 setembro de 1970, páxina 12Historia do BreogánAlfredo Pérez, o último canoneiroHistoria C.B. BreogánHemeroteca de El Mundo DeportivoJimmy Wright, norteamericano do Breogán deixará Lugo por ameazas de morteResultados de Breogán en 1986-87Resultados de Breogán en 1990-91Ficha de Velimir Perasović en acb.comResultados de Breogán en 1994-95Breogán arrasa al Barça. "El Mundo Deportivo", 27 de setembro de 1999, páxina 58CB Breogán - FC BarcelonaA FEB invita a participar nunha nova Liga EuropeaCharlie Bell na prensa estatalMáximos anotadores 2005Tempada 2005-06 : Tódolos Xogadores da Xornada""Non quero pensar nunha man negra, mais pregúntome que está a pasar""o orixinalRaúl López, orgulloso dos xogadores, presume da boa saúde económica do BreogánJulio González confirma que cesa como presidente del BreogánHomenaxe a Lisardo GómezA tempada do rexurdimento celesteEntrevista a Lisardo GómezEl COB dinamita el Pazo para forzar el quinto (69-73)Cafés Candelas, patrocinador del CB Breogán"Suso Lázare, novo presidente do Breogán"o orixinalCafés Candelas Breogán firma el mayor triunfo de la historiaEl Breogán realizará 17 homenajes por su cincuenta aniversario"O Breogán honra ao seu fundador e primeiro presidente"o orixinalMiguel Giao recibiu a homenaxe do PazoHomenaxe aos primeiros gladiadores celestesO home que nos amosa como ver o Breo co corazónTita Franco será homenaxeada polos #50anosdeBreoJulio Vila recibirá unha homenaxe in memoriam polos #50anosdeBreo"O Breogán homenaxeará aos seus aboados máis veteráns"Pechada ovación a «Capi» Sanmartín e Ricardo «Corazón de González»Homenaxe por décadas de informaciónPaco García volve ao Pazo con motivo do 50 aniversario"Resultados y clasificaciones""O Cafés Candelas Breogán, campión da Copa Princesa""O Cafés Candelas Breogán, equipo ACB"C.B. Breogán"Proxecto social"o orixinal"Centros asociados"o orixinalFicha en imdb.comMario Camus trata la recuperación del amor en 'La vieja música', su última película"Páxina web oficial""Club Baloncesto Breogán""C. B. Breogán S.A.D."eehttp://www.fegaba.com

Vilaño, A Laracha Índice Patrimonio | Lugares e parroquias | Véxase tamén | Menú de navegación43°14′52″N 8°36′03″O / 43.24775, -8.60070

Cegueira Índice Epidemioloxía | Deficiencia visual | Tipos de cegueira | Principais causas de cegueira | Tratamento | Técnicas de adaptación e axudas | Vida dos cegos | Primeiros auxilios | Crenzas respecto das persoas cegas | Crenzas das persoas cegas | O neno deficiente visual | Aspectos psicolóxicos da cegueira | Notas | Véxase tamén | Menú de navegación54.054.154.436928256blindnessDicionario da Real Academia GalegaPortal das Palabras"International Standards: Visual Standards — Aspects and Ranges of Vision Loss with Emphasis on Population Surveys.""Visual impairment and blindness""Presentan un plan para previr a cegueira"o orixinalACCDV Associació Catalana de Cecs i Disminuïts Visuals - PMFTrachoma"Effect of gene therapy on visual function in Leber's congenital amaurosis"1844137110.1056/NEJMoa0802268Cans guía - os mellores amigos dos cegosArquivadoEscola de cans guía para cegos en Mortágua, PortugalArquivado"Tecnología para ciegos y deficientes visuales. Recopilación de recursos gratuitos en la Red""Colorino""‘COL.diesis’, escuchar los sonidos del color""COL.diesis: Transforming Colour into Melody and Implementing the Result in a Colour Sensor Device"o orixinal"Sistema de desarrollo de sinestesia color-sonido para invidentes utilizando un protocolo de audio""Enseñanza táctil - geometría y color. Juegos didácticos para niños ciegos y videntes""Sistema Constanz"L'ocupació laboral dels cecs a l'Estat espanyol està pràcticament equiparada a la de les persones amb visió, entrevista amb Pedro ZuritaONCE (Organización Nacional de Cegos de España)Prevención da cegueiraDescrición de deficiencias visuais (Disc@pnet)Braillín, un boneco atractivo para calquera neno, con ou sen discapacidade, que permite familiarizarse co sistema de escritura e lectura brailleAxudas Técnicas36838ID00897494007150-90057129528256DOID:1432HP:0000618D001766C10.597.751.941.162C97109C0155020