multi selection – What is the best way to present a question where user has to select multiple options?

I am working on a mobile app where, user has to select few categories and subcategories to proceed. eg: Let’s assume I have four categories A,B,C & D. All these four categories have subcategories which are 10-20 in numbers.

  • My goal here is to create question papers for primary school kids. The app is for the parents. Let’s say subjects are the primary categories. Subcategories include which chapters to include in the test.

  • There are four subjects and each subjects have 10-15 chapters.

  • He/She can select more than one category/subcategories.

  • User will see a summary screen of the items selected.

He/She can select more than one category/subcategories.
User will see a summary screen of the items selected.

Prove or Disprove the following question about power series?

Prove or Disprove the following statement:

Function $N(s) = 1 + sum_{n=1}^{infty} dfrac{a^ns^n}{(2n)!} $ for a parameter $a in mathbb{R},$ then $N(s)$ satisfies
$$N(s) geq 0 ; forall s geq 0.$$

pr.probability – Simple math question regarding a very important medical diagnosis

I am faced with an unfortunate, however VERY slim chance, of a particularly unsatisfactory medical condition. I know the chances of said condition coming to fruition, but given that there is also a dynamic timeline, I’m a bit confused on the math. So, if someone can give me the answer to this I’m sure it will ease my VERY anxious mind a bit. I’m not sure I’m going to word this properly, but I’ll try..

Think of this as a science experiment in terms of the setup for this. The test subjects are entered into a YES or NO situation, the chance of YES being 1 out of 665, and the chance of NO of course being 664 out of 665. This YES or NO over the timeline of this study can, however, change, but only from NO to YES. At the timeline Benchmark A, 95% of the test subjects in this study that will get a YES will get the YES definitively at this point, and if that occurs the study is over and the rest of this does not matter for that test subject.

But, if the subject gets a NO at Benchmark A, the definitive nature of this can only be measured retroactively at Benchmark B, so it is possible to get a NO at Benchmark A and then a YES at Benchmark B, but getting a NO at Benchmark A obviously presents a much less chance of a YES at Benchmark B.

At timeline Benchmark B, the remaining 5% of the test subjects in this study will know if their NO is changed to a YES. That said, if a test subject gets a NO (chances 664 out of 665) at Benchmark A, what are the chances that the subject will end up with a YES by Benchmark B?

Hopefully I didn’t over-complicate this too much. I just wanted to be sure I gave all the information. Thank you in advance! Please help me ease my worried mind with some data so I can maybe sleep and eat normally again! 🙂

Any suggestions how to solve graph question

Thanks for contributing an answer to Computer Science Stack Exchange!

  • Please be sure to answer the question. Provide details and share your research!

But avoid

  • Asking for help, clarification, or responding to other answers.
  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.

To learn more, see our tips on writing great answers.

linear algebra – Notation question about matrices

Thanks for contributing an answer to Mathematics Stack Exchange!

  • Please be sure to answer the question. Provide details and share your research!

But avoid

  • Asking for help, clarification, or responding to other answers.
  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.

To learn more, see our tips on writing great answers.

stack exchange – Why do i get a: This question doesn’t meet our quality standards?

Stack Exchange Network


Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

questionnaire – Running a competition (contest) to gain responses from a question?

I had a random thought last night and thought “what if I ran a competition (contest) to find answers to a question”. As it is Christmas time, I could run a small competition for my community to “tell me about their favourite thing about the town”. This would generate a fair amount of responses, but I ‘m also wondering if that will also generate fake responses.

Asking something like “What could be improved on in our local community” seems a bit better but also a bit of a mood-kill for a festive competition.

Or maybe I could ask a different question.

Any thoughts on this?

Question about cPanel skins

I was wondering if anyone knows how can I skin cPanel just like Siteground has?

Math function question – Mathematics Stack Exchange

Thanks for contributing an answer to Mathematics Stack Exchange!

  • Please be sure to answer the question. Provide details and share your research!

But avoid

  • Asking for help, clarification, or responding to other answers.
  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.

To learn more, see our tips on writing great answers.

approximation – Help to clear an ambiguty in this question

in this question greedy algorithm must select k edges?if it’s true can we say our optimal solution is to select k vertices?
problem:
Given a integer k , complete bipartite graph A,B & $c_{ij}$cost of any edges between section A,B is non-negative. we want find $|S|leq k$ such that maximize $sum_{jin B}max_{i in S}{c_{ij}}$ .describe a greedy algorithm with approximation factor $(1-frac{1}{e})$.