Changes
Jump to navigation
Jump to search
← Older edit
Newer edit →
Recursion
(view source)
Revision as of 17:08, February 18, 2016
387 bytes added
,
17:08, February 18, 2016
divisibility by three
Line 1:
Line 1:
'''Recursion''' is the repeated application of a procedure or definition through reference to itself.
'''Recursion''' is the repeated application of a procedure or definition through reference to itself.
+
+
===In Mathematics===
+
+
There's a simple procedure for finding out whether a number is divisible by three.
+
#If the number is 3, 6, or 9 then it's divisible by three.
+
#Otherwise, add all the digits of the number; if the sum of the digits is divisible by three, then so is the original number.
+
+
Examples:
+
* 12 => 1 + 2 = 3 (yes)
+
* 14 => 1 + 4 = 5 (no)
+
* 96 => 9 + 6 = 15; 15 => 1 + 5 = 6
+
===In Computing===
===In Computing===
Ed Poor
Siteadmin,
Check users
, nsTeam1RO, nsTeam1RW, nsTeam1_talkRO, nsTeam1_talkRW, oversight,
Administrators
30,650
edits
Navigation menu
Personal tools
Create account
Log in
Namespaces
Article
talk page
Variants
Views
Read
View source
View history
More
Search
Popular Links
Main Page
Recent changes
New Pages
Random page
Statistics
Edit Console
Special pages
Printable version