mersenneforum.org Latteral thinking puzzle
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2004-08-17, 15:02 #1 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 2×23×223 Posts Latteral thinking puzzle Complete this finite series. 5, 1 , 2, 5 , 7,... Spoilerise the important parts of your answers.
 2004-08-20, 05:18 #2 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 101000000100102 Posts No takers? I will reveal the next element in the series.
 2004-08-21, 23:19 #3 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 1025810 Posts Next element is : 3 again this is a finite series. This is a lateral thinking problem, so you can never solve it with math (although math can help).
 2004-08-23, 13:16 #4 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 2·23·223 Posts There are 12 elements in this series.
 2004-08-24, 14:27 #5 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 2·23·223 Posts Obviously nobody is interested...... So here is the answer: Numeric representation of the day of the week for the first day of the month for this year.
 2004-09-01, 14:38 #6 biwema     Mar 2004 3·127 Posts I use a shifted version of that sequence to quickly calculate the day of the wee for any day. 1, 4, 4, 0, 2, 5, 0, 3, 6, 1, 4, 6 is easy to remember 144, 025, 036, 146 Add the number of the day in the month and also 2 for 2003, 4 for 2004, 5 for 2005, 6 for 2006, 0 for 2007 calculate the result mod 7, then convert 0 for saturday, 1 for sunday, 2 for monday...

 Similar Threads Thread Thread Starter Forum Replies Last Post jschwar313 GPU to 72 3 2016-01-31 00:50 wblipp Lounge 2 2014-08-29 06:20 Batalov Factoring 6 2011-12-27 22:40 jasong jasong 1 2008-11-11 09:43 Bundu Puzzles 30 2005-11-26 10:33

All times are UTC. The time now is 16:13.

Fri Jan 28 16:13:04 UTC 2022 up 189 days, 10:42, 1 user, load averages: 0.96, 1.21, 1.34

Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔