mersenneforum.org crossnumber #8
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2018-11-08, 18:49 #1 Till     "Tilman Neumann" Jan 2016 Germany 503 Posts crossnumber #8 A challenging puzzle I found mentioned on https://blogs.ams.org/blogonmathblogs/ : http://chalkdustmagazine.com/regular...mber-issue-08/ Last fiddled with by Till on 2018-11-08 at 18:52 Reason: reference
2018-11-08, 21:16   #2
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

2×5×839 Posts

Quote:
 Originally Posted by Till A challenging puzzle I found mentioned on https://blogs.ams.org/blogonmathblogs/ : http://chalkdustmagazine.com/regular...mber-issue-08/
a few things.
9D,36A,20D,3D,4D,22D,8D,26D,23A,5D, and 6D have to all be 2 mod 5 and 6 mod 7 ( so 27 mod 35)
21A is 257
16D and 3A both show 18A<72, if different 18A<69
1A is surrounded by numbers that only have 2's and 3's as factors because n^2-1=(n-1)*(n+1)

2018-11-08, 22:42   #3
petrw1
1976 Toyota Corona years forever!

"Wayne"
Nov 2006

121408 Posts

Quote:
 Originally Posted by science_man_88 a few things. 9D,36A,20D,3D,4D,22D,8D,26D,23A,5D, and 6D have to all be 2 mod 5 and 6 mod 7 ( so 27 mod 35) 21A is 257 16D and 3A both show 18A<72, if different 18A<69 1A is surrounded by numbers that only have 2's and 3's as factors because n^2-1=(n-1)*(n+1)
I found this one MUCH easier than one I did a few months ago....only took me a few hours off and on.

Now lets hope I submitted the right sum

2 hints:
34A; Proth Numbers
14D: Triperfect number

Last fiddled with by petrw1 on 2018-11-08 at 22:51

 Similar Threads Thread Thread Starter Forum Replies Last Post wflaherty99 Puzzles 9 2018-05-15 20:12 henryzz Puzzles 12 2016-08-24 09:12

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

Mon Aug 8 16:29:32 UTC 2022 up 32 days, 11:16, 1 user, load averages: 0.91, 1.11, 1.16

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.

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