Can This Greedy Algorithm Help Anatjari Minimize His Desert Stops?

  • Thread starter Thread starter black_red_cragon
  • Start date Start date
  • Tags Tags
    Algorithm Design
black_red_cragon
Messages
1
Reaction score
0
Hi :smile:
This is a simple algothim problem,please help me solve it .I think its a greedy problem
Here it is:
-------------------
A native austratial named anatjari wants to cross a desert carrying only one bottle of water.He has a map that marks all the watering holes along the way .Assuming he can walk k miles on one bottle,design an eff. algo for determining where anatjari should stop to minimize the num of stops.
--------------------
It is not clear how the holes are marked in the map so i am assuming the desert to be a long straight path.
Any help would be appreciated.
TIA.
r_b_cragon :confused:
 
Physics news on Phys.org
What have you done so far?
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'

Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'

This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
View full post »

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Similar threads

Kerbal Space Program - Rocket Design Basics
Replies
2
Views
9K
I What Key Issues Should Cosmologists Address in the ΛCDM Model?
Replies
1
Views
3K
Do Movies Teach Us Realistic Life Skills?
Replies
1
Views
10K

Hot Threads

Recent Insights

Back
Top