×

# KCC02 - EDITORIAL

 0 DIFFICULTY: SIMPLE PREREQUISITES: Modulus Operator Problem:  We are provided with a pattern of N numbers and have to find the output for each number of that sequence.  Quick Explanation:  If we look closely we can easily find that the output of each element of the sequence is the sum of divisors of that number excluding itself.  Explanation:  The output for each input number is the sum of its divisors exluding that number and it can be computed easily by checking for number i in range 1<=i
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×1,191
×303
×13
×3

question asked: 18 Mar '18, 18:53

question was seen: 134 times

last updated: 21 Mar '18, 15:31