All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
50 - or more (Posted on 2020-09-10) Difficulty: 4 of 5
Let's start with a triplet of integers, say (1, 2, 5) and a set of mathematical operations (+, -, *, /, ^, sqrt, fact!, concatenation, brackets).

Our task will be to represent all (or almost all - as explained below) integers from 1 to n using some or all of the initial triplet and any quantity of operations defined above.

So:
1=1
6=1+5
9=5*2-1
13=15-2
27=51-4!
60=12*5 etc

Let's define n as the first occurrence of not being able to find a valid representation for n+1 and for n+2. I believe that in our case n=17 (15+2), since neither 18 nor 19 get valid solutions.

You are requested to find a triplet of integers (a,b,c) enabling a maximal n.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re(3): RecordCharlie2020-09-17 07:11:11
Some Thoughtsre(2): RecordDej Mar2020-09-16 14:30:38
50 - or more Kathie2020-09-15 16:10:04
Some Thoughtsre: RecordDej Mar2020-09-14 08:49:04
Some Thoughtsre: RecordDej Mar2020-09-12 11:51:16
re(3): some hints & remarks @ ChCharlie2020-09-11 07:38:31
re(2): some hints & remarks @ ChAdy TZIDON2020-09-11 06:41:50
Questionre: some hints & remarks @ ChDej Mar2020-09-11 03:22:28
re: RecordCharlie2020-09-10 20:58:48
SolutionRecordAdy TZIDON2020-09-10 18:21:39
Solutionre: another, higher............. and higherAdy TZIDON2020-09-10 17:45:12
Hints/Tipssome hints & remarks @ ChAdy TZIDON2020-09-10 17:12:53
Some Thoughtsanother, higherCharlie2020-09-10 15:17:37
Some Thoughtscomputer findingCharlie2020-09-10 14:25:40
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information